diff --git a/dsa-problems/leetcode-problems/0000-0099.md b/dsa-problems/leetcode-problems/0000-0099.md new file mode 100644 index 000000000..0db4d0217 --- /dev/null +++ b/dsa-problems/leetcode-problems/0000-0099.md @@ -0,0 +1,617 @@ +--- +id: 0000-0099 +title: LeetCode Problems 0 - 99 +sidebar_label: 0000-0099 +sidebar_position: 1 +keywords: + - leetcode problems + - leetcode problems 0 - 99 + - leetcode problems problems +--- + + +export const problems = [ + { + "problemName": "1. Two Sum", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/two-sum/", + "solutionLink": "#" + }, + { + "problemName": "2. Add Two Numbers", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/add-two-numbers/", + "solutionLink": "#" + }, + { + "problemName": "3. Longest Substring Without Repeating Characters", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/longest-substring-without-repeating-characters/", + "solutionLink": "#" + }, + { + "problemName": "4. Median of Two Sorted Arrays", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/median-of-two-sorted-arrays/", + "solutionLink": "#" + }, + { + "problemName": "5. Longest Palindromic Substring", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/longest-palindromic-substring/", + "solutionLink": "#" + }, + { + "problemName": "6. ZigZag Conversion", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/zigzag-conversion/", + "solutionLink": "#" + }, + { + "problemName": "7. Reverse Integer", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/reverse-integer/", + "solutionLink": "#" + }, + { + "problemName": "8. String to Integer (atoi)", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/string-to-integer-atoi/", + "solutionLink": "#" + }, + { + "problemName": "9. Palindrome Number", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/palindrome-number/", + "solutionLink": "#" + }, + { + "problemName": "10. Regular Expression Matching", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/regular-expression-matching/", + "solutionLink": "#" + }, + { + "problemName": "11. Container With Most Water", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/container-with-most-water/", + "solutionLink": "#" + }, + { + "problemName": "12. Integer to Roman", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/integer-to-roman/", + "solutionLink": "#" + }, + { + "problemName": "13. Roman to Integer", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/roman-to-integer/", + "solutionLink": "#" + }, + { + "problemName": "14. Longest Common Prefix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/longest-common-prefix/", + "solutionLink": "#" + }, + { + "problemName": "15. 3Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/3sum/", + "solutionLink": "#" + }, + { + "problemName": "16. 3Sum Closest", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/3sum-closest/", + "solutionLink": "#" + }, + { + "problemName": "17. Letter Combinations of a Phone Number", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/", + "solutionLink": "#" + }, + { + "problemName": "18. 4Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/4sum/", + "solutionLink": "#" + }, + { + "problemName": "19. Remove Nth Node From End of List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/", + "solutionLink": "#" + }, + { + "problemName": "20. Valid Parentheses", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/valid-parentheses/", + "solutionLink": "#" + }, + { + "problemName": "21. Merge Two Sorted Lists", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/merge-two-sorted-lists/", + "solutionLink": "#" + }, + { + "problemName": "22. Generate Parentheses", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/generate-parentheses/", + "solutionLink": "#" + }, + { + "problemName": "23. Merge k Sorted Lists", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/merge-k-sorted-lists/", + "solutionLink": "#" + }, + { + "problemName": "24. Swap Nodes in Pairs", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/swap-nodes-in-pairs/", + "solutionLink": "#" + }, + { + "problemName": "25. Reverse Nodes in k-Group", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/reverse-nodes-in-k-group/", + "solutionLink": "#" + }, + { + "problemName": "26. Remove Duplicates from Sorted Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/", + "solutionLink": "#" + }, + { + "problemName": "27. Remove Element", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-element/", + "solutionLink": "#" + }, + { + "problemName": "28. Implement strStr()", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/implement-strstr/", + "solutionLink": "#" + }, + { + "problemName": "29. Divide Two Integers", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/divide-two-integers/", + "solutionLink": "#" + }, + { + "problemName": "30. Substring with Concatenation of All Words", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/", + "solutionLink": "#" + }, + { + "problemName": "31. Next Permutation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/next-permutation/", + "solutionLink": "#" + }, + { + "problemName": "32. Longest Valid Parentheses", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/longest-valid-parentheses/", + "solutionLink": "#" + }, + { + "problemName": "33. Search in Rotated Sorted Array", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/search-in-rotated-sorted-array/", + "solutionLink": "#" + }, + { + "problemName": "34. Find First and Last Position of Element in Sorted Array", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/", + "solutionLink": "#" + }, + { + "problemName": "35. Search Insert Position", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/search-insert-position/", + "solutionLink": "#" + }, + { + "problemName": "36. Valid Sudoku", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/valid-sudoku/", + "solutionLink": "#" + }, + { + "problemName": "37. Sudoku Solver", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/sudoku-solver/", + "solutionLink": "#" + }, + { + "problemName": "38. Count and Say", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-and-say/", + "solutionLink": "#" + }, + { + "problemName": "39. Combination Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/combination-sum/", + "solutionLink": "#" + }, + { + "problemName": "40. Combination Sum II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/combination-sum-ii/", + "solutionLink": "#" + }, + { + "problemName": "41. First Missing Positive", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/first-missing-positive/", + "solutionLink": "#" + }, + { + "problemName": "42. Trapping Rain Water", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/trapping-rain-water/", + "solutionLink": "#" + }, + { + "problemName": "43. Multiply Strings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/multiply-strings/", + "solutionLink": "#" + }, + { + "problemName": "44. Wildcard Matching", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/wildcard-matching/", + "solutionLink": "#" + }, + { + "problemName": "45. Jump Game II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/jump-game-ii/", + "solutionLink": "#" + }, + { + "problemName": "46. Permutations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/permutations/", + "solutionLink": "#" + }, + { + "problemName": "47. Permutations II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/permutations-ii/", + "solutionLink": "#" + }, + { + "problemName": "48. Rotate Image", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/rotate-image/", + "solutionLink": "#" + }, + { + "problemName": "49. Group Anagrams", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/group-anagrams/", + "solutionLink": "#" + }, + { + "problemName": "50. Pow(x, n)", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/powx-n/", + "solutionLink": "#" + }, + { + "problemName": "51. N-Queens", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/n-queens/", + "solutionLink": "#" + }, + { + "problemName": "52. N-Queens II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/n-queens-ii/", + "solutionLink": "#" + }, + { + "problemName": "53. Maximum Subarray", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-subarray/", + "solutionLink": "#" + }, + { + "problemName": "54. Spiral Matrix", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/spiral-matrix/", + "solutionLink": "#" + }, + { + "problemName": "55. Jump Game", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/jump-game/", + "solutionLink": "#" + }, + { + "problemName": "56. Merge Intervals", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/merge-intervals/", + "solutionLink": "#" + }, + { + "problemName": "57. Insert Interval", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/insert-interval/", + "solutionLink": "#" + }, + { + "problemName": "58. Length of Last Word", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/length-of-last-word/", + "solutionLink": "#" + }, + { + "problemName": "59. Spiral Matrix II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/spiral-matrix-ii/", + "solutionLink": "#" + }, + { + "problemName": "60. Permutation Sequence", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/permutation-sequence/", + "solutionLink": "#" + }, + { + "problemName": "61. Rotate List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/rotate-list/", + "solutionLink": "#" + }, + { + "problemName": "62. Unique Paths", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/unique-paths/", + "solutionLink": "#" + }, + { + "problemName": "63. Unique Paths II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/unique-paths-ii/", + "solutionLink": "#" + }, + { + "problemName": "64. Minimum Path Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-path-sum/", + "solutionLink": "#" + }, + { + "problemName": "65. Valid Number", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/valid-number/", + "solutionLink": "#" + }, + { + "problemName": "66. Plus One", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/plus-one/", + "solutionLink": "#" + }, + { + "problemName": "67. Add Binary", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/add-binary/", + "solutionLink": "#" + }, + { + "problemName": "68. Text Justification", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/text-justification/", + "solutionLink": "#" + }, + { + "problemName": "69. Sqrt(x)", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/sqrtx/", + "solutionLink": "#" + }, + { + "problemName": "70. Climbing Stairs", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/climbing-stairs/", + "solutionLink": "#" + }, + { + "problemName": "71. Simplify Path", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/simplify-path/", + "solutionLink": "#" + }, + { + "problemName": "72. Edit Distance", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/edit-distance/", + "solutionLink": "#" + }, + { + "problemName": "73. Set Matrix Zeroes", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/set-matrix-zeroes/", + "solutionLink": "#" + }, + { + "problemName": "74. Search a 2D Matrix", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/search-a-2d-matrix/", + "solutionLink": "#" + }, + { + "problemName": "75. Sort Colors", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-colors/", + "solutionLink": "#" + }, + { + "problemName": "76. Minimum Window Substring", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-window-substring/", + "solutionLink": "#" + }, + { + "problemName": "77. Combinations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/combinations/", + "solutionLink": "#" + }, + { + "problemName": "78. Subsets", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/subsets/", + "solutionLink": "#" + }, + { + "problemName": "79. Word Search", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/word-search/", + "solutionLink": "#" + }, + { + "problemName": "80. Remove Duplicates from Sorted Array II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/", + "solutionLink": "#" + }, + { + "problemName": "81. Search in Rotated Sorted Array II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/search-in-rotated-sorted-array-ii/", + "solutionLink": "#" + }, + { + "problemName": "82. Remove Duplicates from Sorted List II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/", + "solutionLink": "#" + }, + { + "problemName": "83. Remove Duplicates from Sorted List", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/", + "solutionLink": "#" + }, + { + "problemName": "84. Largest Rectangle in Histogram", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/largest-rectangle-in-histogram/", + "solutionLink": "#" + }, + { + "problemName": "85. Maximal Rectangle", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximal-rectangle/", + "solutionLink": "#" + }, + { + "problemName": "86. Partition List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/partition-list/", + "solutionLink": "#" + }, + { + "problemName": "87. Scramble String", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/scramble-string/", + "solutionLink": "#" + }, + { + "problemName": "88. Merge Sorted Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/merge-sorted-array/", + "solutionLink": "#" + }, + { + "problemName": "89. Gray Code", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/gray-code/", + "solutionLink": "#" + }, + { + "problemName": "90. Subsets II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/subsets-ii/", + "solutionLink": "#" + }, + { + "problemName": "91. Decode Ways", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/decode-ways/", + "solutionLink": "#" + }, + { + "problemName": "92. Reverse Linked List II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reverse-linked-list-ii/", + "solutionLink": "#" + }, + { + "problemName": "93. Restore IP Addresses", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/restore-ip-addresses/", + "solutionLink": "#" + }, + { + "problemName": "94. Binary Tree Inorder Traversal", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/binary-tree-inorder-traversal/", + "solutionLink": "#" + }, + { + "problemName": "95. Unique Binary Search Trees II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/unique-binary-search-trees-ii/", + "solutionLink": "#" + }, + { + "problemName": "96. Unique Binary Search Trees", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/unique-binary-search-trees/", + "solutionLink": "#" + }, + { + "problemName": "97. Interleaving String", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/interleaving-string/", + "solutionLink": "#" + }, + { + "problemName": "98. Validate Binary Search Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/validate-binary-search-tree/", + "solutionLink": "#" + }, + { + "problemName": "99. Recover Binary Search Tree", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/recover-binary-search-tree/", + "solutionLink": "#" + } +] + + + +Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem. \ No newline at end of file diff --git a/dsa-problems/leetcode-problems/0100-0199.md b/dsa-problems/leetcode-problems/0100-0199.md new file mode 100644 index 000000000..a4c1f3e42 --- /dev/null +++ b/dsa-problems/leetcode-problems/0100-0199.md @@ -0,0 +1,11 @@ +--- +id: 0100-0199 +title: LeetCode Problems 100 - 199 +sidebar_label: 100 - 199 +sidebar_position: 2 +keywords: + - LeetCode + - LeeCode Problems + - LeeCode Problems 100 - 199 + - dsa problems +---