roadmap.md

Roadmap to complete the Product based Interview for SDE-1

Nearly ~ 500 problem needed to be sloved

General 100 days plan

1. Programming revison for [1-3] days.
2. Ds&Algo: concepts+easy problem [4-60] days.
3. Problem solving: Different pattern question [60-90] days.
4. Advanced Data structure [90-95].
5. Misc Topics [95-100].

Note:
    1.  LLD/HLD are required for SDE 2 not SDE-1 but take an idea.
    2.  Choose only one language to program python/C++ with STL.
    3.  For finance choose C++.[DE Shaw]

Day:01-03 Revison:

• Basics of programming.
• Object oriented programming.
• Pointers.
• Python atleast 50 question.

Day:04-04 Algorithmic time complexity.

Day:05-25 Basic Data structure 4 days per topics:

• Arrays
• Linkedlist
• Stack
• Queues
• Strings

NOTE: For all the problems analysie Time and space complexity, when to use and practice easy problem.

Day:26-40 Algorithm:

• Searching[2 days]
• Sorting[1]
• Divide and Conqure[2 days]
• Greedy Algorithm[3 days]
• Dyanamic Programming[7 days]

NOTE: Practice easy 15-20 problems on each topics.

Day:41-60 Non-Linear Data structure:

• Binary tree - BT, BST, AVL[8 days]
• Heaps[2 days]
• Hashing[2 days]
• Graph, BFS, DFS[5 days]
• Backtracking[3 days]

Day:61-90 Problem solving and Pattern problems:

• Fast and Slow points
  • Linked List Cycle.
  • Middle of the linked list.
  • Happy number.
• DFS
  • Minimum Depth of Binary Tree.
  • Number of islands.
  • Critical connection in a n/w.
  • Clone graph.
  • Path sum.
• Bitwiese Xor
  • Single number.
  • Two single num.
  • Counting bits.
• Two heaps
  • Fin median of num stream.
  • Sliding window median.
  • Maximize capital.
• Modified binary search
  • Median of two sorted array.
  • Ceiling of a number.
  • Search in a sorted infinte array.
  • Bitonic array maximum.
• Top k-elements
  • Kth-smallest element.
  • Connect ropes..
  • Kth largest element in stream.
  • k-closest numbers.
• k-way merge
  • Merge k sorted lists.
  • Kth smallest num in m sorted lists.
  • Kth largest element in stream.
  • Kth smllest number in a sorted matrix.
  • Smallest number range.
• 0/1 knapsack DP
  • equal subset sum partition.
  • min subset sum diff.
  • 0/1 knapsack.
• topological sort
  • tasks scheduling.
  • task scheduling order.
  • alien dictionary.
• subsets
  • balanced paranthesis.
  • subset with duplicates.
  • permutations.
• Merge interval
  • Merge intervals problem.
  • Insert interval..
  • Interval intersection.
  • Conflictong appointments.
• Sliding windows
  • longest substring without repeating chars.
  • sliding window max.
  • min, windows substring
  • Number of Submatrices That Sum to Target
• Minimum and Maximum
  • Guess number higher or lower.
  • Stone Game.
  • Guess the word

Day:91-95 Advanced Data structure:

1. Tries
2. Disjoint sets
3. BT and B+T
4. Red black tree RBT
5. Segment Trees

Day:96-100 Computational complexity theory:

1. Np-complete and Np-hard computational complexity theory
2. knapsack problem
3. travelling salesman problem

NOTE:
    Target speed for easy to medium problem should be ideally 20-25 min.
    For harder problem it may 30 to 35 min.
    Read - 3-5min
    pseudocode - 5-7min
    time and space -2min
    code 10-15min
    handle all boundary cases while coding.

Youtybe content

Tech Dose Playlist Leet Code

Refrence

• Topic Refrence AppliedInterviewPrep

Used Emogies

Emogies

✅