Scribd
Upload
47 views14 pages

Syllabus

The syllabus for Data Structures and Algorithms (DSA) is presented by Kartik Mathur, co-founder and Academics head at Coding Blocks, who has trained over 40,000 students. It covers essential data structures such as arrays, linked lists, stacks, queues, trees, heaps, hashmaps, graphs, tries, recursion, and dynamic programming, along with important algorithms and implementation techniques. Additional resources include links to free programming playlists, revision sheets, and articles for further learning.

Uploaded by

Vijay Kumar3366
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views14 pages

Syllabus

The syllabus for Data Structures and Algorithms (DSA) is presented by Kartik Mathur, co-founder and Academics head at Coding Blocks, who has trained over 40,000 students. It covers essential data structures such as arrays, linked lists, stacks, queues, trees, heaps, hashmaps, graphs, tries, recursion, and dynamic programming, along with important algorithms and implementation techniques. Additional resources include links to free programming playlists, revision sheets, and articles for further learning.

Uploaded by

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

Syllabus for DSA

Who am I
Kartik Mathur
Co founder and Academics head at Coding Blocks

- Graduated from NSIT


- Have trained more than 40k students
- Helped students crack Google, Meta, Twitter, Apple,
Microsoft, Amazon, Adobe, Sprinklr and other Top
companies
- Love coding, want people to fall in love with it

LinkedIn: https://www.linkedin.com/in/kartik-mathur/

Email: [email protected]

Youtube Community Link:


https://chat.whatsapp.com/CQDIALML8zmIBSVVqkRVaV

Revision Sheet Link:


https://docs.google.com/spreadsheets/d/19apL5zHAkOUpPf-SyvZK
q4Dd_5FUkHThdw7RZjSBNAo/edit?usp=sharing
What should we learn?
Most important Data Structures
- Arrays
- Strings(Character Arrays)
- Linked List
- Stack
- Queues
- Binary Trees
- Binary Search Trees
- Heaps/Priority Queues
- Hashmap
- Tries
- Graphs
- Recursion
- DP

Free playlist to start programming: https://www.youtube.com/playlist?list=PLl4Y2XuUavmvTmGOl4XUT7bO_qbcrFAhO


Most important Data structures
Arrays
- Implementation Questions (Maths)
- Two Pointers
- Binary Search
- Divide and Conquer
- Matrix
- Sorting
- Bit manipulation
- Sliding Window
- Prefix and Suffix Sum
- Rotation and Reversal
- Important Algorithms
- Kadane's Algorithm
- Prime Sieve
- Manacher’s Algorithm
- Quick, Merge, Insertion, Selection, Bubble, Counting sort
- KMP, Z’s, Rabin Karp
- Moore’s Voting Algorithm
Most important Data structures
Linked List
- Singly, Doubly and Circular Linked List
- Using Pointers on LL
- Sorting Algorithms
- Finding Intersection
- Merging Multiple Linked Lists
- Reverse Algorithms
- K-Reverse
- Reverse Linked List(Data and Pointers Method)
- Cycle Detection Algorithm(Floyd’s Cycle Detection)
Most important Data structures
Stack
- Implementation Based Problems
- Expressions Conversions Problems
- Reverse Algorithms
- Deletion in Stack
- Most Important Problems for Interview
- Min and Max Stack in O(1) space
- Next greater/smaller element
- Largest Area in Histogram
- Celebrity Problem
Most important Data structures
Queue
- Implementation Questions
- Sliding Window
- Deque
- Circular Queue
- Stack based queue problems
One Article that you can refer to: https://introcs.cs.princeton.edu/java/43stack/
Most important Data structures
Binary and Binary Search Trees
- Implementation
- Traversals
- In order, Pre order, Post order and Level Order(Recursive
ways)
- Morris traversals(In, Pre and Post order iterative ways)
- Vertical and Zigzag
- Standard Problems
- Diameter - O(N)
- Balanced Tree - O(N)
- Height
- Deletion in Trees
- Conversion Trees to Linked List
- Print views(Top, Down, Left, Right, Zig-Zag)
- Tree Pruning
- Lowest Common Ancestor
- Path Sum Iterations
- Subtrees Problem(Max BST in BT)
- Modify Tree Algorithms
Most important Data structures
Priority Queue/ Heap
- Implementation
- Sorting
- Heapify working
- Height of complete binary tree
- Most Important Interview Questions
- Meeting Rooms
- Merge K Linked Lists/Arrays
- Finding Min and Max Elements
- Median of Infinite Running Stream Numbers
- Find K largest/smallest elements/pairs
Most important Data structures
Hashmaps
- Implementation
- Collision handling schemes
- How hashmaps work in O(1) average
- Ordered v/s Unordered Map
Most important Data structures
Graphs
- Implementation
- Adjacency List(Most Important)
- BFS and DFS
- Traversals: BFT and DFT
- Connected Components
- Minimum Path Algorithms weighted
- Dijkstra’s Algorithm
- Minimum Spanning Tree
- DSU
- Path Compression
- Kruskal’s Algorithm
- Topological Sorting
- Bellman Ford
- Warshall
Most important Data structures
Tries
- Implementation
- Max Xor Pair
- Max Sum Subarray
- Same Prefix Count
Most important Data structures
Recursion
- Basic Questions
- Recursion on Arrays
- Recursion on Strings
- Recursion Grid Based
- Recursion on Subsets
- Backtracking
- Classic Problems
- Chessboard problems: N-Queen/ N-Knight
- Rat in Maze
- Sudoku Solver
- Permutations
- Phone Keypad
Most important Data structures
Dynamic Programming
- Basics of DP
- Top down
- Bottom Up
- Relation between Recursion and DP
- 1-D and 2-D DP
- Classic Problems
- Coin Change
- Knapsack
- Inclusion and Exclusion
- LIS
- LCS
- Rod Cutting
- Edit Distance
- Staircase Problem
- Chessboard Problems

You might also like