coding-interview-university
A complete computer science study plan to become a software engineer.
- 365k
- CC-BY-SA-4.0
- 13 d ago
Java-based LeetCode algorithm problem solutions, regularly updated.
Repo javadev/LeetCode-in-Java, read from GitHub 1 min ago. javadev has not joined Take My Repo.
javadev/LeetCode-in-Java is a public repo on GitHub by javadev. Java-based LeetCode algorithm problem solutions, regularly updated. It declares the MIT license on GitHub. It is written mainly in Java, has 219 stars and last changed on 2026-11-19. Nobody has reviewed it on Take My Repo yet, which says nothing about its quality. Read from GitHub on 2026-11-21.
In the maintainer's words. Shown from GitHub; Take My Repo does not keep a copy.
Java-based LeetCode algorithm problem solutions, regularly updated.
To configure your Maven project, add the following code to your pom.xml file:
<dependencies> <dependency> <groupId>com.github.javadev</groupId> <artifactId>leetcode-in-java</artifactId> <version>1.50</version> </dependency> ... </dependencies>
Gradle configuration:
implementation 'com.github.javadev:leetcode-in-java:1.50'| 0896 | Monotonic Array | Easy | Array | 2 | 86.21 |
| 0028 | Find the Index of the First Occurrence in a String | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 0 | 100.00 |
| 0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 98.82 |
| 0459 | Repeated Substring Pattern | Easy | String, String_Matching | 8 | 96.64 |
| 0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack | 6 | 76.50 |
| 0066 | Plus One | Easy | Top_Interview_Questions, Array, Math | 0 | 100.00 |
| 1367 | Linked List in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 2 | 61.23 |
| 0043 | Multiply Strings | Medium | String, Math, Simulation | 1 | 100.00 |
| 0067 | Add Binary | Easy | String, Math, Bit_Manipulation, Simulation | 1 | 99.82 |
| 0989 | Add to Array-Form of Integer | Easy | Array, Math | 7 | 65.92 |
| 0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 |
| 0058 | Length of Last Word | Easy | String | 0 | 100.00 |
| 0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Easy | Array, Matrix | 1 | 78.38 |
| 0054 | Spiral Matrix | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 |
| 0973 | K Closest Points to Origin | Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect | 4 | 98.26 |
| 1630 | Arithmetic Subarrays | Medium | Array, Sorting | 8 | 93.62 |
| 0429 | N-ary Tree Level Order Traversal | Medium | Breadth_First_Search, Tree | 3 | 80.26 |
| 0503 | Next Greater Element II | Medium | Array, Stack, Monotonic_Stack | 7 | 97.03 |
| 0556 | Next Greater Element III | Medium | String, Math, Two_Pointers | 0 | 100.00 |
| 1376 | Time Needed to Inform All Employees | Medium | Depth_First_Search, Breadth_First_Search, Tree | 8 | 99.85 |
| 0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 6 | 97.61 |
| 0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 |
| 0713 | Subarray Product Less Than K | Medium | Array, Sliding_Window | 8 | 39.00 |
| 0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum | 153 | 87.51 |
| 0910 | Smallest Range II | Medium | Array, Math, Sorting, Greedy | 10 | 73.16 |
| 0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion | 2 | 72.59 |
| 0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 |
| 0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 100.00 |
| 0445 | Add Two Numbers II | Medium | Math, Stack, Linked_List | 3 | 90.38 |
| 0061 | Rotate List | Medium | Two_Pointers, Linked_List | 0 | 100.00 |
| 0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 15 | 100.00 |
| 1845 | Seat Reservation Manager | Medium | Design, Heap_Priority_Queue | 47 | 87.63 |
| 0860 | Lemonade Change | Easy | Array, Greedy | 2 | 90.84 |
| 0155 | Min Stack | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 |
| 0341 | Flatten Nested List Iterator | Medium | Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 2 | 99.95 |
| 1797 | Design Authentication Manager | Medium | Hash_Table, Design | 41 | 92.67 |
| 0707 | Design Linked List | Medium | Design, Linked_List | 10 | 70.60 |
| 0380 | Insert Delete GetRandom O(1) | Medium | Array, Hash_Table, Math, Design, Randomized | 27 | 93.44 |
| 0622 | Design Circular Queue | Medium | Array, Design, Linked_List, Queue | 3 | 100.00 |
| 0729 | My Calendar I | Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 17 | 97.23 |
| 0733 | Flood Fill | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36 |
| 0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 3 | 87.24 |
| 0695 | Max Area of Island | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 76.79 |
| 1254 | Number of Closed Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 55.59 |
| 1020 | Number of Enclaves | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 6 | 68.24 |
| 1905 | Count Sub Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 24 | 85.54 |
| 1162 | As Far from Land as Possible | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 16 | 62.40 |
| 0417 | Pacific Atlantic Water Flow | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62 |
| 1091 | Shortest Path in Binary Matrix | Medium | Array, Breadth_First_Search, Matrix | 22 | 69.99 |
| 0542 | 01 Matrix | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83 |
| 0934 | Shortest Bridge | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 6 | 97.87 |
| 1926 | Nearest Exit from Entrance in Maze | Medium | Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 12 | 40.55 |
| 0797 | All Paths From Source to Target | Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 2 | 90.53 |
| 0841 | Keys and Rooms | Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 3 | 51.54 |
| 0547 | Number of Provinces | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 2 | 69.51 |
| 1319 | Number of Operations to Make Network Connected | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 4 | 88.52 |
| 1376 | Time Needed to Inform All Employees | Medium | Depth_First_Search, Breadth_First_Search, Tree | 8 | 99.85 |
| 0802 | Find Eventual Safe States | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 7 | 74.93 |
| 1129 | Shortest Path with Alternating Colors | Medium | Breadth_First_Search, Graph | 4 | 96.63 |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 39 | 97.71 |
| 0847 | Shortest Path Visiting All Nodes | Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 14 | 78.72 |
| 1306 | Jump Game III | Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23 |
| 1654 | Minimum Jumps to Reach Home | Medium | Array, Dynamic_Programming, Breadth_First_Search | 6 | 99.87 |
| 0365 | Water and Jug Problem | Medium | Math, Depth_First_Search, Breadth_First_Search | 0 | 100.00 |
| 0433 | Minimum Genetic Mutation | Medium | String, Hash_Table, Breadth_First_Search | 0 | 100.00 |
| 0752 | Open the Lock | Medium | Array, String, Hash_Table, Breadth_First_Search | 72 | 91.06 |
| 0127 | Word Ladder | Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 22 | 96.00 |
| 0997 | Find the Town Judge | Easy | Array, Hash_Table, Graph | 3 | 80.64 |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | Graph | 8 | 99.94 |
| 1615 | Maximal Network Rank | Medium | Graph | 3 | 97.34 |
| 0886 | Possible Bipartition | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 20 | 80.12 |
| 0785 | Is Graph Bipartite? | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 0 | 100.00 |
| 0595 | Big Countries | Easy | Database | 262 | 84.64 |
| 1757 | Recyclable and Low Fat Products | Easy | Database | 475 | 71.54 |
| 0584 | Find Customer Referee | Easy | Database | 531 | 58.63 |
| 0183 | Customers Who Never Order | Easy | Database | 376 | 98.73 |
| 1873 | Calculate Special Bonus | Easy | Database | 543 | 71.60 |
| 0627 | Swap Salary | Easy | Database | 191 | 96.89 |
| 0196 | Delete Duplicate Emails | Easy | Database | 903 | 48.10 |
| 1667 | Fix Names in a Table | Easy | Database | 559 | 80.29 |
| 1484 | Group Sold Products By The Date | Easy | LeetCode_Curated_SQL_70, Database | 395 | 77.20 |
| 1527 | Patients With a Condition | Easy | Database | 308 | 66.93 |
| 1965 | Employees With Missing Information | Easy | Database | 617 | 30.40 |
| 1795 | Rearrange Products Table | Easy | Database | 497 | 64.83 |
| 0608 | Tree Node | Medium | LeetCode_Curated_SQL_70, Database | 347 | 95.17 |
| 0176 | Second Highest Salary | Medium | Database | 225 | 73.10 |
| 0175 | Combine Two Tables | Easy | Database | 491 | 32.30 |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | Database | 1039 | 76.99 |
| 1148 | Article Views I | Easy | LeetCode_Curated_SQL_70, Database | 783 | 64.09 |
| 0197 | Rising Temperature | Easy | Database | 342 | 93.76 |
| 0607 | Sales Person | Easy | LeetCode_Curated_SQL_70, Database | 1046 | 86.04 |
| 1141 | User Activity for the Past 30 Days I | Easy | LeetCode_Curated_SQL_70, Database | 849 | 72.54 |
| 1693 | Daily Leads and Partners | Easy | Database | 463 | 78.98 |
| 1729 | Find Followers Count | Easy | Database | 456 | 88.39 |
| 0586 | Customer Placing the Largest Number of Orders | Easy | LeetCode_Curated_SQL_70, Database | 484 | 66.42 |
| 0511 | Game Play Analysis I | Easy | LeetCode_Curated_SQL_70, Database | 586 | 56.94 |
| 1890 | The Latest Login in 2020 | Easy | Database | 571 | 73.59 |
| 1741 | Find Total Time Spent by Each Employee | Easy | Database | 414 | 93.27 |
| 1393 | Capital Gain/Loss | Medium | LeetCode_Curated_SQL_70, Database | 428 | 92.01 |
| 1407 | Top Travellers | Easy | LeetCode_Curated_SQL_70, Database | 682 | 70.16 |
| 1158 | Market Analysis I | Medium | Database | 2511 | 78.92 |
| 0182 | Duplicate Emails | Easy | Database | 303 | 92.08 |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | Easy | LeetCode_Curated_SQL_70, Database | 344 | 76.48 |
| 1587 | Bank Account Summary II | Easy | Database | 630 | 60.32 |
| 1084 | Sales Analysis III | Easy | LeetCode_Curated_SQL_70, Database | 1066 | 69.71 |
| 1480 | Running Sum of 1d Array | Easy | Array, Prefix_Sum | 0 | 100.00 |
| 0724 | Find Pivot Index | Easy | Array, Prefix_Sum, LeetCode_75_Prefix_Sum | 2 | 69.67 |
| 0205 | Isomorphic Strings | Easy | String, Hash_Table | 2 | 99.18 |
| 0392 | Is Subsequence | Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 |
| 0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 |
| 0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 |
| 0876 | Middle of the Linked List | Easy | Two_Pointers, Linked_List | 0 | 100.00 |
| 0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 |
| 0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 99.78 |
| 0409 | Longest Palindrome | Easy | String, Hash_Table, Greedy | 2 | 92.90 |
| 0589 | N-ary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Stack | 1 | 90.98 |
| 0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 |
| 0704 | Binary Search | Easy | Array, Binary_Search | 0 | 100.00 |
| 0278 | First Bad Version | Easy | Binary_Search, Interactive | 15 | 87.89 |
| 0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 4 | 100.00 |
| 0733 | Flood Fill | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36 |
| 0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 3 | 87.24 |
| 0509 | Fibonacci Number | Easy | Dynamic_Programming, Math, Recursion, Memoization | 0 | 100.00 |
| 0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0746 | Min Cost Climbing Stairs | Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D | 1 | 86.38 |
| 0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m*n)_Space_O(m*n) | 0 | 100.00 |
| 0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 |
| 0424 | Longest Repeating Character Replacement | Medium | String, Hash_Table, Sliding_Window | 5 | 95.15 |
| 0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 2 | 98.90 |
| 0299 | Bulls and Cows | Medium | String, Hash_Table, Counting | 6 | 86.69 |
| 0844 | Backspace String Compare | Easy | String, Two_Pointers, Stack, Simulation | 0 | 100.00 |
| 0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 1046 | Last Stone Weight | Easy | Array, Heap_Priority_Queue | 2 | 73.81 |
| 0692 | Top K Frequent Words | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Trie, Bucket_Sort | 11 | 38.54 |
| 0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00 |
| 0054 | Spiral Matrix | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 |
| 1706 | Where Will the Ball Fall | Medium | Array, Dynamic_Programming, Depth_First_Search, Matrix, Simulation | 2 | 64.55 |
| 0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String, Big_O_Time_O(n*m)_Space_O(m) | 0 | 100.00 |
| 0043 | Multiply Strings | Medium | String, Math, Simulation | 1 | 100.00 |
| 0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 |
| 0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 |
| 0328 | Odd Even Linked List | Medium | Linked_List, LeetCode_75_LinkedList | 0 | 100.00 |
| 0148 | Sort List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | Array, String, Hash_Table, Greedy, Counting | 73 | 76.60 |
| 0621 | Task Scheduler | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 3 | 84.32 |
| 0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 98.82 |
| 0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0437 | Path Sum III | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 |
| 0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 |
| 0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 |
| 0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00 |
| 0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 15 | 100.00 |
| 0994 | Rotting Oranges | Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 3 | 74.27 |
| 0417 | Pacific Atlantic Water Flow | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62 |
| 0210 | Course Schedule II | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 4 | 91.07 |
| 0815 | Bus Routes | Hard | Array, Hash_Table, Breadth_First_Search | 49 | 89.11 |
| 0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0322 | Coin Change | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount) | 12 | 92.59 |
| 0416 | Partition Equal Subset Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(n*sums)_Space_O(n*sums) | 5 | 99.88 |
| 0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 92.74 |
| 0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 |
| 0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers | 4 | 98.21 |
| 0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 |
| 0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 |
| 0199 | Binary Tree Right Side View | Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00 |
| 0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue | 1 | 67.21 |
| 0155 | Min Stack | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 |
| 0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 |
| 0057 | Insert Interval | Medium | Array | 0 | 100.00 |
| 0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 |
| 0735 | Asteroid Collision | Medium | Array, Stack, LeetCode_75_Stack | 2 | 99.59 |
| 0227 | Basic Calculator II | Medium | String, Math, Stack | 8 | 95.32 |
| 0547 | Number of Provinces | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 2 | 69.51 |
| 0947 | Most Stones Removed with Same Row or Column | Medium | Depth_First_Search, Graph, Union_Find | 7 | 98.83 |
| 0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 |
| 0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 1 | 94.08 |
| 0412 | Fizz Buzz | Easy | String, Math, Simulation | 1 | 100.00 |
| 0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 |
| 0007 | Reverse Integer | Medium | Top_Interview_Questions, Math, Big_O_Time_O(log10(x))_Space_O(1) | 0 | 100.00 |
| 0009 | Palindrome Number | Easy | Math, Big_O_Time_O(log10(x))_Space_O(1) | 4 | 100.00 |
| 0172 | Factorial Trailing Zeroes | Medium | Top_Interview_Questions, Math | 0 | 100.00 |
| 0050 | Pow(x, n) | Medium | Top_Interview_Questions, Math, Recursion | 0 | 100.00 |
| 0344 | Reverse String | Easy | String, Two_Pointers, Recursion | 1 | 99.91 |
| 0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String, Big_O_Time_O(n*m)_Space_O(m) | 0 | 100.00 |
| 0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 29 | 77.11 |
| 0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 |
| 0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 2 | 97.19 |
| 0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 7 | 97.82 |
| 0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0242 | Valid Anagram | Easy | String, Hash_Table, Sorting | 2 | 97.76 |
| 0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 6 | 97.61 |
| 0151 | Reverse Words in a String | Medium | String, Two_Pointers, LeetCode_75_Array/String | 2 | 99.69 |
| 0273 | Integer to English Words | Hard | String, Math, Recursion | 3 | 95.67 |
| 0704 | Binary Search | Easy | Array, Binary_Search | 0 | 100.00 |
| 0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 |
| 0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 |
| 0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 99.78 |
| 0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 |
| 0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 2 | 98.90 |
| 0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 6 | 96.68 |
| 0058 | Length of Last Word | Easy | String | 0 | 100.00 |
| 0605 | Can Place Flowers | Easy | Array, Greedy, LeetCode_75_Array/String | 1 | 96.77 |
| 0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 1 | 76.91 |
| 0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers | 0 | 100.00 |
| 0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 |
| 0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0066 | Plus One | Easy | Top_Interview_Questions, Array, Math | 0 | 100.00 |
| 0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 |
| 1291 | Sequential Digits | Medium | Enumeration | 0 | 100.00 |
| 0448 | Find All Numbers Disappeared in an Array | Easy | Array, Hash_Table | 3 | 100.00 |
| 0442 | Find All Duplicates in an Array | Medium | Array, Hash_Table | 5 | 98.83 |
| 0041 | First Missing Positive | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 1 | 100.00 |
| 0697 | Degree of an Array | Easy | Array, Hash_Table | 14 | 93.19 |
| 0532 | K-diff Pairs in an Array | Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 13 | 58.23 |
| 0713 | Subarray Product Less Than K | Medium | Array, Sliding_Window | 8 | 39.00 |
| 1007 | Minimum Domino Rotations For Equal Row | Medium | Array, Greedy | 5 | 79.64 |
| 1306 | Jump Game III | Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23 |
| 0456 | 132 Pattern | Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack | 16 | 82.41 |
| 0239 | Sliding Window Maximum | Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n*k)_Space_O(n+k) | 26 | 95.89 |
| 0392 | Is Subsequence | Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 |
| 0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers | 2 | 99.11 |
| 0977 | Squares of a Sorted Array | Easy | Array, Sorting, Two_Pointers | 1 | 100.00 |
| 0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00 |
| 0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 29 | 72.02 |
| 0053 | Maximum Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 |
| 0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 |
| 0912 | Sort an Array | Medium | Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Merge_Sort, Bucket_Sort, Counting_Sort, Radix_Sort | 25 | 38.15 |
| 0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum | 153 | 87.51 |
| 0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 |
| 0054 | Spiral Matrix | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 |
| 0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 |
| 1572 | Matrix Diagonal Sum | Easy | Array, Matrix | 0 | 100.00 |
| 0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m*n)_Space_O(1) | 0 | 100.00 |
| 0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 |
| 0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 |
| 0445 | Add Two Numbers II | Medium | Math, Stack, Linked_List | 3 | 90.38 |
| 0328 | Odd Even Linked List | Medium | Linked_List, LeetCode_75_LinkedList | 0 | 100.00 |
| 0061 | Rotate List | Medium | Two_Pointers, Linked_List | 0 | 100.00 |
| 0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0876 | Middle of the Linked List | Easy | Two_Pointers, Linked_List | 0 | 100.00 |
| 0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 |
| 0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 |
| 0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 |
| 0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 |
| 0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 1 | 99.92 |
| 0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 |
| 0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 |
| 0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 |
| 0146 | LRU Cache | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 |
| 0707 | Design Linked List | Medium | Design, Linked_List | 10 | 70.60 |
| 0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 48.38 |
| 0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 49.11 |
| 0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 |
| 0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00 |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Binary_Search_Tree | 0 | 100.00 |
| 0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0938 | Range Sum of BST | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0111 | Minimum Depth of Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 97.49 |
| 0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 |
| 0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 98.82 |
| 0701 | Insert into a Binary Search Tree | Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0297 | Serialize and Deserialize Binary Tree | Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 7 | 98.13 |
| 0124 | Binary Tree Maximum Path Sum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 |
| 0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 |
| 0337 | House Robber III | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 91.77 |
| 0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 |
| 0968 | Binary Tree Cameras | Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 |
| 0745 | Prefix and Suffix Search | Hard | String, Design, Trie | 366 | 76.15 |
| 0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 3 | 87.24 |
| 0133 | Clone Graph | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 25 | 68.87 |
| 0417 | Pacific Atlantic Water Flow | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62 |
| 0120 | Triangle | Medium | Array, Dynamic_Programming | 1 | 99.79 |
| 0118 | Pascal's Triangle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 |
| 0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming | 0 | 100.00 |
| 0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max) | 1 | 99.42 |
| 0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 92.74 |
| 0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0213 | House Robber II | Medium | Array, Dynamic_Programming | 0 | 100.00 |
| 0509 | Fibonacci Number | Easy | Dynamic_Programming, Math, Recursion, Memoization | 0 | 100.00 |
| 0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n) | 1 | 99.73 |
| 0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n) | 3 | 95.75 |
| 1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n*m)_Space_O(n*m) | 19 | 89.05 |
| 0072 | Edit Distance | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 |
| 0044 | Wildcard Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 2 | 99.87 |
| 0010 | Regular Expression Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m*n)_Space_O(m*n) | 1 | 100.00 |
| 0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 |
| 0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 |
| 0216 | Combination Sum III | Medium | Array, Backtracking, LeetCode_75_Backtracking | 1 | 81.35 |
| 0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n*2^n) | 0 | 100.00 |
| 0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 |
| 0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 1 | 94.08 |
| 0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00 |
| 0389 | Find the Difference | Easy | String, Hash_Table, Sorting, Bit_Manipulation | 1 | 100.00 |
| 0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 0 | 100.00 |
| 0461 | Hamming Distance | Easy | Bit_Manipulation | 0 | 100.00 |
| 1009 | Complement of Base 10 Integer | Easy | Bit_Manipulation | 1 | 41.56 |
| 0338 | Counting Bits | Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 |
| 0371 | Sum of Two Integers | Medium | Math, Bit_Manipulation | 0 | 100.00 |
| 0029 | Divide Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation | 1 | 97.44 |
| 0155 | Min Stack | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 |
| 0088 | Merge Sorted Array | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00 |
| 0027 | Remove Element | Easy | Array, Two_Pointers | 0 | 100.00 |
| 0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00 |
| 0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers | 0 | 100.00 |
| 0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 |
| 0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 99.78 |
| 0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 1 | 76.91 |
| 0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 |
| 0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0274 | H-Index | Medium | Array, Sorting, Counting_Sort | 0 | 100.00 |
| 0380 | Insert Delete GetRandom O(1) | Medium | Array, Hash_Table, Math, Design, Randomized | 27 | 93.44 |
| 0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 |
| 0134 | Gas Station | Medium | Top_Interview_Questions, Array, Greedy | 2 | 97.52 |
| 0135 | Candy | Hard | Array, Greedy | 3 | 83.95 |
| 0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 0013 | Roman to Integer | Easy | Top_Interview_Questions, String, Hash_Table, Math, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00 |
| 0012 | Integer to Roman | Medium | String, Hash_Table, Math, Big_O_Time_O(1)_Space_O(1) | 2 | 100.00 |
| 0058 | Length of Last Word | Easy | String | 0 | 100.00 |
| 0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String, Big_O_Time_O(n*m)_Space_O(m) | 0 | 100.00 |
| 0151 | Reverse Words in a String | Medium | String, Two_Pointers, LeetCode_75_Array/String | 2 | 99.69 |
| 0006 | Zigzag Conversion | Medium | String, Big_O_Time_O(n)_Space_O(n) | 2 | 99.71 |
| 0028 | Find the Index of the First Occurrence in a String | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 0 | 100.00 |
| 0068 | Text Justification | Hard | Array, String, Simulation | 0 | 100.00 |
| 0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers | 2 | 99.11 |
| 0392 | Is Subsequence | Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 |
| 0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers | 2 | 92.62 |
| 0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 |
| 0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 29 | 72.02 |
| 0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 99.76 |
| 0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 |
| 0030 | Substring with Concatenation of All Words | Hard | String, Hash_Table, Sliding_Window | 11 | 97.43 |
| 0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 |
| 0036 | Valid Sudoku | Medium | Top_Interview_Questions, Array, Hash_Table, Matrix | 1 | 100.00 |
| 0054 | Spiral Matrix | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 |
| 0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 |
| 0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m*n)_Space_O(1) | 0 | 100.00 |
| 0289 | Game of Life | Medium | Array, Matrix, Simulation | 0 | 100.00 |
| 0383 | Ransom Note | Easy | String, Hash_Table, Counting | 1 | 99.10 |
| 0205 | Isomorphic Strings | Easy | String, Hash_Table | 2 | 99.18 |
| 0290 | Word Pattern | Easy | String, Hash_Table | 0 | 100.00 |
| 0242 | Valid Anagram | Easy | String, Hash_Table, Sorting | 2 | 97.76 |
| 0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 6 | 97.61 |
| 0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 2 | 98.90 |
| 0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00 |
| 0219 | Contains Duplicate II | Easy | Array, Hash_Table, Sliding_Window | 15 | 98.00 |
| 0128 | Longest Consecutive Sequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 14 | 98.89 |
| 0228 | Summary Ranges | Easy | Array | 0 | 100.00 |
| 0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 |
| 0057 | Insert Interval | Medium | Array | 0 | 100.00 |
| 0452 | Minimum Number of Arrows to Burst Balloons | Medium | Array, Sorting, Greedy, LeetCode_75_Intervals | 52 | 89.91 |
| 0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 2 | 97.19 |
| 0071 | Simplify Path | Medium | String, Stack | 2 | 99.86 |
| 0155 | Min Stack | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 |
| 0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack | 6 | 76.50 |
| 0224 | Basic Calculator | Hard | String, Math, Stack, Recursion | 2 | 96.52 |
javadev/LeetCode-in-Java is a public repo on GitHub by javadev. Java-based LeetCode algorithm problem solutions, regularly updated.
It declares the MIT license on GitHub.
Its maker has not tagged a system, so it is unknown here. Its README says what it needs.
Open "Take it" on its page: Take My Repo writes an install plan for your machine and hands it to your AI agent (Claude Code, Codex or Cursor), which asks you before each step. Take My Repo has not tested it on any machine.
Its last change on GitHub was on 2026-11-19. Take My Repo does not judge from that whether it is maintained.
Nobody has reviewed it on Take My Repo yet, which says nothing about its quality.
A complete computer science study plan to become a software engineer.

坚持分享 GitHub 上高质量、有趣实用的开源技术教程、开发者工具、编程网站、技术资讯。A list cool, interesting projects of GitHub.



✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% | LeetCode 题解
Kotlin-based LeetCode algorithm problem solutions, regularly updated.
The tool to convert amount to words in Ukrainian/English/Russian languages. Сумма прописью.

This page is also available as structured data, with the same sources and dates.
/api/v1/resources/gh/javadev/LeetCode-in-JavaTake My Repo has not tested this on your machine. Requirements come from the project's own documentation.