Coding my way to glory, via Competitive Programming: One day at a time!

DHARA DOSHI
TechbasiCS
Published in
2 min readSep 29, 2015

There is a new interesting kid on the block for me: Competitive Programming. I love it ❤

A few months back I was introduced to the wonderful world of CP(Henceforth I’ll call it CP with love ;) and I tried my hands at one of the TopCoder SRM for Algorithms. Each SRM contains 3 questions with easy, medium, and difficult levels respectively. When I solved the easy and medium problems it boosted my morale, but I couldn’t even move the difficult problem. After a fair time of trying to solve it, I gave in and looked at the solution, I found it the most elegant solution I have ever come across. It was beautiful code.

This entire exercise of solving only 3 problems made me realize how powerful CP is and how much fulfillment it can bring.

By profession, I am a full-time software engineer, but anyone who works for a big organization knows, that sometimes your coding skills become rusty despite coding for a living. While we spend a considerable time coding, a major part of the year goes into debugging, acquiring domain expertise, testing, etc. Hence this is the perfect way for a software engineer to exercise their brains to solve problems using the might of computer science.

“I repent why I didn’t know about CP in my college days”

So now that I have shared my love for CP, let me share with you all about my new pet project.

The idea is to solve one Project Euler problem every day through Hackerrank.

I have thought of solving problems on Project Euler for a long time now. How and when did I learn about it, I hardly remember, but thankfully procrastination days are limited once we decide to take action.

I’ll keep you posted about my experience through more Medium posts.

Here I go, coding my way to glory, via Competitive Programming:

One day at a time!

--

--

DHARA DOSHI
TechbasiCS

Computer Science Addict, Software Engineer, Philosopher, Avid Reader, Lover of learning, Optimization Freak.