Jump to level 2
okay i got a little scared off of applying to jobs and like totally talked myself down
but y’know i can’t avoid it forever & if i actually want a reasonable salary i shouldn’t just coast onto a random postdoc / research-y position
also plenty of other people don’t really have the luxury of chillaxing and wallowing in self-pity so y’know chin up or something, and i’m sure i’ll actually just feel much better actually doing something about something
anyway ok so i’m still mixed feelings about paying to study for technical interviews even if in theory it should be worth the money / a worthwhile investment vs. eating like 5 pizzas or something
just feels weird when there’s plenty of resources online, and i know that i have a low success rate of sticking with online things anyway
anyway, so if i use leetcode.com (arbitrarily) and go to problems, they have study plans, unfortunately these are a little gated, so i’ll instead copy them & go to them individually (since there is a full list, and a decent chunk of them are just listed in the freely accessible problems section)
This study plan is for those who want to prepare for technical interviews but are uncertain which problems they should focus on. The problems have been carefully curated so that levels 1 and 2 will guide beginner and intermediate users through problems that cover the data structures and algorithms necessary to succeed in interviews with most mid-tier companies. While level 3 provides material to help users whose targets are top-tier companies.
https://leetcode.com/study-plan/leetcode-75
Maybe a bit sketch, but since this doesn’t have the actual content of the questions…. So in order that’s
Level 1 – 15 days (15 days)
Problem ID | Topic |
---|---|
1480 | Prefix Sum |
724 | |
205 | String |
392 | |
21 | Linked List |
206 | |
876 | |
142 | |
121 | Greedy |
409 | |
589 | Tree |
102 | |
704 | Binary Search |
278 | |
98 | Binary Search Tree |
235 | |
733 | Graph/BFS/DFS |
200 | |
509 | Dynamic Programming |
70 | |
746 | |
62 | |
438 | Sliding Window / Two Pointer |
424 | |
1 | Hashmap |
299 | |
844 | Stack |
394 | |
1046 | Heap |
692 |
https://leetcode.com/problemset/all/
https://leetcode.com/problemset/all/?search=
Level 2 (25 days)
Problem ID | Topic | Date Start/Done |
---|---|---|
202 | Implementation/Simulation | done |
54 | read | |
1706 | skip | |
14 | String | done |
43 | skip, wat | |
19 | LinkedList | done |
234 | done 4.26 | |
328 | LinkedList | done 4.27 |
148 | done 4.28 (need redo) | |
2131 | Greedy | done 5.11 (need redo) |
621 | done 5.14 (need redo) | |
226 | Tree | |
110 | ||
543 | Tree | |
437 | ||
74 | BinarySearch | |
33 | ||
108 | BinarySearchTree | |
230 | ||
173 | ||
994 | Graph/BFS/DFS | |
417 | ||
210 | Graph/BFS/DFS | |
815 | ||
198 | DynamicProgramming | |
322 | ||
416 | DynamicProgramming | |
152 | ||
3 | SlidingWindow/TwoPointer | |
16 | ||
76 | ||
100 | Tree | |
101 | ||
199 | ||
232 | Design | |
155 | ||
208 | ||
57 | Interval | |
56 | ||
735 | Stack | |
227 | ||
547 | UnionFind | |
947 | ||
39 | BruteForce/Backtracking | |
46 |
ugh honestly i lost interest so fast, i can only retain interest in reversing strings for so long, i’d much rather be like … doing fun cool projects … T____T but if it’s for the $$$ well it’s not the worst thing to have to do for the $$$ i guess
update 21 April 2023:
Okay, their site design is a little obnoxious sadly (but they are giving me resources for free sooo beggars/choosers)
I was having issue typing in the class “pt-0.5” but fortunately Firefox has a “copy CSS selector” which showed me I can use backslashes to escape the “.” in the class name.
using the stylus extension for firefox (it’s a recommended plugin so I felt somewhat better about installing this plugin) we can select the classes and set them to “display:none” in order to hide them.
div.css-h5fkc8 {
display: none; /* list of study plans */
}
div.-mr-2 {
display: none; /* links to weekly contests */
}
div.mt-4.pt-0\.5:nth-child(3){ /* list of companies */
display: none;
}