Scribd
Upload
9 views1 page

DSA Topics

The document outlines essential topics for mastering algorithms and data structures, including time complexity, arrays, strings, sorting and searching algorithms, and hashing. It emphasizes the importance of understanding recursion, backtracking, dynamic programming, and advanced algorithms like KMP and Rabin Karp. Additionally, it covers practical applications such as sliding window techniques and prefix sums, along with data structures like linked lists, stacks, and queues.

Uploaded by

deepakpalrocks
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
9 views1 page

DSA Topics

The document outlines essential topics for mastering algorithms and data structures, including time complexity, arrays, strings, sorting and searching algorithms, and hashing. It emphasizes the importance of understanding recursion, backtracking, dynamic programming, and advanced algorithms like KMP and Rabin Karp. Additionally, it covers practical applications such as sliding window techniques and prefix sums, along with data structures like linked lists, stacks, and queues.

Uploaded by

deepakpalrocks
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Time Complexity(Big O notation) and basic math(binary to deciaml, working of


bitwise operators like &(AND),|(OR),^(XOR),<<(LEFT SHIFT),>>(RIGHT SHIFT) )

2. Arrays and Strings {leetcode cards}(also learn to use some library functions
like sort, and basic character functions like isUppercase,isDigit,toUppercase
etc..)

3. Basic Sorting algos(Bubble Sort,Selection Sort,Insertion sort(not much useful in


solving questions bcoz of bad time complexity but need to be remebered))

4. Searching algos(Linear Search, Binary Search) and two pointer technique

5. Hashing (learn to use a hashmap)

6. Linked List(Can be done entirely from Leetcode Card in Explore Section)

7. Stack(V. imp: learn the Next greater element algo )(YT:Aditya Verma)

8. Queue{leetcode card}(also Deque)

9. Some medium math problems(learn "Sieve of eratosthenes" ,"modular


exponentiation", "Eucledian GCD algorithm","finding all factors in O(sqrt(n))") and
solve some game theory problems.

10. Greedy Problems and some bit manipulation(the XOR trick to find a duplicate
element and some bitmask q)

11. Sliding Window Algorithms(YT:Aditya Verma)

12. Prefix Sum( subarray sum equals k ,subarray sum divisible by k, max size
subarray with equal zero and ones........) then, use of prefix sum in 2D arrays.

13. Recursion (YT:Aditya Verma)

14. Backtracking

15. Divide and Conquer and other sorting techniques(Merge Sort,Quick Sort, Bucket
Sort(ek bhot accha q tha iska mil nhi rha xD))

16. Dynamic Programming(YT: Aditya Verma) (also solve some problems on DP where you
have to find path in a grid )

17. some advanced binary search (my fav xD)

18. some advanced algos : KMP Algo, Rabin Karp algo, Manacher aglo,

19. Divide and conquer (also quickselect algo)

20. Graphs Trees and Heaps

You might also like