https://github.com/dhrupad17/leetcode-75_level1
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://github.com/dhrupad17/leetcode-75_level1
binary-search binary-search-tree dynamic-programming graph greedy hashmap heap linked-list prefix-sum sliding-window stack string tree
Last synced: 12 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/dhrupad17/leetcode-75_level1
- Owner: dhrupad17
- License: mit
- Created: 2022-06-20T12:00:17.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-07-04T04:36:56.000Z (over 3 years ago)
- Last Synced: 2025-01-16T07:56:20.691Z (about 1 year ago)
- Topics: binary-search, binary-search-tree, dynamic-programming, graph, greedy, hashmap, heap, linked-list, prefix-sum, sliding-window, stack, string, tree
- Homepage: https://leetcode.com/study-plan/leetcode-75/?progress=zm70yje
- Size: 85 KB
- Stars: 5
- Watchers: 1
- Forks: 4
- Open Issues: 0