https://github.com/tasmidur/problem-solving-topic
https://github.com/tasmidur/problem-solving-topic
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/tasmidur/problem-solving-topic
- Owner: tasmidur
- Created: 2022-04-10T06:55:04.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2022-04-10T07:18:56.000Z (about 3 years ago)
- Last Synced: 2025-01-26T11:29:36.996Z (4 months ago)
- Size: 1.95 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# problem-solving-topic
LeetCode has over 2000 questions,
If you just practice randomly you won't feel confident or maybe you don't cover all important concepts.
This is why using lists/selected questions is the best way to prepare for coding interviews!
These are some of my top list recommendations 🙂
1. takeUforward SDE sheet (https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/), it is a concise list of 200+ problems.
2. LeetCode top-interview-cards, the contain problems sorted by topics and difficulty.'
3. Leetcode patterns by Sean Prashad, he covers problems not by topics but by patterns, an interesting way to go about practicing!
4. Blind 75 (https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions), small list of important leetcode problems for end moment preparation!
5. https://neetcode.io/
6. https://workat.tech/problem-solving/practice/lists
7. ...........................................................................
## Instead of learning solutions of LeetCode questions, understand patterns! 🙂
For ex.
If input array is sorted then
- Binary search
- Two pointers
If asked for all permutations/subsets then
- Backtracking
If given a tree then
- DFS
- BFS
If given a graph then
- DFS
- BFS
If given a linked list then
- Two pointers
If recursion is banned then
- Stack
If must solve in-place then
- Swap corresponding values
- Store one or more different values in the same pointer
If asked for maximum/minimum subarray/subset/options then
- Dynamic programming
If asked for top/least K items then
- Heap
If asked for common strings then
- Map
- Trie
Else
- Map/Set for O(1) time & O(n) space
- Sort input for O(nlogn) time and O(1) space
Follow Prakhar Rai 🇮🇳 for more 🚀
Checkout a github repo by Sean Prasad if you're interested to read more about this, its absolutely amazing!