-
Notifications
You must be signed in to change notification settings - Fork 0
/
dsa-memo-points.txt
50 lines (29 loc) · 2.97 KB
/
dsa-memo-points.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
competitive programming certainly helps but is not the only way to go.
Basic Level:
* GeeksforGeeks provides comprehensive tutorials and practice problems for a variety of data structures.
* HackerRank offers a series of challenges to help you practice and reinforce your understanding of basic data structures.
Intermediate Level:
* LeetCode is a platform with a vast collection of coding challenges categorized by difficulty. It's great for building problem-solving skills.
* CodeSignal offers a platform to practice coding challenges and participate in coding competitions.
Advanced Level:
* AlgoExpert provides a curated list of coding interview questions with detailed solutions and video explanations.
* Practice advanced data structures like Trie, Segment Tree, etc., on HackerEarth's platform.
Also DSA Series of Love Babbar and Raj Vikramaditya has been a go-to place for me with such amazing content.
===============================
0-2 week: Get your basics strong, most importantly loops. Practice pattern printing questions, it will help you in logic building too
.
3rd week: Learn about functions and pointers (if applicable). Also understand how recursion works and practice basic recursion questions
.
4-5 week: Watch array tutorials, read articles on gfg. First understand the theory and concept of arrays. Do the basic implementation like input, output, sum of array, reverse array, etc. Now go to gfg/leetcode, filter questions by Array topic and sort by difficulty. Do 5-6 easy questions, 10-12 medium and 5-6 hard. In total, you should do atleast 20 questions of each topic
.
Next 2-3 months: Repeat the above process as described for Arrays for other data structures. The order should be Array -> Linked List -> Stack -> Queue -> Tree -> Graph -> Heap
.
Next 1 month: Practice the most commonly asked dsa questions. You will find many such dsa sheets like striver and love babbar. "Most common DSA questions geeksforgeeks" this will also give you a list of such questions and I highly recommend it
.
After that just keep in touch with DSA by solving "Leecode question of the Day" or a commonly asked question. That should be enough!
- Important Points to Note:
- Some questions might be combination of different topics, so feel free to skip them while doing topic wise questions
- Mark important questions for later that you think can be important or it you were not able to solve them without looking at the solution
- For Algorithms like Binary Search, Greedy, DP, etc., you can learn about them when you encounter while practicing questions from a topic or can do it dedicatedly too like we are doing for data structures
- Look at different solutions no matter you were able to solve the question or not. It will give you different ideas and more ways to solve it
- Also make notes while learning theory of DSA, it will help you quickly revise before the interviews. It doesn't need to be very formal. Its just for your own understanding