DEV Community

Punit Sharma
Punit Sharma

Posted on

Beginning My LeetCode Journey with the NeetCode 150: Progress, Thoughts, and How You Can Too!

While perusing my Masters of Computer Application in Gurugram, I’ve been preparing for coding interviews. It’s been hard but very rewarding. I wanted to get into the tech industry as a full stack web developer, so I decided to step up my study plan by following the famous NeetCode 150 questions list. This list is a carefully chosen set of questions that will help people get ready for software interviews at top tech companies.

Why I Picked the NeetCode 150?
The NeetCode 150 is a full but easy-to-use playlist for anyone who wants to get better at data structures and algorithms. It includes the classic “Blind 75” list and 75 more handpicked questions. It covers all the important topics and groups problems into three levels: Easy, Medium, and Hard. This lets you learn strategically and gradually improve your skills.

My Progress So far
I have finished 9 out of 150 questions so far.
Arrays and Hashing, Two Pointers (for Easy level) are the categories that have been finished.
Right now, I’m working on medium-level problems in linked lists and binary trees.
Learning Highlight: Knowing the ins and outs of two-pointer techniques and recursion has really changed how I solve problems.

Some days are hard, especially after a long day of lectures and homework, but sticking to a schedule (my goal is 10 questions per week) keeps me going. Tracking the percent of completion helps you see how far you’ve come and keep going.

Doing the code solutions by hand: Reading the NeetCode solution is helpful, but actually writing the code yourself is what really helps you understand.
Concentrate on Weak Areas: Are you having trouble with a problem? Put it aside for a week and then look at it again.

Stay on track: Even solving one or two problems a day adds up quickly!

Don’t Compare Your Progress: Everyone’s path is different. Some days you’ll solve a lot of problems, and other days you’ll only solve one. That’s fine.

Happy coding ;-)

Top comments (0)