This repository includes all the solved interview preparation questions for Amazon SDE role. I'll be solving 2-3 problems daily. So stay 👀
Amazon SDE Test Series consists of practice questions for the following topics:
- Arrays
- Searching
- Sorting
- Matrix
- Hashing
- String
- Linked List
- Stack
- Queue
- Trees
- Binary Search 🌲
- Heap
- Graph
- Backtracking
- Dynamic Programming
To visualize data structures use VisuAlgo
| N | Complexity | Possible Algorithms & Techniques |
|---|---|---|
| 1018 | O(log N) | Binary & Ternary Search / Matrix Power / Cycle Tricks / Big Simulation Steps / Values ReRank |
| 100,000,000 | O(N) | A Linear Solution - May be a greedy/adhock algorithm |
| 40,000,000 | O(N log N) | linear # calls to Binary & Ternary Search / Pre-processing & Querying / D & C |
| 10,000 | O(N2) | adhock / DP / Greedy / D & C / B & B |
| 500 | O(N3) | adhock / DP / Greedy / .. |
| 90 | O(N4) | adhock / DP / Greedy / ... |
| 30-50 | O(N5) | Search with pruning - branch and bound |
| 40 | O(2N/2) | Meet in Middle |
| 20 | O(2N) | Backtracking / Generating 2N Subsets |
| 11 | O(N!) | Factorial / Permutations / Combination Algorithm |
** The above table is an excerpt from the ACM ICPC World Finalist 2011. The original blog post can be found here
P.S: Practicing all these problems doesn't guarantee you a job at Amazon. It all depends on your thought-process, luck and hard-work. Take these problems as a reference to build your problem solving skills.
