Repository files navigation

• Introduction to Pandas

• 30 Days of Pandas
• 30 Days of JavaScript

• Top Interview 150
• LeetCode 75
• Top 100 Liked
• SQL 50
• Premium Algo 100
• Advanced SQL 50

• Amazon Spring '23 High Frequency
• Google Spring '23 High Frequency
• TikTok Spring '23 High Frequency
• Apple Spring '23 High Frequency

• Programming Skills
• Dynamic Programming
• Dynamic Programming Grandmaster
• Graph Theory
• Binary Search

• 1 Two Sum
• 2 Add Two Numbers
• 3 Longest Substring Without Repeating Characters
• 4 Median of Two Sorted Arrays
• 5 Longest Palindromic Substring
• 6 Zigzag Conversion
• 9 Palindrome Number
• 11 Container With Most Water
• 12 Integer to Roman
• 13 Roman to Integer
• 14 Longest Common Prefix
• 15 3Sum
• 17 Letter Combinations of a Phone Number
• 19 Remove Nth Node From End of List
• 20 Valid Parentheses
• 21 Merge Two Sorted Lists
• 22 Generate Parentheses
• 23 Merge K Sorted Lists
• 25 Reverse Nodes in k-Group
• 26 Remove Duplicates from Sorted Array
• 27 Remove Element
• 28 Find the Index of the First Occurrence in a String
• 30 Substring with Concatenation of All Words
• 33 Search in Rotated Sorted Array
• 34 Find First and Last Position of Element in Sorted Array
• 35 Search Insert Position
• 36 Valid Sudoku
• 37 Sudoku Solver
• 39 Combination Sum
• 42 Trapping Rain Water
• 45 Jump Game II
• 46 Permutations
• 48 Rotate Image
• 49 Group Anagrams
• 50 Pow(x_n)
• 51 N-Queens
• 52 N-Queens II
• 53 Maximum Subarray
• 54 Spiral Matrix
• 55 Jump Game
• 58 Length of Last Word
• 56 Merge Intervals
• 57 Insert Interval
• 61 Rotate List
• 63 Unique Paths II
• 64 Minimum Path Sum
• 66 Plus One
• 67 Add Binary
• 68 Text Justification
• 69 Sqrt(x)
• 70 Climbing Stairs
• 71 Simplify Path
• 72 Edit Distance
• 73 Set Matrix Zeroes
• 74 Search a 2D Matrix
• 75 Sort Colors
• 76 Minimum Window Substring
• 77 Combinations
• 79 Word Search
• 80 Remove Duplicates from Sorted Array II
• 82 Remove Duplicates from Sorted List II
• 86 Partition List
• 88 Merge Sorted Array
• 91 Decode Ways
• 92 Reverse Linked List II
• 95 Unique Binary Search Trees II
• 96 Unique Binary Search Trees
• 97 Interleaving String
• 98 Validate Binary Search Tree
• 100 Same Tree
• 101 Symmetric Tree
• 102 Binary Tree Level Order Traversal
• 103 Binary Tree Zigzag Level Order Traversal
• 104 Maximum Depth of Binary Tree
• 105 Construct Binary Tree from Preorder and Inorder Traversal
• 106 Construct Binary Tree from Inorder and Postorder Traversal
• 108 Convert Sorted Array to Binary Search Tree
• 112 Path Sum
• 114 Flatten Binary Tree to Linked List
• 115 Distinct Subsequences
• 117 Populating Next Right Pointers in Each Node II
• 118 Pascals Triangle
• 120 Triangle
• 121 Best Time to Buy and Sell Stock
• 122 Best Time to Buy and Sell Stock II
• 123 Best Time to Buy and Sell Stock III
• 124 Binary Tree Maximum Path Sum
• 125 Valid Palindrome
• 127 Word Ladder
• 128 Longest Consecutive Sequence
• 129 Sum Root to Leaf Numbers
• 130 Surrounded Regions
• 133 Clone Graph
• 134 Gas Station
• 135 Candy
• 136 Single Number
• 137 Single Number II
• 138 Copy List with Random Pointer
• 139 Word Break
• 141 Linked List Cycle
• 146 LRU Cache
• 148 Sort List
• 149 Max Points on a Line
• 150 Evaluate Reverse Polish Notation
• 151 Reverse Words in a String
• 153 Find Minimum in Rotated Sorted Array
• 155 Min Stack
• 162 Find Peak Element
• 167 Two Sum II - Input Array Is Sorted
• 169 Majority Element
• 172 Factorial Trailing Zeroes
• 173 Binary Search Tree Iterator
• 188 Best Time to Buy and Sell Stock IV
• 189 Rotate Array
• 190 Reverse Bits
• 191 Number of 1 Bits
• 198 House Robber
• 199 Binary Tree Right Side View
• 200 Number of Islands
• 201 Bitwise AND of Numbers Range
• 202 Happy Number
• 205 Isomorphic Strings
• 207 Course Schedule
• 208 Implement Trie (Prefix Tree)
• 209 Minimum Size Subarray Sum
• 210 Course Schedule
• 211 Design Add and Search Words Data Structure
• 212 Word Search II
• 215 Kth Largest Element in an Array
• 219 Contains Duplicates II
• 221 Maximal Square
• 222 Count Complete Tree Nodes
• 224 Basic Calculator
• 226 Invert Binary Tree
• 227 Basic Calculator II
• 228 Summary Ranges
• 230 Kth Smallest Element in a BST
• 236 Lowest Common Ancestor of a Binary Tree
• 238 Product of Array Except Self
• 242 Valid Anagram
• 274 H-Index
• 279 Perfect Squares
• 289 Game of Life
• 290 Word Pattern
• 295 Find Median from Data Stream
• 300 Longest Increasing Subsequence
• 309 Best Time to Buy and Sell Stock with Cooldown
• 322 Coin Change
• 337 House Robber III
• 354 Russian Doll Envelopes
• 373 Find K Pairs with Smallest Sums
• 377 Combination Sum IV
• 380 Insert Delete GetRandom O(1)
• 383 Ransom Note
• 392 Is Subsequence
• 399 Evaluate Division
• 427 Construct Quad Tree
• 433 Minimum Genetic Mutation
• 452 Minimum Number of Arrows to Burst Balloons
• 474 Ones and Zeroes
• 502 IPO
• 509 Fibonacci Number
• 516 Longest Palindromic Subsequence
• 518 Coin Change II
• 530 Minimum Absolute Difference in BST
• 637 Average of Levels in Binary Tree
• 646 Maximum Length of Pair Chain
• 673 Number of Longest Increasing Subsequence
• 712 Minimum ASCII Delete Sum for Two Strings
• 714 Best Time to Buy and Sell Stock with Transaction Fee
• 724 Find Pivot Index
• 740 Delete and Earn
• 746 Min Cost Climbing Stairs
• 790 Domino and Tromino Tiling
• 909 Snakes and Ladders
• 918 Maximum Sum Circular Subarray
• 931 Minimum Falling Path Sum
• 983 Minimum Cost for Tickets
• 1027 Longest Arithmetic Subsequence
• 1035 Uncrossed Lines
• 1137 N-th Tribonacci Number
• 1143 Longest Common Subsequence
• 1218 Longest Arithmetic Subsequence of Given Difference
• 1312 Minimum Insertion Steps to Make a String Palindrome
• 1534 Count Good Triplets
• 1732 Find the Highest Altitude
• 1991 Find the Middle Index in Array
• 1922 Count Good Numbers
• 1964 Find the Longest Valid Obstacle Course at Each Position
• 2140 Solving Questions With Brainpower
• 2466 Count Ways To Build Good Strings
• 2799 Count Complete Subarrays in an Array
• 3392 Count Subarrays of Length Three With a Condition

Contributions are welcome!

Please fork the repository and submit a pull request.

Make sure to follow the coding standards and write tests for any new leetcode problem or bug fix.