• Programming Skills
• Data Structure
• Algorithm
• Graph Theory
• Dynamic Programming
• Binary Search
• SQL

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/

Developed with ♥ by MSC Codeportal Team at MSC Project Wing.

Simple overview of use/purpose.

An in-depth paragraph about your project and overview of use.

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array

Step: 1 - Fork the project repository

Step: 2 - Clone your forked project repository git clone https://github.com/<your_github_username>/Whatsapp-Clone.git

Step: 3 - Navigate to your forked/local repository cd Whatsapp-Clone

Step: 4 - Check that your fork is the "origin" remote git remote -v [You should now see 2 'origin' url]

Step: 5 - If you don't see an "origin" remote, you can add it using: git remote add origin https://github.com/<your_github_username>/Whatsapp-Clone.git

Folks, Leave me a comment / URL if something you like is missing!

1. [CLRS Book Solutions] (https://github.com/gzc/CLRS)
   

2. [William Fiset] (https://www.youtube.com/watch?v=RBSGKlAvoiM&ab_channel=freeCodeCamp.org)
   

3. [Interview Camp] (https://drive.google.com/drive/u/0/folders/1dIeMx4tAnmTogCl5ltugfITBzJ15mVXP)
   

4. [Awesome-Algorithms] (https://github.com/tayllan/awesome-algorithms#readme)
   

5. [Interview Centered] (https://drive.google.com/drive/u/0/folders/1dIeMx4tAnmTogCl5ltugfITBzJ15mVXP)