Code | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1 | Two Sum | [Java] | Easy | [Docs] |
15 | 3Sum | [Java] | Medium | [Docs] |
19 | Remove Nth Node From End of List | [Java] | Medium | [Docs] |
33 | Search in Rotated Sorted Array | [Java] | Medium | [Docs] |
48 | Rotate Image | [Java] | Medium | [Docs] |
55 | Jump Game | [Java] | Medium | [Docs] |
60 | Permutation Sequence | [Java] | Medium | [Docs] |
72 | Edit Distance | [Java] | Hard | [Docs] |
86 | Partition List | [Java] | Medium | [Docs] |
Code | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
39 | CombinationSum | [Java] | Medium | [Docs] |
Code | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
64 | Minimum Path Sum | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
138 | Copy List with Random Pointer | [Java] | Medium | [Docs] |
146 | LRU Cache | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
201 | Bitwise AND of Numbers Range | [Java] | Medium | [Docs] |
234 | Palindrome Linked List | [Java] | Easy | [Docs] |
238 | Product of Array Except Self | [Java] | Medium | [Docs] |
242 | Valid Anagram | [Java] | Easy | [Docs] |
278 | First Bad Version | [Java] | Easy | [Docs] |
292 | Nim Game | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
560 | Subarray Sum Equals K | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
623 | Add One Row to Tree | [Java] | Medium | [Docs] |
673 | Number of Longest Increasing Subsequence | [Java] | Medium | |
674 | Longest Continuous Increasing Subsequence | [Java] | Easy | |
678 | Valid Parenthesis String | [Java] | Medium | [Docs] |
681 | Next Closest Time | [Java] | Medium | |
692 | Top K Frequent Words | [Java] | Medium | |
662 | Maximum Width of Binary Tree | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
977 | Squares of a Sorted Array | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1008 | Construct Binary Search Tree from Preorder Traversal | [Java] | Medium | [Docs] |
1013 | Partition Array Into Three Parts With Equal Sum | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1143 | Longest CommonSubsequence | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
300 | Longest Increasing Subsequence | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
368 | Largest Divisible Subset | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
646 | Maximum Length of Pair Chain | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
673 | Number of Longest Increasing Subsequence | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
740 | Delete and Earn | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1048 | Longest String Chain | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
949 | Largest Time for Given Digits | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
220 | Contains Duplicate3 | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
351 | Android Unlock Patterns | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
994 | Rotting Oranges | [Java] | Medium | [Docs] |
394 | Decode String | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
286 | Walls and Gates | [Java] | Medium | [Docs] |
819 | Most Common Word | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
--- | ----- | -------- | ---------- | ---- |
22 | Generate Parentheses | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1167 | Minimum Cost to Connect Sticks | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1674 | Minimum Moves to Make Array Complementary | [Java] | Medium | [Docs] |
activity-stream-service "so-oncehub-service","oh-2fa","oh-field-service","oh-billing","oh-contact", "ns-notification-service","ns-queue-service","exchange-sync-service","idp","oh-account-monitoring-cornjob","so-renewal-and-failure-service","oh-account-hard-deletion-service","ns-cron-service"
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1155 | Number of Dice Rolls With Target Sum | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
347 | Top K Frequent Elements | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
653 | Two Sum Input BST | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
214 | shortest palindrome | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
647 | palindromic substrings | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
746 | min-cost-climbing-stairs | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
5 | Longest Palindromic Substring | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
1673 | Find the Most Competitive Subsequence | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
698 | Partition to K Equal Sum Subsets | [Java] | Medium | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
594 | Longest Harmonious Subsequence | [Java] | Easy | [Docs] |
# | Title | Solution | Difficulty | Docs |
---|---|---|---|---|
547 | Number of Provinces | [Java] | Medium | [Docs] |