Data Structures
,Algorithms
,Prefix Sum
,String
,Linked List
,Greedy
,Tree
,Binary Search
,Binary Search Tree
,Graph/BFS/DFS
,Dynamic Programming
,Sliding Window/Two Pointer
,Hashmap
,Stack
,Heap
,java
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/?progress=zm70yje
Data Structures
,Algorithms
,Prefix Sum
,String
,Linked List
,Greedy
,Tree
,Binary Search
,Binary Search Tree
,Graph/BFS/DFS
,Dynamic Programming
,Sliding Window/Two Pointer
,Hashmap
,Stack
,Heap
,java
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/?progress=zm70yje
MIT License