Table for Beginners To Practice Coding problems on Geeks for Geeks.
I know, it is difficult for a beginner to find best series of problems which is enough to improve programming fundamentals as well as improving problem-solving skills. This article will help you a lot. Also, I am pretty sure you will be able to excel on sites like Codeforces, CodeChef etc.
- Here, I have sorted problems topic-wise with increasing difficulty level.
- In each column, you can solve Unlimited problems of that particular topic and difficulty level.
- When you feel you have done minimum 10 questions on a particular column, you can move on to another column (difficulty level ) or move on to next row (Topic).
- Also you will find different problems each time in next column.
- The First 3 columns will improve concept and grip on respective topics. (You only need to write function here)
- Last 2 columns will improve problem solving skills. ( Implementation problems )
- In each link, problems will be sorted top to bottom with increasing difficulty
| Topics ⇣ | Difficulty ⇢ | Easy | Medium | Difficult | I1 | I2 |
|---|---|---|---|---|---|
| Mathematical Algorithms / Number theory | |||||
| Puzzles | |||||
| Arrays | |||||
| String | |||||
| Searching | |||||
| Sorting | |||||
| Hashing | |||||
| Matrix | |||||
| Recursion | |||||
| Divide & Conquer | |||||
| Linked List | |||||
| Doubly Linked List / Circular Linked List | |||||
| Stack | |||||
| Queue | |||||
| Prefix Sum & Sliding Window | |||||
| Bit Magic | |||||
| Tree | |||||
| Binary Search Tree | |||||
| Heap | |||||
| Graph | |||||
| Greedy Algorithms | |||||
| Dynamic Programming | |||||
| Backtracking | |||||
| Trie |
Note: You can change sorting or remove sorting in every link.
By completing this table, you will have strong programming fundamentals and feel confident about your placement. Good luck!.
Post a Comment