Skip to content

harshitgindra/LeetCode.TopInterview

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

75 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Leetcode Top Interview 🎯

This repository contains solutions to the Leetcode Top Interview 150 problems.

These problems are commonly asked in technical interviews and cover a wide range of topics, including data structures, algorithms, and problem-solving techniques.

Leetcode Stats

Show some ❀️ by starring ⭐ this repository if you like it!

LeetCode Logo

GitHub stars GitHub forks GitHub watchers

linkedin

Buy Me A Coffee

Table of Contents πŸ“–

What is Leetcode? πŸ§‘β€πŸ’»

Leetcode is a popular online platform that provides a collection of coding challenges. Software engineers and interview candidates widely use it to practice coding skills and prepare for technical interviews. Leetcode offers many problems to solve, classified by difficulty level and topic.

About the Top Interview 150 Collection πŸ†

The Top Interview 150 collection on Leetcode is a curated set of 150 interview questions that top tech companies frequently ask. These questions are carefully selected to cover essential concepts and algorithms that interviewers expect candidates to be familiar with.

Id Problem Difficulty Status

Array / String
1 Merge Sorted Array Easy βœ…
2 Remove Element Easy βœ…
3 Remove Duplicates from Sorted Array Easy βœ…
4 Remove Duplicates from Sorted Array II Medium βœ…
5 Majority Element Easy βœ…
6 Rotate Array Medium βœ…
7 Best Time to Buy and Sell Stock Easy
8 Best Time to Buy and Sell Stock II Medium
9 Jump Game Medium
10 Jump Game II Medium
11 H-Index Medium
12 Insert Delete GetRandom O(1) Medium
13 Product of Array Except Self Medium
14 Gas Station Medium
15 Candy Hard
16 Trapping Rain Water Hard
17 Roman to Integer Easy βœ…
18 Integer to Roman Medium
19 Length of Last Word Easy βœ…
20 Longest Common Prefix Easy βœ…
21 Reverse Words in a String Medium
22 Zigzag Conversion Medium
23 Find the Index of the First Occurrence in a String Easy βœ…
24 Text Justification Hard

Two Pointers
25 Valid Palindrome Easy βœ…
26 Is Subsequence Easy βœ…
27 Two Sum II - Input Array Is Sorted Medium βœ…
28 Container With Most Water Medium βœ…
29 3Sum Medium βœ…

Sliding Window
30 Minimum Size Subarray Sum Medium
31 Longest Substring Without Repeating Characters Medium
32 Substring with Concatenation of All Words Hard
33 Minimum Window Substring Hard

Matrix
34 Valid Sudoku Medium
35 Spiral Matrix Medium
36 Rotate Image Medium
37 Set Matrix Zeroes Medium
38 Game of Life Medium

Hashmap
39 Ransom Note Easy βœ…
40 Isomorphic Strings Easy βœ…
41 Word Pattern Easy
42 Valid Anagram Easy βœ…
43 Group Anagrams Medium βœ…
44 Two Sum Easy βœ…
45 Happy Number Easy βœ…
46 Contains Duplicate II Easy βœ…
47 Longest Consecutive Sequence Medium βœ…

Intervals
48 Summary Ranges Easy βœ…
49 Merge Intervals Medium βœ…
50 Insert Interval Medium βœ…
51 Minimum Number of Arrows to Burst Balloons Medium βœ…

Stack
52 Valid Parentheses Easy
53 Simplify Path Medium
54 Min Stack Medium
55 Evaluate Reverse Polish Notation Medium
56 Basic Calculator Hard

Linked List
57 Linked List Cycle Easy βœ…
58 Add Two Numbers Medium βœ…
59 Merge Two Sorted Lists Easy βœ…
60 Copy List with Random Pointer Medium
61 Reverse Linked List II Medium
62 Reverse Nodes in k-Group Hard
63 Remove Nth Node From End of List Medium
64 Remove Duplicates from Sorted List II Medium
65 Rotate List Medium
66 Partition List Medium
67 LRU Cache Medium

Binary Tree General
68 Maximum Depth of Binary Tree Easy βœ…
69 Same Tree Easy βœ…
70 Invert Binary Tree Easy βœ…
71 Symmetric Tree Easy
72 Construct Binary Tree from Preorder and Inorder Traversal Medium
73 Construct Binary Tree from Inorder and Postorder Traversal Medium
74 Populating Next Right Pointers in Each Node II Medium
75 Flatten Binary Tree to Linked List Medium
76 Path Sum Easy βœ…
77 Sum Root to Leaf Numbers Medium βœ…
78 Binary Tree Maximum Path Sum Hard
79 Binary Search Tree Iterator Medium
80 Count Complete Tree Nodes Easy βœ…
81 Lowest Common Ancestor of a Binary Tree Medium

Binary Tree BFS
199 Binary Tree Right Side View Medium βœ…
83 Average of Levels in Binary Tree Easy βœ…
84 Binary Tree Level Order Traversal Medium βœ…
103 Binary Tree Zigzag Level Order Traversal Medium βœ…

Binary Search Tree
86 Minimum Absolute Difference in BST Easy βœ…
87 Kth Smallest Element in a BST Medium βœ…
98 Validate Binary Search Tree Medium βœ…

Graph General
200 Number of Islands Medium βœ…
130 Surrounded Regions Medium βœ…
91 Clone Graph Medium
92 Evaluate Division Medium
93 Course Schedule Medium
94 Course Schedule II Medium

Graph BFS
95 Snakes and Ladders Medium
96 Minimum Genetic Mutation Medium
97 Word Ladder Hard

Trie
98 Implement Trie (Prefix Tree) Medium
99 Design Add and Search Words Data Structure Medium
100 Word Search II Hard

Backtracking
101 Letter Combinations of a Phone Number Medium βœ…
102 Combinations Medium βœ…
103 Permutations Medium βœ…
104 Combination Sum Medium βœ…
105 N-Queens II Hard βœ…
106 Generate Parentheses Medium βœ…
107 Word Search Medium βœ…

Divide & Conquer
108 Convert Sorted Array to Binary Search Tree Easy βœ…
109 Sort List Medium βœ…
110 Construct Quad Tree Medium βœ…
111 Merge k Sorted Lists Hard βœ…

Kadane's Algorithm
112 Maximum Subarray Medium
113 Maximum Sum Circular Subarray Medium

Binary Search
114 Search Insert Position Easy βœ…
115 Search a 2D Matrix Medium βœ…
116 Find Peak Element Medium βœ…
117 Search in Rotated Sorted Array Medium βœ…
118 Find First and Last Position of Element in Sorted Array Medium βœ…
119 Find Minimum in Rotated Sorted Array Medium βœ…
120 Median of Two Sorted Arrays Hard

Heap
121 Kth Largest Element in an Array Medium βœ…
122 IPO Hard
123 Find K Pairs with Smallest Sums Medium
124 Find Median from Data Stream Hard

Bit Manipulation
125 Add Binary Easy βœ…
126 Reverse Bits Easy
127 Number of 1 Bits Easy
128 Single Number Easy βœ…
129 Single Number II Medium
130 Bitwise AND of Numbers Range Medium

Math
131 Palindrome Number Easy βœ…
132 Plus One Easy βœ…
133 Factorial Trailing Zeroes Medium
134 Sqrt(x) Easy
135 Pow(x, n) Medium
136 Max Points on a Line Hard

1D DP
137 Climbing Stairs Easy βœ…
138 House Robber Medium
139 Word Break Medium
140 Coin Change Medium
141 Longest Increasing Subsequence Medium

Multidimensional DP
142 Triangle Medium
143 Minimum Path Sum Medium
144 Unique Paths II Medium
145 Longest Palindromic Substring Medium
146 Interleaving String Medium
147 Edit Distance Medium
148 Best Time to Buy and Sell Stock III Hard
149 Best Time to Buy and Sell Stock IV Hard
150 Maximal Square Medium

Repository Structure πŸ—‚οΈ

This repository is organized by problem number, with each problem having its own directory.

Inside each problem directory, you will find the solution file(s) along with a README file that provides a problem description, constraints, and additional notes if necessary.

How to Use This Repository πŸš€

Navigate through the problem directories to explore solutions. Each directory contains the solution files, including explanations and sample input/output.

You can practice implementing your solutions and compare them with those provided.

Feel free to contribute by submitting your solutions or improvements. Open a pull request to share your contributions.

I recommend contributions for new languages, as currently, the solution is only available in C# πŸ›.

Resources πŸ“š

Happy coding and good luck with your interview preparation! πŸŽ‰