Ahmad Elsagheer
Co-Founder at Nexplore
Cairo, Cairo, Egypt
Summary
🤩
Rockstar🎓
Top SchoolAhmad Elsagheer is a Cairo-based software engineer and founder with a decade of experience building high-scale marketplaces and developer tools. He co-founded Nexplore after leading R&D at Swvl, where he helped scale the platform to 200K+ bookings per day and designed core optimization algorithms for routing, demand estimation, and dynamic matching. He’s held senior engineering roles at multiple startups and taught algorithms at the German University in Cairo, reflecting a blend of hands-on systems design and mentorship. An active competitive programmer, Ahmad maintains a well-used algorithms library on GitHub that implements graph algorithms, flows, and numerical utilities—evidence of his deep algorithmic rigor. Colleagues describe him as a builder who moves between startup strategy and low-level algorithm design, often coding late into the night to ship pragmatic solutions.
10 years of coding experience
7 years of employment as a software developer
Bachelor's degree Computer Science, Bachelor's degree Computer Science at The German University in CairoBachelor's Thesis Computer Science, Bachelor's Thesis Computer Science at Baden-Wuerttemberg Cooperative State University (DHBW)High School Diploma High School/Secondary Diplomas and Certificates, High School Diploma High School/Secondary Diplomas and Certificates at Minya Language School
English, Arabic
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (8)
data-structures10
javas10
algorithms10
graph-algorithms10
data-structure10
java10
sorting-algorithms10
combinatorics9
Programming languages (5)
Github contributions (5)
AhmadElsagheer/Competitive-programming-library
May 2016 - Dec 2019
Code library for competitive programming purposes.
Role in this project:
Back-end Developer
Back-end DeveloperContributions:235 commits, 26 PRs, 226 pushes in 3 years 6 months
Contributions summary:Ahmad primarily contributed to developing a competitive programming code library. Their work involved implementing various data structures and algorithms, including sorting algorithms like Merge Sort, graph traversal algorithms (DFS, BFS, topological sort), shortest path algorithms (Dijkstra, Floyd-Warshall), and maximum flow algorithms (Edmonds-Karp). They also added utility functions such as binary exponentiation, matrix power, and combinatorics functions.
competitivepythongraphscombinatoricscompetitive-programming
mostafa-abdullah/kheir-blogger
Feb 2016 - May 2016
Contributions:251 commits, 130 PRs, 157 pushes in 2 months
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.