ROADMAP TO DSA

@NSUT
Puzzle time

What is the minimum

number of weighs you
need to do to identify the
different ball

You have a Weighing scale

Puzzle time
Approach 1

1 3

2
 Puzzle time
Approach 2

Unequal 1
Equal

OR
2
Why should we learn to
code?
Increases logical and analytical skills

Useful in all spheres of life

Best packages and career options

Global options for work and growth

Great for Entrepreneurship

Best packages are in IT
Who can ace it?
Is Coding only for IT and
CSE students?
OR
Is it that only
Superhumans can ace it?
Quick question
Self learning
Hiring Drives and DSA
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 structurs
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
Web Dev Importance
Managing College with Studies?
Kya Padhu?
Java
Python

DSA Data Science?

C++
ML Chhodo UPSC karke intekaam lunga!
How to ensure selection in
FAANG?

1. Learn DSA
2. Solve 300-400 standard
problems
3. Build Leetcode profile
4. Codeforces – 1700 Rating
Get full proof ready for every organization?
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: http://cb.lk/km

Email: [email protected]

Phone: 95601-96180
Consistency is the key
Coding culture in college
Most important
Most important
Most important
Most important
Most important

Bhai, 100-200 zyada le le

par place karva de
Cracking Top Organisations
Workshop certificate:

https://cb.lk/nsutaug

Website: www.codingblocks.com
Queries

QnA
Locations
Since many of you asked
me to put the upcoming
batches and Center
location in the
presentation, you can
refer this information
and join any upcoming
batches as you may
deem fit
Thank you