William Fiset
Software Engineer at Google
San Francisco, California, United States
Summary
🤩
Rockstar🎓
Top SchoolWilliam Fiset is a seasoned software engineer with 14 years of experience, currently building food discovery and location platform features at Google in San Francisco. His background in joint honors Mathematics and Computer Science underpins a strong algorithmic focus demonstrated by open-source contributions implementing data structures, graph algorithms, topological sorts and Bellman-Ford variants. He has a track record of shipping backend systems and improving code readability—refactoring core Java data structures with comprehensive tests. William blends production engineering at scale with teaching experience (university TA and video instructor), which helps him communicate complex ideas clearly. Notably, his DEPRECATED-data-structures repo and contributions to the large OpenGenus/cosmos dataset reflect a long-standing commitment to shared learning and reproducible algorithm implementations. He brings a pragmatic, research-informed approach to building reliable, testable backend systems.
14 years of coding experience
Joint Honors in Mathematics and Computer Science, Joint Honors in Mathematics and Computer Science at Mount Allison University
English, French
Stackoverflow
1,542reputation
1.6mreached
20answers
17questions
geometry
top-5%
Github Skills (23)
algorithms10
graph-algorithms10
data-structure10
bellman-ford10
java10
javas10
junit10
data-structures10
topological-sort10
geometry9
algorithm9
priority-queue9
binary-search-tree9
sorting-algorithms9
hashtable8
Programming languages (9)
Github contributions (5)
williamfiset/DEPRECATED-data-structures
Jun 2016 - Aug 2022
A collection of powerful data structures
Role in this project:
Back-end Developer
Back-end DeveloperContributions:557 commits, 9 PRs, 399 pushes in 6 years 2 months
Contributions summary:William was primarily involved in implementing core data structures and algorithms in Java, focusing on data structures like ArrayLists, priority queues, and a basic red-black tree implementation. Their contributions include the initial implementation of several data structures with associated test cases, as evidenced by the inclusion of Junit and various test scenarios. Furthermore, the user refactored code to improve its readability and clarity of functionality.
data-structuredata-structuresjavaheapbinarytree
OpenGenus/cosmos
Oct 2017 - Oct 2017
World's largest Contributor driven code dataset | Used in Quark Search Engine, @OpenGenus IQ, OpenGenus Visual Project
Role in this project:Back-end Developer
Back-end DeveloperContributions:8 commits, 5 PRs, 8 comments in 2 days
Contributions summary:William primarily contributed to the implementation of graph algorithms, specifically topological sort and shortest path algorithms for directed acyclic graphs. The user provided multiple implementations of topological sort, including adjacency list and adjacency matrix variations, and integrated them into broader projects by incorporating shortest path algorithms. The user also contributed to the implementation of the Bellman-Ford algorithm for finding the shortest paths in graphs.
search-engineopengenusdatastructuresoffline-appsorting-algorithms
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.