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.

Home Page:https://leetcode.com/study-plan/leetcode-75/?progress=zm70yje

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

-----------------------------------------------------

Questions

DAYS LEETCODE PROBLEM NO NAME DIFFICULTY SOLUTIONS
DAY1 1480 Running Sum of 1d Array Easy πŸ‘‰Click Here
724 Find Pivot Index Easy πŸ‘‰Click Here
DAY2 205 Isomorphic Strings Easy πŸ‘‰Click Here
392 Is Subsequence Easy πŸ‘‰Click Here
DAY3 21 Merge Two Sorted Lists Easy πŸ‘‰Click Here
206 Reverse Linked List Easy πŸ‘‰Click Here
DAY4 876 Middle of the Linked List Easy πŸ‘‰Click Here
142 Linked List Cycle II Medium πŸ‘‰Click Here
DAY5 121 Best Time to Buy and Sell Stock Easy πŸ‘‰Click Here
409 Longest Palindrome Easy πŸ‘‰Click Here
DAY6 589 N-ary Tree Preorder Traversal Easy πŸ‘‰Click Here
102 Binary Tree Level Order Traversal Medium πŸ‘‰Click Here
DAY7 704 Binary Search Easy πŸ‘‰Click Here
278 First Bad Version Easy πŸ‘‰Click Here
DAY8 98 Validate Binary Search Tree Medium πŸ‘‰Click Here
235 Lowest Common Ancestor of a Binary Search Tree Easy πŸ‘‰Click Here
DAY9 733 Flood Fill Easy πŸ‘‰Click Here
200 Number of Islands Medium πŸ‘‰Click Here
DAY10 509 Fibonacci Number Easy πŸ‘‰Click Here
70 Climbing Stairs Easy πŸ‘‰Click Here
DAY11 746 Min Cost Climbing Stairs Easy πŸ‘‰Click Here
62 Unique Paths Medium πŸ‘‰Click Here
DAY12 438 Find All Anagrams in a String Medium πŸ‘‰Click Here
424 Longest Repeating Character Replacement Medium πŸ‘‰Click Here
DAY13 1 Two Sum Easy πŸ‘‰Click Here
299 Bulls and Cows Medium πŸ‘‰Click Here
DAY14 844 Backspace String Compare Easy πŸ‘‰Click Here
394 Decode String Medium πŸ‘‰Click Here
DAY15 1046 Last Stone Weight Easy πŸ‘‰Click Here
692 Top K Frequent Words Medium πŸ‘‰Click Here

πŸ›  Skills

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

πŸŽ–οΈ Badges

LeetCode Java GitHub

About

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

License:MIT License