Scribd
Upload
188 views11 pages

Learn DSA

Uploaded by

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

Learn DSA

Uploaded by

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

How to Learn and

Master DSA
By Himanshi Sehgal
DSA

PHASE 1 PHASE 2 PHASE 3


New to DSA Solved 200-250 Strong understanding
of the majority of
problems (Easy or
concepts within Data
Easy Medium) Structures
How to start with DSA
• Familiarity with online problem-solving platforms
• Understand the problem statement and constraints
• Build input and output
• Write solution (Algorithm)
• Write Program & Test Code (resolve errors and debug if required)
1.MATHS
2.ARRAYS
3.STRINGS
4.STACK

Basic DSA 5.QUEUE


6.SEARCHING
Topics 7.SORTING
8.LINKED LIST
9.RECURSION
Easy, Easy-Medium Questions
25-30 questions each
PHASE 2
PRACTISE MORE AND PARTICIPATE IN START GIVING MOCK
MORE MEDIUM PROBLEMS CONTESTS INTERVIEWS

4*x Easy Problems = LeetCode Skill Development


Learning from 2*x Medium Codechef Feedback
problems = Learning from CodeForces Performance
x Hard problems Evaluation
(Analysis)
MEDIUM OR HARD PROBLEMS ON TOPICS MENTIONED
IN PHASE-1
1.Bit Manipulation and Bitmask
2.Two pointers
3.Sliding window

Topics 4.Hashing and Hash table


5.Divide and Conquer
6.Number theory
7.Advanced recursion AND BACKTRACKING (S)

8.GREEDY ALGORITHMS (S)


9.DYNAMIC PROGRAMMING
10.TREES
11.GRAPHS(S)
PHASE -3
• SEGMENT TREES AND FENWICK TREES
• TRIE
• ADVANCE DP
• DISJOINT SET UNION (UNION-FIND)
• ADVANCED GRAPH THEORY
TIPS FOR PBCs DSA INTERVIEWS

● Code Quality
● Debugging Skills
● Logic Building
● Explanation Skills
Important DSA Patterns/ Problems
● Sliding Window ● Subsets
● Islands (Matrix Traversal) ● Modified Binary Search
● Two Pointers ● Bitwise XOR
● Fast & Slow Pointers ● Top ‘K’ Elements
● Merge Intervals ● Topological Sort
● Sorting(Merge Sort) ● 0/1 Knapsack
● In-place Reversal of a LinkedList ● Fibonacci Numbers
● Tree (BFS,DFS) ● Palindromic Subsequence
● Meeting Room Problems ● Longest Common Substring
● Two Heaps
Resources
Ask Questions

You might also like