I cracked Microsoft in my first attempt! ๐โ๏ธ
Here are the DSA problems I repeatedly practised before the interview:
๐. ๐๐ฐ๐จ ๐๐ฎ๐ฆ: Hashing, Arrays
๐. ๐๐๐ซ๐ ๐ ๐๐ง๐ญ๐๐ซ๐ฏ๐๐ฅ๐ฌ: Sorting, Greedy
๐. ๐ ๐ข๐ง๐ ๐ ๐ข๐ซ๐ฌ๐ญ ๐๐ง๐ ๐๐๐ฌ๐ญ ๐๐จ๐ฌ๐ข๐ญ๐ข๐จ๐ง ๐จ๐ ๐๐ฅ๐๐ฆ๐๐ง๐ญ: Binary Search
๐. ๐๐๐ญ๐๐๐ญ ๐๐ฒ๐๐ฅ๐ ๐ข๐ง ๐ ๐๐ข๐ง๐ค๐๐ ๐๐ข๐ฌ๐ญ: Linked List, Floydโs Cycle Detection
๐. ๐๐๐ ๐๐๐๐ก๐: HashMap + Doubly Linked List (Design, O(1) Operations)
๐. ๐๐ฎ๐๐ฌ๐๐ญ๐ฌ: Recursion, Backtracking
๐. ๐๐ญ๐ก ๐๐๐ซ๐ ๐๐ฌ๐ญ ๐๐ฅ๐๐ฆ๐๐ง๐ญ ๐ข๐ง ๐๐งรฅ ๐๐ซ๐ซ๐๐ฒ: Heap (Priority Queue)
๐. ๐๐จ๐ง๐ ๐๐ฌ๐ญ ๐๐๐ฅ๐ข๐ง๐๐ซ๐จ๐ฆ๐ข๐ ๐๐ฎ๐๐ฌ๐ญ๐ซ๐ข๐ง๐ : Dynamic Programming (DP), Strings
๐. ๐๐จ๐ซ๐ ๐๐ซ๐๐๐ค: Dynamic Programming, Trie (Optional)
๐๐. ๐๐ข๐ฃ๐ค๐ฌ๐ญ๐ซ๐โ๐ฌ ๐๐ฅ๐ ๐จ๐ซ๐ข๐ญ๐ก๐ฆ: Graphs, Shortest Path, Priority Queue
My strategy โย Less โhow many questions did you solve?โ
And more โhow deeply do you understand what you solved?โ
Because MAANG doesnโt care about the numbers, it cares about the impact. It took me months to understand thisโฆwhat else could I have done?
We didnโt have any guidance but today, top SDEs like Ajay Yadava (an ex-Google engineer) are providing LIVE guidance.
FREE call with him here โ https://lnkd.in/g3iiq7et
He doesnโt focus on โsolve 100 problemsโ but more on:
โ๏ธ How to approach unseen problems (be it DSA or System Design)
โ๏ธ Building a solid preparation roadmap, resume, job strategy.
Thatโs why his cohort have a 100% placement rate! There are only 20 seats though.
#SDE #SoftwareEngineering #LeetCode #TechCareers #InterviewPrep
Here are the DSA problems I repeatedly practised before the interview:
๐. ๐๐ฐ๐จ ๐๐ฎ๐ฆ: Hashing, Arrays
๐. ๐๐๐ซ๐ ๐ ๐๐ง๐ญ๐๐ซ๐ฏ๐๐ฅ๐ฌ: Sorting, Greedy
๐. ๐ ๐ข๐ง๐ ๐ ๐ข๐ซ๐ฌ๐ญ ๐๐ง๐ ๐๐๐ฌ๐ญ ๐๐จ๐ฌ๐ข๐ญ๐ข๐จ๐ง ๐จ๐ ๐๐ฅ๐๐ฆ๐๐ง๐ญ: Binary Search
๐. ๐๐๐ญ๐๐๐ญ ๐๐ฒ๐๐ฅ๐ ๐ข๐ง ๐ ๐๐ข๐ง๐ค๐๐ ๐๐ข๐ฌ๐ญ: Linked List, Floydโs Cycle Detection
๐. ๐๐๐ ๐๐๐๐ก๐: HashMap + Doubly Linked List (Design, O(1) Operations)
๐. ๐๐ฎ๐๐ฌ๐๐ญ๐ฌ: Recursion, Backtracking
๐. ๐๐ญ๐ก ๐๐๐ซ๐ ๐๐ฌ๐ญ ๐๐ฅ๐๐ฆ๐๐ง๐ญ ๐ข๐ง ๐๐งรฅ ๐๐ซ๐ซ๐๐ฒ: Heap (Priority Queue)
๐. ๐๐จ๐ง๐ ๐๐ฌ๐ญ ๐๐๐ฅ๐ข๐ง๐๐ซ๐จ๐ฆ๐ข๐ ๐๐ฎ๐๐ฌ๐ญ๐ซ๐ข๐ง๐ : Dynamic Programming (DP), Strings
๐. ๐๐จ๐ซ๐ ๐๐ซ๐๐๐ค: Dynamic Programming, Trie (Optional)
๐๐. ๐๐ข๐ฃ๐ค๐ฌ๐ญ๐ซ๐โ๐ฌ ๐๐ฅ๐ ๐จ๐ซ๐ข๐ญ๐ก๐ฆ: Graphs, Shortest Path, Priority Queue
My strategy โย Less โhow many questions did you solve?โ
And more โhow deeply do you understand what you solved?โ
Because MAANG doesnโt care about the numbers, it cares about the impact. It took me months to understand thisโฆwhat else could I have done?
We didnโt have any guidance but today, top SDEs like Ajay Yadava (an ex-Google engineer) are providing LIVE guidance.
FREE call with him here โ https://lnkd.in/g3iiq7et
He doesnโt focus on โsolve 100 problemsโ but more on:
โ๏ธ How to approach unseen problems (be it DSA or System Design)
โ๏ธ Building a solid preparation roadmap, resume, job strategy.
Thatโs why his cohort have a 100% placement rate! There are only 20 seats though.
#SDE #SoftwareEngineering #LeetCode #TechCareers #InterviewPrep