Tarun Yadav
Senior Software Engineer at IndiaMART InterMESH Limited
Uttar Pradesh, India
Summary
👤
Senior🎓
Top SchoolTarun Yadav is a Senior Software Engineer with 7 years of hands-on experience building backend systems at IndiaMART and a strong foundation in algorithms and competitive programming. A BTech computer science graduate and former CodeChef chapter president, he has solved 600+ DSA problems and mentored contributors during GSSOC, demonstrating both technical depth and community leadership. He contributes to open-source algorithm collections like Algo-Tree, where he optimized core implementations such as Kadane’s algorithm for O(n) performance. Comfortable across Android development, backend engineering and technical writing, Tarun combines rigorous problem-solving with practical product delivery. Based in Uttar Pradesh, India, he brings a rare blend of mentorship, contest-level algorithmic expertise, and production experience.
7 years of coding experience
4 years of employment as a software developer
Kendriya Vidyalaya SangathanBachelor of Technology - BTech Computer Science, Bachelor of Technology - BTech Computer Science at JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (11)
algorithm10
data-structures10
algorithms10
c-language10
cprogramming-language10
data-structure10
arrayobject9
sorting-algorithms8
recursion4
backtracking3
bit-manipulation3
Programming languages (3)
Github contributions (5)
Algo-Phantoms/Algo-Tree
Jan 2021 - May 2021
Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
Role in this project:
Back-end Developer
Back-end DeveloperContributions:181 reviews, 18 commits, 96 PRs in 3 months
Contributions summary:Tarun primarily contributed to the `kadane_algo.cpp` file, implementing and optimizing Kadane's Algorithm for the maximum subarray sum problem. They added code, comments for clarity, and made incremental updates. The user optimized the algorithm's time complexity to O(n) by improving the logic and test cases to improve the usability and accuracy of the solution.
arraypythonstringbacktrackinggreedy-algorithms
plazzy99/Codechef-1
Mar 2019 - Apr 2019
my codes of contest problems
Contributions:6 commits in 1 month
problemspythonleetcodecompetitive-programming
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.