Interview Preparation for BIG 4:
I am writing this blog for tracking my preparation. This blog may also help those who are ambitious (just like me :D) for getting into the BIG 4. I will try to update daily few problems mainly from GeeksforGeeks and Hackerearth problem.
My current strategy is to analyze daily 3 DP problems (as I struggle mostly with it) and 3 other problems (in no such particular order).
The idea spawn when I read (source Quora and some other blog), that I have to keep on solving same problem many times and try to think of new strategy to solve it, to succeed.
I will also update what I felt after 1 month of this strategy.
So Lets Begin!
Preparation Strategy:
Day 1:
Learning:
Practice:
Day 2:
Learning:
Practice:
Day 3:
Learning:
Practice:
I am writing this blog for tracking my preparation. This blog may also help those who are ambitious (just like me :D) for getting into the BIG 4. I will try to update daily few problems mainly from GeeksforGeeks and Hackerearth problem.
My current strategy is to analyze daily 3 DP problems (as I struggle mostly with it) and 3 other problems (in no such particular order).
The idea spawn when I read (source Quora and some other blog), that I have to keep on solving same problem many times and try to think of new strategy to solve it, to succeed.
I will also update what I felt after 1 month of this strategy.
So Lets Begin!
Preparation Strategy:
- Read about particular type.
- Try to solve the problem
- Read solving strategy
- Try to implement in notebook (Not on computer).
- Solve online and then look into solution(Must even if you solve it)
Day 1:
Learning:
Practice:
- https://www.geeksforgeeks.org/backtracking-set-1-the-knights-tour-problem/
- https://www.geeksforgeeks.org/backttracking-set-2-rat-in-a-maze/
- https://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/
Day 2:
Learning:
- https://www.geeksforgeeks.org/dynamic-programming-set-1/
- https://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/
- https://www.geeksforgeeks.org/solve-dynamic-programming-problem/
Practice:
- https://www.geeksforgeeks.org/backtracking-set-7-suduku/
- https://www.geeksforgeeks.org/queue-using-stacks/ (very imp question, try to implement just using one stack on your own.)
- https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/
Day 3:
Learning:
Practice:
- https://www.geeksforgeeks.org/implement-stack-using-queue/
- https://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/
- https://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/
- https://www.geeksforgeeks.org/the-stock-span-problem/
- https://www.geeksforgeeks.org/the-celebrity-problem/
- https://www.geeksforgeeks.org/next-greater-element/
No comments:
Post a Comment