Leetcode solutions for 🚀 NeetCode.io

This repo hosts the solutions found on NeetCode.io including the solutions shown on the NeetCode YouTube channel. The site will periodically be updated with new solutions from this repo!

Solutions from these languages will be linked from NeetCode.io:

Python (complete)
C++ (complete)
Java (complete)
Javascript

Solutions are also welcome for any other supported language on leetcode.com!

Contributing

Please read the contributing guidlines before opening a PR

To contribute, please fork this repo and open a PR adding a missing solution from the supported languages.

If you would like to have collaborator permissions on the repo to merge your own PRs or review others' PRs please let me know.

Credits

Missing Solutions

_Problem	_C	_C++	_C#	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{217 - Contains Duplicate}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{242 - Valid Anagram}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{1 - Two Sum}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{49 - Group Anagrams}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{347 - Top K Frequent Elements}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{238 - Product of Array Except Self}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{36 - Valid Sudoku}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{271 - Encode and Decode Strings}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌
_{128 - Longest Consecutive Sequence}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{125 - Valid Palindrome}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{167 - Two Sum II}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{15 - 3Sum}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{11 - Container with Most Water}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{42 - Trapping Rain Water}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{121 - Best Time to Buy & Sell Stock}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{3 - Longest Substring Without Repeating Characters}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{424 - Longest Repeating Character Replacement}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{567 - Permutation in String}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{76 - Minimum Window Substring}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{239 - Sliding Window Maximum}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{20 - Valid Parentheses}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{155 - Min Stack}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{150 - Evaluate Reverse Polish Notation}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{22 - Generate Parentheses}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{739 - Daily Temperatures}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{853 - Car Fleet}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{84 - Largest Rectangle in Histogram}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{704 - Binary Search}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{74 - Search a 2D Matrix}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{875 - Koko Eating Bananas}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{33 - Search Rotated Sorted Array}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️
_{153 - Find Minimum in Rotated Sorted Array}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️
_{981 - Time Based Key-Value Store}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{4 - Find Median of Two Sorted Arrays}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{206 - Reverse Linked List}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{21 - Merge Two Linked Lists}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{143 - Reorder List}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{19 - Remove Nth Node from End of List}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{138 - Copy List with Random Pointer}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{2 - Add Two Numbers}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️
_{141 - Linked List Cycle}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{287 - Find the Duplicate Number}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{146 - LRU Cache}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{23 - Merge K Sorted Lists}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{25 - Reverse Nodes in K-Group}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{226 - Invert Binary Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{104 - Maximum Depth of Binary Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{543 - Diameter of a Binary Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{110 - Balanced Binary Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{100 - Same Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{572 - Subtree of Another Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{235 - Lowest Common Ancestor of a BST}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{102 - Binary Tree Level Order Traversal}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{199 - Binary Tree Right Side View}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{1448 - Count Good Nodes in a Binary Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{98 - Validate Binary Search Tree}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{230 - Kth Smallest Element in a BST}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{105 - Construct Tree from Preorder and Inorder Traversal}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{124 - Binary Tree Max Path Sum}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{297 - Serialize and Deserialize Binary Tree}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{208 - Implement Trie}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{211 - Design Add and Search Word Data Structure}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{212 - Word Search II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{703 - Kth Largest Element in a Stream}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌
_{1046 - Last Stone Weight}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{973 - K Closest Points to Origin}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{215 - Kth Largest Element in an Array}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{621 - Task Scheduler}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{355 - Design Twitter}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{295 - Find Median from Data Stream}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{78 - Subsets}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{39 - Combination Sum}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{46 - Permutations}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{90 - Subsets II}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{40 - Combination Sum II}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{79 - Word Search}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{131 - Palindrome Partitioning}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{17 - Letter Combinations of a Phone Number}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{51 - N-Queens}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{200 - Number of Islands}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{133 - Clone Graph}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{695 - Max Area of Island}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{417 - Pacific Atlantic Waterflow}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{130 - Surrounded Regions}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{994 - Rotting Oranges}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{286 - Walls and Gates}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{207 - Course Schedule}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{210 - Course Schedule II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{684 - Redundant Connection}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{323 - Number of Connected Components in Graph}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌
_{261 - Graph Valid Tree}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{127 - Word Ladder}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{332 - Reconstruct Itinerary}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1584 - Min Cost to Connect all Points}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌
_{743 - Network Delay Time}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{778 - Swim in Rising Water}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{269 - Alien Dictionary}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{787 - Cheapest Flights Within K Stops}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{70 - Climbing Stairs}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{746 - Min Cost Climbing Stairs}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{198 - House Robber}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{213 - House Robber II}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{5 - Longest Palindromic Substring}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{647 - Palindromic Substrings}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{91 - Decode Ways}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{322 - Coin Change}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{152 - Maximum Product Subarray}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{139 - Word Break}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{300 - Longest Increasing Subsequence}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{416 - Partition Equal Subset Sum}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{62 - Unique Paths}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1143 - Longest Common Subsequence}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{309 - Best Time to Buy/Sell Stock With Cooldown}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{518 - Coin Change II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{494 - Target Sum}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{97 - Interleaving String}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{329 - Longest Increasing Path in a Matrix}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{115 - Distinct Subsequences}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{72 - Edit Distance}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌
_{312 - Burst Balloons}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{10 - Regular Expression Matching}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{53 - Maximum Subarray}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{55 - Jump Game}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{45 - Jump Game II}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{134 - Gas Station}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{846 - Hand of Straights}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1899 - Merge Triplets to Form Target Triplet}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{763 - Partition Labels}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{678 - Valid Parenthesis String}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{57 - Insert Interval}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{56 - Merge Intervals}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{435 - Non-Overlapping Intervals}	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{252 - Meeting Rooms}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{253 - Meeting Rooms II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{1851 - Minimum Interval to Include Each Query}	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{48 - Rotate Image}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{54 - Spiral Matrix}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{73 - Set Matrix Zeroes}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{202 - Happy Number}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{66 - Plus One}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{50 - Pow(x, n)}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{43 - Multiply Strings}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{2013 - Detect Squares}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{136 - Single Number}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{191 - Number of 1 Bits}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{338 - Counting Bits}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{190 - Reverse Bits}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{268 - Missing Number}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{371 - Sum of Two Integers}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{7 - Reverse Integer}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️

_{Need to update the README? Update the template instead.}

Name		Name	Last commit message	Last commit date
Latest commit History 3,660 Commits
.github		.github
c		c
cpp		cpp
csharp		csharp
go		go
java		java
javascript		javascript
kotlin		kotlin
python		python
ruby		ruby
rust		rust
scala		scala
swift		swift
typescript		typescript
.gitignore		.gitignore
.prettierrc		.prettierrc
.rufo		.rufo
CONTRIBUTING.md		CONTRIBUTING.md
LICENSE		LICENSE
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode solutions for 🚀 NeetCode.io

Contributing

Credits

Missing Solutions

About

Releases

Packages

Languages

License

chiranjeevjain/leetcode

Folders and files

Latest commit

History

Repository files navigation

Leetcode solutions for 🚀 NeetCode.io

Contributing

Credits

Missing Solutions

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages