https://github.com/threeal/leetspace
A dedicated workspace and archive for my LeetCode submissions
https://github.com/threeal/leetspace
competitive-programming leetcode leetcode-cpp leetcode-solutions
Last synced: 4 days ago
JSON representation
A dedicated workspace and archive for my LeetCode submissions
- Host: GitHub
- URL: https://github.com/threeal/leetspace
- Owner: threeal
- License: mit
- Created: 2023-09-13T10:41:38.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2025-12-11T09:34:37.000Z (9 days ago)
- Last Synced: 2025-12-11T18:14:30.677Z (9 days ago)
- Topics: competitive-programming, leetcode, leetcode-cpp, leetcode-solutions
- Language: C++
- Homepage: https://leetcode.com/threeal
- Size: 4.69 MB
- Stars: 1
- Watchers: 1
- Forks: 1
- Open Issues: 380
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetSpace
LeetSpace serves as a dedicated workspace and archive for my [LeetCode](https://leetcode.com) submissions.
## Problems
| Problem | Difficulty | Solution |
|---|---|---|
| [1. Two Sum](https://leetcode.com/problems/two-sum) | Easy | [C](./old-problems/0001/c/solution.c) [C++](./old-problems/0001/solution.cpp) |
| [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [C++](./old-problems/0002/solution.cpp) |
| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | [C](./old-problems/0003/c/solution.c) [C++](./old-problems/0003/solution.cpp) |
| [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | [C](./old-problems/0004/c/solution.c) [C++](./old-problems/0004/solution.cpp) |
| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | [C](./old-problems/0005/c/solution.c) [C++](./old-problems/0005/solution.cpp) |
| [6. Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion) | Medium | [C](./old-problems/0006/c/solution.c) [C++](./old-problems/0006/solution.cpp) |
| [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Medium | [C](./old-problems/0007/c/solution.c) [C++](./old-problems/0007/solution.cpp) |
| [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | [C](./old-problems/0008/c/solution.c) [C++](./old-problems/0008/solution.cpp) |
| [9. Palindrome Number](https://leetcode.com/problems/palindrome-number) | Easy | [C](./old-problems/0009/c/solution.c) [C++](./old-problems/0009/solution.cpp) |
| [10. Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [C](./old-problems/0010/c/solution.c) [C++](./old-problems/0010/solution.cpp) |
| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water) | Medium | [C++](./problems/0011/solution.cpp) |
| [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | Medium | [C](./old-problems/0012/c/solution.c) [C++](./old-problems/0012/solution.cpp) |
| [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | Easy | [C](./old-problems/0013/c/solution.c) [C++](./old-problems/0013/solution.cpp) |
| [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [C](./old-problems/0014/c/solution.c) [C++](./old-problems/0014/solution.cpp) |
| [15. 3Sum](https://leetcode.com/problems/3sum) | Medium | [C++](./problems/0015/solution.cpp) |
| [16. 3Sum Closest](https://leetcode.com/problems/3sum-closest/) | Medium | [C](./old-problems/0016/c/solution.c) [C++](./old-problems/0016/solution.cpp) |
| [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | [C++](./problems/0017/solution.cpp) |
| [18. 4Sum](https://leetcode.com/problems/4sum/) | Medium | [C](./old-problems/0018/c/solution.c) [C++](./old-problems/0018/solution.cpp) |
| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | [C++](./old-problems/0019/solution.cpp) |
| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [C](./old-problems/0020/c/solution.c) [C++](./old-problems/0020/solution.cpp) |
| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [C++](./old-problems/0021/solution.cpp) |
| [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [C](./old-problems/0022/c/solution.c) [C++](./old-problems/0022/solution.cpp) |
| [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [C++](./old-problems/0023/solution.cpp) |
| [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | Medium | [C++](./old-problems/0024/solution.cpp) |
| [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [C++](./old-problems/0025/solution.cpp) |
| [26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | Easy | [C++](./old-problems/0026/solution.cpp) |
| [27. Remove Element](https://leetcode.com/problems/remove-element) | Easy | [C++](./old-problems/0027/solution.cpp) |
| [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string) | Easy | [C](./old-problems/0028/c/solution.c) [C++](./old-problems/0028/solution.cpp) |
| [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | Medium | [C](./old-problems/0029/c/solution.c) [C++](./old-problems/0029/solution.cpp) |
| [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | Hard | [C++](./problems/0030/solution.cpp) |
| [31. Next Permutation](https://leetcode.com/problems/next-permutation/) | Medium | [C++](./old-problems/0031/solution.cpp) |
| [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [C](./old-problems/0032/c/solution.c) [C++](./old-problems/0032/solution.cpp) |
| [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [C++](./old-problems/0033/solution.cpp) |
| [34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium | [C++](./problems/0034/solution.cpp) |
| [35. Search Insert Position](https://leetcode.com/problems/search-insert-position) | Easy | [C++](./problems/0035/solution.cpp) |
| [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [C](./old-problems/0036/c/solution.c) [C++](./old-problems/0036/solution.cpp) |
| [37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [C++](./old-problems/0037/solution.cpp) |
| [38. Count and Say](https://leetcode.com/problems/count-and-say/) | Medium | [C](./old-problems/0038/c/solution.c) [C++](./old-problems/0038/solution.cpp) |
| [39. Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [C++](./old-problems/0039/solution.cpp) |
| [40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | Medium | [C](./old-problems/0040/c/solution.c) [C++](./old-problems/0040/solution.cpp) |
| [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [C](./old-problems/0041/c/solution.c) [C++](./old-problems/0041/solution.cpp) |
| [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [C](./old-problems/0042/c/solution.c) [C++](./old-problems/0042/solution.cpp) |
| [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/) | Medium | [C](./old-problems/0043/c/solution.c) [C++](./old-problems/0043/solution.cpp) |
| [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Medium | [C](./old-problems/0045/c/solution.c) [C++](./old-problems/0045/solution.cpp) |
| [46. Permutations](https://leetcode.com/problems/permutations/) | Medium | [C](./old-problems/0046/c/solution.c) [C++](./old-problems/0046/solution.cpp) |
| [47. Permutations II](https://leetcode.com/problems/permutations-ii/) | Medium | [C](./old-problems/0047/c/solution.c) [C++](./old-problems/0047/solution.cpp) |
| [48. Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [C++](./old-problems/0048/solution.cpp) |
| [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [C++](./problems/0049/solution.cpp) |
| [50. Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [C](./old-problems/0050/c/solution.c) [C++](./old-problems/0050/solution.cpp) |
| [51. N-Queens](https://leetcode.com/problems/n-queens/) | Hard | [C++](./problems/0051/solution.cpp) |
| [52. N-Queens II](https://leetcode.com/problems/n-queens-ii/) | Hard | [C](./old-problems/0052/c/solution.c) [C++](./old-problems/0052/solution.cpp) |
| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Medium | [C](./old-problems/0053/c/solution.c) [C++](./old-problems/0053/solution.cpp) |
| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [C](./old-problems/0054/c/solution.c) [C++](./old-problems/0054/solution.cpp) |
| [55. Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [C](./old-problems/0055/c/solution.c) [C++](./old-problems/0055/solution.cpp) |
| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [C](./old-problems/0056/c/solution.c) [C++](./old-problems/0056/solution.cpp) |
| [57. Insert Interval](https://leetcode.com/problems/insert-interval/) | Medium | [C](./old-problems/0057/c/solution.c) [C++](./old-problems/0057/solution.cpp) |
| [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word) | Easy | [C](./old-problems/0058/c/solution.c) [C++](./old-problems/0058/solution.cpp) |
| [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [C](./old-problems/0059/c/solution.c) [C++](./old-problems/0059/solution.cpp) |
| [60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | Hard | [C](./old-problems/0060/c/solution.c) [C++](./old-problems/0060/solution.cpp) |
| [61. Rotate List](https://leetcode.com/problems/rotate-list/) | Medium | [C++](./old-problems/0061/solution.cpp) |
| [62. Unique Paths](https://leetcode.com/problems/unique-paths/) | Medium | [C](./old-problems/0062/c/solution.c) [C++](./old-problems/0062/solution.cpp) |
| [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [C](./old-problems/0063/c/solution.c) [C++](./old-problems/0063/solution.cpp) |
| [64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [C](./old-problems/0064/c/solution.c) [C++](./old-problems/0064/solution.cpp) |
| [65. Valid Number](https://leetcode.com/problems/valid-number/) | Hard | [C](./old-problems/0065/c/solution.c) [C++](./old-problems/0065/solution.cpp) |
| [66. Plus One](https://leetcode.com/problems/plus-one) | Easy | [C++](./problems/0066/solution.cpp) |
| [67. Add Binary](https://leetcode.com/problems/add-binary/) | Easy | [C](./old-problems/0067/c/solution.c) [C++](./old-problems/0067/solution.cpp) |
| [68. Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [C](./old-problems/0068/c/solution.c) [C++](./old-problems/0068/solution.cpp) |
| [69. Sqrt(x)](https://leetcode.com/problems/sqrtx/) | Easy | [C](./old-problems/0069/c/solution.c) [C++](./old-problems/0069/solution.cpp) |
| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [C](./old-problems/0070/c/solution.c) [C++](./old-problems/0070/solution.cpp) |
| [71. Simplify Path](https://leetcode.com/problems/simplify-path/) | Medium | [C](./old-problems/0071/c/solution.c) [C++](./old-problems/0071/solution.cpp) |
| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | Medium | [C++](./old-problems/0073/solution.cpp) |
| [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [C](./old-problems/0074/c/solution.c) [C++](./old-problems/0074/solution.cpp) |
| [75. Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [C++](./old-problems/0075/solution.cpp) |
| [77. Combinations](https://leetcode.com/problems/combinations/) | Medium | [C](./old-problems/0077/c/solution.c) [C++](./old-problems/0077/solution.cpp) |
| [78. Subsets](https://leetcode.com/problems/subsets/) | Medium | [C++](./old-problems/0078/solution.cpp) |
| [79. Word Search](https://leetcode.com/problems/word-search/) | Medium | [C](./old-problems/0079/c/solution.c) [C++](./old-problems/0079/solution.cpp) |
| [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | Medium | [C++](./old-problems/0080/solution.cpp) |
| [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | Medium | [C](./old-problems/0081/c/solution.c) [C++](./old-problems/0081/solution.cpp) |
| [82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | Medium | [C++](./old-problems/0082/solution.cpp) |
| [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | Easy | [C++](./old-problems/0083/solution.cpp) |
| [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | Hard | [C](./old-problems/0084/c/solution.c) [C++](./old-problems/0084/solution.cpp) |
| [86. Partition List](https://leetcode.com/problems/partition-list/) | Medium | [C++](./old-problems/0086/solution.cpp) |
| [87. Scramble String](https://leetcode.com/problems/scramble-string/) | Hard | [C](./old-problems/0087/c/solution.c) [C++](./old-problems/0087/solution.cpp) |
| [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [C++](./old-problems/0088/solution.cpp) |
| [89. Gray Code](https://leetcode.com/problems/gray-code/) | Medium | [C](./old-problems/0089/c/solution.c) [C++](./old-problems/0089/solution.cpp) |
| [90. Subsets II](https://leetcode.com/problems/subsets-ii/) | Medium | [C](./old-problems/0090/c/solution.c) [C++](./old-problems/0090/solution.cpp) |
| [91. Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [C](./old-problems/0091/c/solution.c) [C++](./old-problems/0091/solution.cpp) |
| [92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | Medium | [C++](./old-problems/0092/solution.cpp) |
| [93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [C++](./old-problems/0093/solution.cpp) |
| [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Easy | [C++](./old-problems/0094/solution.cpp) |
| [97. Interleaving String](https://leetcode.com/problems/interleaving-string/) | Medium | [C](./old-problems/0097/c/solution.c) [C++](./old-problems/0097/solution.cpp) |
| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [C++](./old-problems/0098/solution.cpp) |
| [100. Same Tree](https://leetcode.com/problems/same-tree/) | Easy | [C++](./old-problems/0100/solution.cpp) |
| [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | Easy | [C++](./old-problems/0101/solution.cpp) |
| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [C++](./old-problems/0104/solution.cpp) |
| [112. Path Sum](https://leetcode.com/problems/path-sum/) | Easy | [C++](./old-problems/0112/solution.cpp) |
| [113. Path Sum II](https://leetcode.com/problems/path-sum-ii/) | Medium | [C++](./old-problems/0113/solution.cpp) |
| [114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | Medium | [C++](./old-problems/0114/solution.cpp) |
| [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | Hard | [C](./old-problems/0115/c/solution.c) [C++](./old-problems/0115/solution.cpp) |
| [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | Easy | [C](./old-problems/0118/c/solution.c) [C++](./old-problems/0118/solution.cpp) |
| [119. Pascal's Triangle II](pascals-triangle-ii) | Easy | [C](./old-problems/0119/c/solution.c) [C++](./old-problems/0119/solution.cpp) |
| [120. Triangle](https://leetcode.com/problems/triangle/) | Medium | [C](./old-problems/0120/c/solution.c) [C++](./old-problems/0120/solution.cpp) |
| [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [C](./old-problems/0121/c/solution.c) [C++](./old-problems/0121/solution.cpp) |
| [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium | [C](./old-problems/0122/c/solution.c) [C++](./old-problems/0122/solution.cpp) |
| [123. Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | Hard | [C](./old-problems/0123/c/solution.c) [C++](./old-problems/0123/solution.cpp) |
| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/) | Easy | [C](./old-problems/0125/c/solution.c) [C++](./old-problems/0125/solution.cpp) |
| [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Medium | [C](./old-problems/0128/c/solution.c) [C++](./old-problems/0128/solution.cpp) |
| [129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | Medium | [C++](./old-problems/0129/solution.cpp) |
| [130. Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | Medium | [C++](./old-problems/0130/solution.cpp) |
| [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | Medium | [C](./old-problems/0131/c/solution.c) [C++](./old-problems/0131/solution.cpp) |
| [134. Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [C](./old-problems/0134/c/solution.c) [C++](./old-problems/0134/solution.cpp) |
| [135. Candy](https://leetcode.com/problems/candy/) | Hard | [C](./old-problems/0135/c/solution.c) [C++](./old-problems/0135/solution.cpp) |
| [136. Single Number](https://leetcode.com/problems/single-number/) | Easy | [C](./old-problems/0136/solution.c) [C++](./old-problems/0136/solution.cpp) |
| [137. Single Number II](https://leetcode.com/problems/single-number-ii/) | Medium | [C](./old-problems/0137/c/solution.c) [C++](./old-problems/0137/solution.cpp) |
| [140. Word Break II](https://leetcode.com/problems/word-break-ii/) | Hard | [C++](./old-problems/0140/solution.cpp) |
| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [C++](./old-problems/0141/solution.cpp) |
| [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | Medium | [C++](./old-problems/0142/solution.cpp) |
| [143. Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [C++](./old-problems/0143/solution.cpp) |
| [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | Easy | [C++](./old-problems/0144/solution.cpp) |
| [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | [C++](./old-problems/0145/solution.cpp) |
| [148. Sort List](https://leetcode.com/problems/sort-list/) | Medium | [C++](./old-problems/0148/solution.cpp) |
| [149. Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | Hard | [C++](./old-problems/0149/solution.cpp) |
| [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [C](./old-problems/0150/c/solution.c) [C++](./old-problems/0150/solution.cpp) |
| [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [C](./old-problems/0151/c/solution.c) [C++](./old-problems/0151/solution.cpp) |
| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [C](./old-problems/0152/c/solution.c) [C++](./old-problems/0152/solution.cpp) |
| [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium | [C](./old-problems/0153/c/solution.c) [C++](./old-problems/0153/solution.cpp) |
| [164. Maximum Gap](https://leetcode.com/problems/maximum-gap/) | Medium | [C](./old-problems/0164/c/solution.c) [C++](./old-problems/0164/solution.cpp) |
| [165. Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Medium | [C](./old-problems/0165/c/solution.c) [C++](./old-problems/0165/solution.cpp) |
| [166. Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [C++](./old-problems/0166/solution.cpp) |
| [168. Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | Easy | [C](./old-problems/0168/c/solution.c) [C++](./old-problems/0168/solution.cpp) |
| [169. Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [C](./old-problems/0169/c/solution.c) [C++](./old-problems/0169/solution.cpp) |
| [173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | Medium | [C++](./old-problems/0173/solution.cpp) |
| [179. Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [C](./old-problems/0179/c/solution.c) [C++](./old-problems/0179/solution.cpp) |
| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) | Easy | [C](./old-problems/0190/c/solution.c) [C++](./old-problems/0190/solution.cpp) |
| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [C](./old-problems/0191/c/solution.c) [C++](./old-problems/0191/solution.cpp) |
| [198. House Robber](https://leetcode.com/problems/house-robber/) | Medium | [C](./old-problems/0198/c/solution.c) [C++](./old-problems/0198/solution.cpp) |
| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [C](./old-problems/0200/c/solution.c) [C++](./old-problems/0200/solution.cpp) |
| [201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | Medium | [C](./old-problems/0201/c/solution.c) [C++](./old-problems/0201/solution.cpp) |
| [202. Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [C++](./old-problems/0202/solution.cpp) |
| [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | Easy | [C++](./old-problems/0203/solution.cpp) |
| [204. Count Primes](https://leetcode.com/problems/count-primes/) | Medium | [C](./old-problems/0204/c/solution.c) [C++](./old-problems/0204/solution.cpp) |
| [205. Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | Easy | [C](./old-problems/0205/c/solution.c) [C++](./old-problems/0205/solution.cpp) |
| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [C++](./old-problems/0206/solution.cpp) |
| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/) | Medium | [C](./old-problems/0213/c/solution.c) [C++](./old-problems/0213/solution.cpp) |
| [214. Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/) | Hard | [C++](./problems/0214/solution.cpp) |
| [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [C](./old-problems/0217/c/solution.c) [C++](./old-problems/0217/solution.cpp) |
| [219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | Easy | [C++](./problems/0219/solution.cpp) |
| [224. Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [C](./old-problems/0224/c/solution.c) [C++](./old-problems/0224/solution.cpp) |
| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [C++](./old-problems/0226/solution.cpp) |
| [228. Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Easy | [C](./old-problems/0228/c/solution.c) [C++](./old-problems/0228/solution.cpp) |
| [229. Majority Element II](https://leetcode.com/problems/majority-element-ii) | Medium | [C](./old-problems/0229/c/solution.c) [C++](./old-problems/0229/solution.cpp) |
| [230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | Medium | [C++](./old-problems/0230/solution.cpp) |
| [231. Power of Two](https://leetcode.com/problems/power-of-two/) | Easy | [C](./old-problems/0231/c/solution.c) [C++](./old-problems/0231/solution.cpp) |
| [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | Easy | [C++](./old-problems/0232/solution.cpp) |
| [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [C++](./old-problems/0234/solution.cpp) |
| [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | Medium | [C++](./old-problems/0237/solution.cpp) |
| [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [C](./old-problems/0238/c/solution.c) [C++](./old-problems/0238/solution.cpp) |
| [241. Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) | Medium | [C++](./old-problems/0241/solution.cpp) |
| [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [C](./old-problems/0242/c/solution.c) [C++](./old-problems/0242/solution.cpp) |
| [258. Add Digits](https://leetcode.com/problems/add-digits/) | Easy | [C](./old-problems/0258/c/solution.c) [C++](./old-problems/0258/solution.cpp) |
| [260. Single Number III](https://leetcode.com/problems/single-number-iii/) | Medium | [C](./old-problems/0260/c/solution.c) [C++](./old-problems/0260/solution.cpp) |
| [263. Ugly Number](https://leetcode.com/problems/ugly-number/) | Easy | [C](./old-problems/0263/c/solution.c) [C++](./old-problems/0263/solution.cpp) |
| [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | Medium | [C](./old-problems/0264/c/solution.c) [C++](./old-problems/0264/solution.cpp) |
| [268. Missing Number](https://leetcode.com/problems/missing-number/) | Easy | [C](./old-problems/0268/c/solution.c) [C++](./old-problems/0268/solution.cpp) |
| [273. Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [C](./old-problems/0273/c/solution.c) [C++](./old-problems/0273/solution.cpp) |
| [274. H-Index](https://leetcode.com/problems/h-index/) | Medium | [C](./old-problems/0274/c/solution.c) [C++](./old-problems/0274/solution.cpp) |
| [275. H-Index II](https://leetcode.com/problems/h-index-ii/) | Medium | [C](./old-problems/0275/c/solution.c) [C++](./old-problems/0275/solution.cpp) |
| [278. First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [C++](./old-problems/0278/solution.cpp) |
| [279. Perfect Squares](https://leetcode.com/problems/perfect-squares/) | Medium | [C](./old-problems/0279/c/solution.c) [C++](./old-problems/0279/solution.cpp) |
| [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [C++](./old-problems/0283/solution.cpp) |
| [284. Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | Medium | [C++](./old-problems/0284/solution.cpp) |
| [287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | [C](./old-problems/0287/c/solution.c) [C++](./old-problems/0287/solution.cpp) |
| [289. Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [C++](./old-problems/0289/solution.cpp) |
| [290. Word Pattern](https://leetcode.com/problems/word-pattern/) | Easy | [C++](./old-problems/0290/solution.cpp) |
| [292. Nim Game](https://leetcode.com/problems/nim-game/) | Easy | [C](./old-problems/0292/c/solution.c) [C++](./old-problems/0292/solution.cpp) |
| [295. Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [C++](./old-problems/0295/solution.cpp) |
| [297. Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [C++](./old-problems/0297/solution.cpp) |
| [299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) | Medium | [C](./old-problems/0299/c/solution.c) [C++](./old-problems/0299/solution.cpp) |
| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium | [C](./old-problems/0300/c/solution.c) [C++](./old-problems/0300/solution.cpp) |
| [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | Easy | [C++](./old-problems/0303/solution.cpp) |
| [310. Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | Medium | [C](./old-problems/0310/c/solution.c) [C++](./old-problems/0310/solution.cpp) |
| [313. Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) | Medium | [C](./old-problems/0313/c/solution.c) [C++](./old-problems/0313/solution.cpp) |
| [316. Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | Medium | [C++](./problems/0316/solution.cpp) |
| [319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) | Medium | [C](./old-problems/0319/c/solution.c) [C++](./old-problems/0319/solution.cpp) |
| [322. Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [C](./old-problems/0322/c/solution.c) [C++](./old-problems/0322/solution.cpp) |
| [326. Power of Three](https://leetcode.com/problems/power-of-three/) | Easy | [C](./old-problems/0326/c/solution.c) [C++](./old-problems/0326/solution.cpp) |
| [330. Patching Array](https://leetcode.com/problems/patching-array/) | Hard | [C](./old-problems/0330/c/solution.c) [C++](./old-problems/0330/solution.cpp) |
| [334. Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | Medium | [C](./old-problems/0334/c/solution.c) [C++](./old-problems/0334/solution.cpp) |
| [338. Counting Bits](https://leetcode.com/problems/counting-bits/) | Easy | [C](./old-problems/0338/c/solution.c) [C++](./old-problems/0338/solution.cpp) |
| [342. Power of Four](https://leetcode.com/problems/power-of-four) | Easy | [C](./old-problems/0342/c/solution.c) [C++](./old-problems/0342/solution.cpp) |
| [343. Integer Break](https://leetcode.com/problems/integer-break) | Medium | [C++](./problems/0343/solution.cpp) |
| [344. Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [C++](./old-problems/0344/solution.cpp) |
| [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | Easy | [C](./old-problems/0345/c/solution.c) [C++](./old-problems/0345/solution.cpp) |
| [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [C++](./problems/0347/solution.cpp) |
| [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | [C](./old-problems/0349/c/solution.c) [C++](./old-problems/0349/solution.cpp) |
| [350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [C](./old-problems/0350/c/solution.c) [C++](./old-problems/0350/solution.cpp) |
| [355. Design Twitter](https://leetcode.com/problems/design-twitter/) | Medium | [C++](./old-problems/0355/solution.cpp) |
| [357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) | Medium | [C](./old-problems/0357/c/solution.c) [C++](./old-problems/0357/solution.cpp) |
| [367. Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | Easy | [C](./old-problems/0367/c/solution.c) [C++](./old-problems/0367/solution.cpp) |
| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | Medium | [C](./old-problems/0368/c/solution.c) [C++](./old-problems/0368/solution.cpp) |
| [373. Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | Medium | [C](./old-problems/0373/c/solution.c) [C++](./old-problems/0373/solution.cpp) |
| [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | Medium | [C++](./old-problems/0374/solution.cpp) |
| [380. Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [C++](./old-problems/0380/solution.cpp) |
| [383. Ransom Note](https://leetcode.com/problems/ransom-note/) | Easy | [C](./old-problems/0383/c/solution.c) [C++](./old-problems/0383/solution.cpp) |
| [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | Medium | [C](./old-problems/0386/c/solution.c) [C++](./old-problems/0386/solution.cpp) |
| [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | Easy | [C](./old-problems/0387/c/solution.c) [C++](./old-problems/0387/solution.cpp) |
| [389. Find the Difference](https://leetcode.com/problems/find-the-difference) | Easy | [C++](./problems/0389/solution.cpp) |
| [392. Is Subsequence](https://leetcode.com/problems/is-subsequence) | Easy | [C++](./problems/0392/solution.cpp) |
| [396. Rotate Function](https://leetcode.com/problems/rotate-function/) | Medium | [C](./old-problems/0396/c/solution.c) [C++](./old-problems/0396/solution.cpp) |
| [402. Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | Medium | [C](./old-problems/0402/c/solution.c) [C++](./old-problems/0402/solution.cpp) |
| [404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | Easy | [C++](./old-problems/0404/solution.cpp) |
| [405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | Easy | [C](./old-problems/0405/c/solution.c) [C++](./old-problems/0405/solution.cpp) |
| [407. Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/) | Hard | [C](./old-problems/0407/c/solution.c) [C++](./old-problems/0407/solution.cpp) |
| [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | Easy | [C](./old-problems/0409/c/solution.c) [C++](./old-problems/0409/solution.cpp) |
| [412. Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | Easy | [C](./old-problems/0412/c/solution.c) [C++](./old-problems/0412/solution.cpp) |
| [413. Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | Medium | [C](./old-problems/0413/c/solution.c) [C++](./old-problems/0413/solution.cpp) |
| [414. Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | Easy | [C](./old-problems/0414/c/solution.c) [C++](./old-problems/0414/solution.cpp) |
| [415. Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [C](./old-problems/0415/c/solution.c) [C++](./old-problems/0415/solution.cpp) |
| [416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | Medium | [C](./old-problems/0416/c/solution.c) [C++](./old-problems/0416/solution.cpp) |
| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | Medium | [C](./old-problems/0417/c/solution.c) [C++](./old-problems/0417/solution.cpp) |
| [419. Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | [C](./old-problems/0419/c/solution.c) [C++](./old-problems/0419/solution.cpp) |
| [432. All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/) | Hard | [C++](./old-problems/0432/solution.cpp) |
| [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | Easy | [C](./old-problems/0434/c/solution.c) [C++](./old-problems/0434/solution.cpp) |
| [440. K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | Hard | [C](./old-problems/0440/c/solution.c) [C++](./old-problems/0440/solution.cpp) |
| [441. Arranging Coins](https://leetcode.com/problems/arranging-coins/) | Easy | [C](./old-problems/0441/c/solution.c) [C++](./old-problems/0441/solution.cpp) |
| [442. Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | Medium | [C](./old-problems/0442/c/solution.c) [C++](./old-problems/0442/solution.cpp) |
| [446. Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | Hard | [C++](./problems/0446/solution.cpp) |
| [448. Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | Easy | [C](./old-problems/0448/c/solution.c) [C++](./old-problems/0448/solution.cpp) |
| [451. Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | Medium | [C](./old-problems/0451/c/solution.c) [C++](./old-problems/0451/solution.cpp) |
| [452. Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | Medium | [C](./old-problems/0452/c/solution.c) [C++](./old-problems/0452/solution.cpp) |
| [454. 4Sum II](https://leetcode.com/problems/4sum-ii/) | Medium | [C++](./problems/0454/solution.cpp) |
| [455. Assign Cookies](https://leetcode.com/problems/assign-cookies) | Easy | [C](./old-problems/0455/c/solution.c) [C++](./old-problems/0455/solution.cpp) |
| [456. 132 Pattern](https://leetcode.com/problems/132-pattern) | Medium | [C](./old-problems/0456/c/solution.c) [C++](./old-problems/0456/solution.cpp) |
| [458. Poor Pigs](https://leetcode.com/problems/poor-pigs) | Hard | [C](./old-problems/0458/c/solution.c) [C++](./old-problems/0458/solution.cpp) |
| [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | Easy | [C](./old-problems/0459/c/solution.c) [C++](./old-problems/0459/solution.cpp) |
| [461. Hamming Distance](https://leetcode.com/problems/hamming-distance/) | Easy | [C](./old-problems/0461/c/solution.c) [C++](./old-problems/0461/solution.cpp) |
| [462. Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | Medium | [C](./old-problems/0462/c/solution.c) [C++](./old-problems/0462/solution.cpp) |
| [463. Island Perimeter](https://leetcode.com/problems/island-perimeter/) | Easy | [C](./old-problems/0463/c/solution.c) [C++](./old-problems/0463/solution.cpp) |
| [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | Medium | [C](./old-problems/0474/c/solution.c) [C++](./old-problems/0474/solution.cpp) |
| [476. Number Complement](https://leetcode.com/problems/number-complement/description/) | Easy | [C](./old-problems/0476/c/solution.c) [C++](./old-problems/0476/solution.cpp) |
| [485. Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | Easy | [C++](./old-problems/0485/solution.cpp) |
| [494. Target Sum](https://leetcode.com/problems/target-sum/) | Medium | [C](./old-problems/0494/c/solution.c) [C++](./old-problems/0494/solution.cpp) |
| [495. Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | Medium | [C](./old-problems/0495/c/solution.c) [C++](./old-problems/0495/solution.cpp) |
| [496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | Easy | [C](./old-problems/0496/c/solution.c) [C++](./old-problems/0496/solution.cpp) |
| [498. Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/) | Medium | [C](./old-problems/0498/c/solution.c) [C++](./old-problems/0498/solution.cpp) |
| [500. Keyboard Row](https://leetcode.com/problems/keyboard-row/) | Easy | [C](./old-problems/0500/c/solution.c) [C++](./old-problems/0500/solution.cpp) |
| [502. IPO](https://leetcode.com/problems/ipo/) | Hard | [C](./old-problems/0502/c/solution.c) [C++](./old-problems/0502/solution.cpp) |
| [504. Base 7](https://leetcode.com/problems/base-7/) | Easy | [C](./old-problems/0504/c/solution.c) [C++](./old-problems/0504/solution.cpp) |
| [506. Relative Ranks](https://leetcode.com/problems/relative-ranks/) | Easy | [C](./old-problems/0506/c/solution.c) [C++](./old-problems/0506/solution.cpp) |
| [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | Easy | [C](./old-problems/0509/c/solution.c) [C++](./old-problems/0509/solution.cpp) |
| [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | Medium | [C++](./old-problems/0513/solution.cpp) |
| [514. Freedom Trail](https://leetcode.com/problems/freedom-trail/) | Hard | [C](./old-problems/0514/c/solution.c) [C++](./old-problems/0514/solution.cpp) |
| [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) | Medium | [C++](./old-problems/0515/solution.cpp) |
| [520. Detect Capital](https://leetcode.com/problems/detect-capital/) | Easy | [C](./old-problems/0520/c/solution.c) [C++](./old-problems/0520/solution.cpp) |
| [523. Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/) | Medium | [C](./old-problems/0523/c/solution.c) [C++](./old-problems/0523/solution.cpp) |
| [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/) | Medium | [C++](./problems/0525/solution.cpp) |
| [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) | Medium | [C++](./old-problems/0535/solution.cpp) |
| [539. Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/) | Medium | [C](./old-problems/0539/c/solution.c) [C++](./old-problems/0539/solution.cpp) |
| [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/) | Easy | [C](./old-problems/0541/c/solution.c) [C++](./old-problems/0541/solution.cpp) |
| [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | Easy | [C++](./old-problems/0543/solution.cpp) |
| [546. Remove Boxes](https://leetcode.com/problems/remove-boxes/) | Hard | [C](./old-problems/0546/c/solution.c) [C++](./old-problems/0546/solution.cpp) |
| [547. Number of Provinces](https://leetcode.com/problems/number-of-provinces/) | Medium | [C](./old-problems/0547/c/solution.c) [C++](./old-problems/0547/solution.cpp) |
| [552. Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/) | Hard | [C](./old-problems/0552/c/solution.c) [C++](./old-problems/0552/solution.cpp) |
| [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [C](./old-problems/0557/c/solution.c) [C++](./old-problems/0557/solution.cpp) |
| [561. Array Partition](https://leetcode.com/problems/array-partition/) | Easy | [C](./old-problems/0561/c/solution.c) [C++](./old-problems/0561/solution.cpp) |
| [566. Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/) | Easy | [C](./old-problems/0566/c/solution.c) [C++](./old-problems/0566/solution.cpp) |
| [567. Permutation in String](https://leetcode.com/problems/permutation-in-string/) | Medium | [C](./old-problems/0567/c/solution.c) [C++](./old-problems/0567/solution.cpp) |
| [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | Medium | [C++](./problems/0576/solution.cpp) |
| [587. Erect the Fence](https://leetcode.com/problems/erect-the-fence/) | Hard | [C++](./old-problems/0587/solution.cpp) |
| [590. N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) | Easy | [C++](./old-problems/0590/solution.cpp) |
| [592. Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/) | Medium | [C](./old-problems/0592/c/solution.c) [C++](./old-problems/0592/solution.cpp) |
| [594. Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | Easy | [C](./old-problems/0594/c/solution.c) [C++](./old-problems/0594/solution.cpp) |
| [598. Range Addition II](https://leetcode.com/problems/range-addition-ii/) | Easy | [C](./old-problems/0598/c/solution.c) [C++](./old-problems/0598/solution.cpp) |
| [605. Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | Easy | [C](./old-problems/0605/c/solution.c) [C++](./old-problems/0605/solution.cpp) |
| [606. Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | Easy | [C++](./old-problems/0606/solution.cpp) |
| [611. Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) | Medium | [C](./old-problems/0611/c/solution.c) [C++](./old-problems/0611/solution.cpp) |
| [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | [C++](./old-problems/0617/solution.cpp) |
| [621. Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [C](./old-problems/0621/c/solution.c) [C++](./old-problems/0621/solution.cpp) |
| [623. Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | Medium | [C++](./old-problems/0623/solution.cpp) |
| [624. Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/) | Medium | [C](./old-problems/0624/c/solution.c) [C++](./old-problems/0624/solution.cpp) |
| [628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | Easy | [C](./old-problems/0628/c/solution.c) [C++](./old-problems/0628/solution.cpp) |
| [632. Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/) | Hard | [C++](./old-problems/0632/solution.cpp) |
| [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/) | Medium | [C](./old-problems/0633/c/solution.c) [C++](./old-problems/0633/solution.cpp) |
| [637. Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | Easy | [C++](./old-problems/0637/solution.cpp) |
| [640. Solve the Equation](https://leetcode.com/problems/solve-the-equation/) | Medium | [C](./old-problems/0640/c/solution.c) [C++](./old-problems/0640/solution.cpp) |
| [641. Design Circular Deque](https://leetcode.com/problems/design-circular-deque/) | Medium | [C++](./old-problems/0641/solution.cpp) |
| [645. Set Mismatch](https://leetcode.com/problems/set-mismatch/) | Easy | [C](./old-problems/0645/c/solution.c) [C++](./old-problems/0645/solution.cpp) |
| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [C](./old-problems/0647/c/solution.c) [C++](./old-problems/0647/solution.cpp) |
| [648. Replace Words](https://leetcode.com/problems/replace-words/) | Medium | [C++](./old-problems/0648/solution.cpp) |
| [650. 2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | Medium | [C](./old-problems/0650/c/solution.c) [C++](./old-problems/0650/solution.cpp) |
| [654. Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) | Medium | [C++](./old-problems/0654/solution.cpp) |
| [655. Print Binary Tree](https://leetcode.com/problems/print-binary-tree/) | Medium | [C++](./old-problems/0655/solution.cpp) |
| [657. Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin/) | Easy | [C](./old-problems/0657/c/solution.c) [C++](./old-problems/0657/solution.cpp) |
| [661. Image Smoother](https://leetcode.com/problems/image-smoother/) | Easy | [C++](./problems/0661/solution.cpp) |
| [664. Strange Printer](https://leetcode.com/problems/strange-printer/) | Hard | [C](./old-problems/0664/c/solution.c) [C++](./old-problems/0664/solution.cpp) |
| [670. Maximum Swap](https://leetcode.com/problems/maximum-swap/) | Medium | [C](./old-problems/0670/c/solution.c) [C++](./old-problems/0670/solution.cpp) |
| [678. Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/) | Medium | [C](./old-problems/0678/c/solution.c) [C++](./old-problems/0678/solution.cpp) |
| [679. 24 Game](https://leetcode.com/problems/24-game/) | Hard | [C](./old-problems/0679/c/solution.c) [C++](./old-problems/0679/solution.cpp) |
| [680. Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | Easy | [C](./old-problems/0680/c/solution.c) [C++](./old-problems/0680/solution.cpp) |
| [682. Baseball Game](https://leetcode.com/problems/baseball-game/) | Easy | [C](./old-problems/0682/c/solution.c) [C++](./old-problems/0682/solution.cpp) |
| [684. Redundant Connection](https://leetcode.com/problems/redundant-connection/) | Medium | [C](./old-problems/0684/c/solution.c) [C++](./old-problems/0684/solution.cpp) |
| [689. Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/) | Hard | [C](./old-problems/0689/c/solution.c) [C++](./old-problems/0689/solution.cpp) |
| [695. Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [C](./old-problems/0695/c/solution.c) [C++](./old-problems/0695/solution.cpp) |
| [696. Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/) | Easy | [C](./old-problems/0696/c/solution.c) [C++](./old-problems/0696/solution.cpp) |
| [700. Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | Easy | [C++](./old-problems/0700/solution.cpp) |
| [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | Easy | [C++](./old-problems/0703/solution.cpp) |
| [709. To Lower Case](https://leetcode.com/problems/to-lower-case/) | Easy | [C](./old-problems/0709/c/solution.c) [C++](./old-problems/0709/solution.cpp) |
| [713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/) | Medium | [C](./old-problems/0713/c/solution.c) [C++](./old-problems/0713/solution.cpp) |
| [717. 1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) | Easy | [C](./old-problems/0717/c/solution.c) [C++](./old-problems/0717/solution.cpp) |
| [719. Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/description/) | Hard | [C](./old-problems/0719/c/solution.c) [C++](./old-problems/0719/solution.cpp) |
| [725. Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/) | Medium | [C++](./old-problems/0725/solution.cpp) |
| [726. Number of Atoms](https://leetcode.com/problems/number-of-atoms/) | Hard | [C++](./problems/0726/solution.cpp) |
| [728. Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | Easy | [C](./old-problems/0728/c/solution.c) [C++](./old-problems/0728/solution.cpp) |
| [729. My Calendar I](https://leetcode.com/problems/my-calendar-i/) | Medium | [C++](./old-problems/0729/solution.cpp) |
| [731. My Calendar II](https://leetcode.com/problems/my-calendar-ii/) | Medium | [C++](./old-problems/0731/solution.cpp) |
| [739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [C](./old-problems/0739/c/solution.c) [C++](./old-problems/0739/solution.cpp) |
| [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | Easy | [C++](./problems/0746/solution.cpp) |
| [752. Open the Lock](https://leetcode.com/problems/open-the-lock/) | Medium | [C](./old-problems/0752/c/solution.c) [C++](./old-problems/0752/solution.cpp) |
| [757. Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/) | Hard | [C](./old-problems/0757/c/solution.c) [C++](./old-problems/0757/solution.cpp) |
| [763. Partition Labels](https://leetcode.com/problems/partition-labels/) | Medium | [C](./old-problems/0763/c/solution.c) [C++](./old-problems/0763/solution.cpp) |
| [769. Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/) | Medium | [C++](./old-problems/0769/solution.cpp) |
| [771. Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | Easy | [C](./old-problems/0771/c/solution.c) [C++](./old-problems/0771/solution.cpp) |
| [773. Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle/) | Hard | [C++](./problems/0773/solution.cpp) |
| [778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | Hard | [C](./old-problems/0778/c/solution.c) [C++](./old-problems/0778/solution.cpp) |
| [779. K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | Medium | [C](./old-problems/0779/c/solution.c) [C++](./old-problems/0779/solution.cpp) |
| [781. Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/) | Medium | [C](./old-problems/0781/c/solution.c) [C++](./old-problems/0781/solution.cpp) |
| [784. Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | Medium | [C](./old-problems/0784/c/solution.c) [C++](./old-problems/0784/solution.cpp) |
| [786. K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction/) | Medium | [C](./old-problems/0786/c/solution.c) [C++](./old-problems/0786/solution.cpp) |
| [787. Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | Medium | [C](./old-problems/0787/c/solution.c) [C++](./old-problems/0787/solution.cpp) |
| [790. Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/) | Medium | [C](./old-problems/0790/c/solution.c) [C++](./old-problems/0790/solution.cpp) |
| [791. Custom Sort String](https://leetcode.com/problems/custom-sort-string/) | Medium | [C](./old-problems/0791/c/solution.c) [C++](./old-problems/0791/solution.cpp) |
| [796. Rotate String](https://leetcode.com/problems/rotate-string/) | Easy | [C](./old-problems/0796/c/solution.c) [C++](./old-problems/0796/solution.cpp) |
| [797. All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | Medium | [C](./old-problems/0797/c/solution.c) [C++](./old-problems/0797/solution.cpp) |
| [802. Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | Medium | [C](./old-problems/0802/c/solution.c) [C++](./old-problems/0802/solution.cpp) |
| [804. Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | Easy | [C++](./problems/0804/solution.cpp) |
| [807. Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/) | Medium | [C](./old-problems/0807/c/solution.c) [C++](./old-problems/0807/solution.cpp) |
| [811. Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Medium | [C++](./old-problems/0811/solution.cpp) |
| [812. Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/) | Easy | [C](./old-problems/0812/c/solution.c) [C++](./old-problems/0812/solution.cpp) |
| [815. Bus Routes](https://leetcode.com/problems/bus-routes) | Hard | [C++](./problems/0815/solution.cpp) |
| [821. Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | Easy | [C++](./old-problems/0821/solution.cpp) |
| [823. Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | Medium | [C++](./problems/0823/solution.cpp) |
| [826. Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work/) | Medium | [C](./old-problems/0826/c/solution.c) [C++](./old-problems/0826/solution.cpp) |
| [827. Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | Hard | [C++](./old-problems/0827/solution.cpp) |
| [832. Flipping an Image](https://leetcode.com/problems/flipping-an-image/) | Easy | [C++](./old-problems/0832/solution.cpp) |
| [834. Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/) | Hard | [C](./old-problems/0834/c/solution.c) [C++](./old-problems/0834/solution.cpp) |
| [838. Push Dominoes](https://leetcode.com/problems/push-dominoes/) | Medium | [C](./old-problems/0838/c/solution.c) [C++](./old-problems/0838/solution.cpp) |
| [840. Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/) | Medium | [C](./old-problems/0840/c/solution.c) [C++](./old-problems/0840/solution.cpp) |
| [844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | Easy | [C++](./problems/0844/solution.cpp) |
| [846. Hand of Straights](https://leetcode.com/problems/hand-of-straights/) | medium | [C](./old-problems/0846/c/solution.c) [C++](./old-problems/0846/solution.cpp) |
| [857. Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | Hard | [C++](./old-problems/0857/solution.cpp) |
| [859. Buddy Strings](https://leetcode.com/problems/buddy-strings/description/) | Easy | [C](./old-problems/0859/c/solution.c) [C++](./old-problems/0859/solution.cpp) |
| [860. Lemonade Change](https://leetcode.com/problems/lemonade-change/) | Easy | [C](./old-problems/0860/c/solution.c) [C++](./old-problems/0860/solution.cpp) |
| [861. Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/) | Medium | [C](./old-problems/0861/c/solution.c) [C++](./old-problems/0861/solution.cpp) |
| [865. Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | Medium | [C++](./old-problems/0865/solution.cpp) |
| [867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix/) | Easy | [C](./old-problems/0867/c/solution.c) [C++](./old-problems/0867/solution.cpp) |
| [869. Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2/) | Medium | [C](./old-problems/0869/c/solution.c) [C++](./old-problems/0869/solution.cpp) |
| [872. Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/) | Easy | [C++](./old-problems/0872/solution.cpp) |
| [873. Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/) | Medium | [C](./old-problems/0873/c/solution.c) [C++](./old-problems/0873/solution.cpp) |
| [874. Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/) | Medium | [C++](./problems/0874/solution.cpp) |
| [875. Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | Medium | [C](./old-problems/0875/c/solution.c) [C++](./old-problems/0875/solution.cpp) |
| [876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | Easy | [C++](./old-problems/0876/solution.cpp) |
| [877. Stone Game](https://leetcode.com/problems/stone-game/) | Medium | [C](./old-problems/0877/c/solution.c) [C++](./old-problems/0877/solution.cpp) |
| [880. Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | Medium | [C++](./old-problems/0880/solution.cpp) |
| [881. Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [C](./old-problems/0881/c/solution.c) [C++](./old-problems/0881/solution.cpp) |
| [883. Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/) | Easy | [C](./old-problems/0883/c/solution.c) [C++](./old-problems/0883/solution.cpp) |
| [884. Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | Easy | [C++](./old-problems/0884/solution.cpp) |
| [885. Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/) | Medium | [C](./old-problems/0885/c/solution.c) [C++](./old-problems/0885/solution.cpp) |
| [888. Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/) | Easy | [C](./old-problems/0888/c/solution.c) [C++](./old-problems/0888/solution.cpp) |
| [889. Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | Medium | [C++](./old-problems/0889/solution.cpp) |
| [890. Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/) | Medium | [C](./old-problems/0890/c/solution.c) [C++](./old-problems/0890/solution.cpp) |
| [892. Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/) | Easy | [C++](./old-problems/0892/solution.cpp) |
| [893. Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/) | Medium | [C](./old-problems/0893/c/solution.c) [C++](./old-problems/0893/solution.cpp) |
| [894. All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/) | Medium | [C++](./old-problems/0894/solution.cpp) |
| [897. Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/) | Easy | [C++](./old-problems/0897/solution.cpp) |
| [898. Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/description/) | Medium | [C++](./old-problems/0898/solution.cpp) |
| [904. Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) | Medium | [C](./old-problems/0904/c/solution.c) [C++](./old-problems/0904/solution.cpp) |
| [905. Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | Easy | [C++](./problems/0905/solution.cpp) |
| [907. Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) | Medium | [C](./old-problems/0907/c/solution.c) [C++](./old-problems/0907/solution.cpp) |
| [908. Smallest Range I](https://leetcode.com/problems/smallest-range-i/) | Easy | [C](./old-problems/0908/c/solution.c) [C++](./old-problems/0908/solution.cpp) |
| [909. Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/) | Medium | [C](./old-problems/0909/c/solution.c) [C++](./old-problems/0909/solution.cpp) |
| [911. Online Election](https://leetcode.com/problems/online-election/) | Medium | [C++](./old-problems/0911/solution.cpp) |
| [912. Sort an Array](https://leetcode.com/problems/sort-an-array/) | Medium | [C](./old-problems/0912/c/solution.c) [C++](./old-problems/0912/solution.cpp) |
| [914. X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/) | Easy | [C](./old-problems/0914/c/solution.c) [C++](./old-problems/0914/solution.cpp) |
| [916. Word Subsets](https://leetcode.com/problems/word-subsets/) | Medium | [C](./old-problems/0916/c/solution.c) [C++](./old-problems/0916/solution.cpp) |
| [921. Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | Medium | [C](./old-problems/0921/c/solution.c) [C++](./old-problems/0921/solution.cpp) |
| [925. Long Pressed Name](https://leetcode.com/problems/long-pressed-name/) | Easy | [C](./old-problems/0925/c/solution.c) [C++](./old-problems/0925/solution.cpp) |
| [929. Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | Easy | [C](./old-problems/0929/c/solution.c) [C++](./old-problems/0929/solution.cpp) |
| [930. Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum/) | Medium | [C](./old-problems/0930/c/solution.c) [C++](./old-problems/0930/solution.cpp) |
| [931. Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | Medium | [C++](./problems/0931/solution.cpp) |
| [933. Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | Easy | [C++](./old-problems/0933/solution.cpp) |
| [934. Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) | Medium | [C](./old-problems/0934/c/solution.c) [C++](./old-problems/0934/solution.cpp) |
| [935. Knight Dialer](https://leetcode.com/problems/knight-dialer/) | Easy | [C](./old-problems/0935/c/solution.c) [C++](./old-problems/0935/solution.cpp) |
| [938. Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | Easy | [C++](./old-problems/0938/solution.cpp) |
| [942. DI String Match](https://leetcode.com/problems/di-string-match/) | Easy | [C](./old-problems/0942/c/solution.c) [C++](./old-problems/0942/solution.cpp) |
| [944. Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/) | Easy | [C](./old-problems/0944/c/solution.c) [C++](./old-problems/0944/solution.cpp) |
| [945. Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique/) | Medium | [C](./old-problems/0945/c/solution.c) [C++](./old-problems/0945/solution.cpp) |
| [947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | Medium | [C++](./old-problems/0947/solution.cpp) |
| [948. Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/) | Medium | [C](./old-problems/0948/c/solution.c) [C++](./old-problems/0948/solution.cpp) |
| [950. Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/) | Medium | [C++](./old-problems/0950/solution.cpp) |
| [951. Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | Medium | [C++](./old-problems/0951/solution.cpp) |
| [959. Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/) | Medium | [C](./old-problems/0959/c/solution.c) [C++](./old-problems/0959/solution.cpp) |
| [961. N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | Easy | [C](./old-problems/0961/c/solution.c) [C++](./old-problems/0961/solution.cpp) |
| [962. Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/) | Medium | [C](./old-problems/0962/c/solution.c) [C++](./old-problems/0962/solution.cpp) |
| [965. Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/) | Easy | [C++](./old-problems/0965/solution.cpp) |
| [966. Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | Medium | [C++](./old-problems/0966/solution.cpp) |
| [974. Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [C](./old-problems/0974/c/solution.c) [C++](./old-problems/0974/solution.cpp) |
| [976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | Easy | [C](./old-problems/0976/c/solution.c) [C++](./old-problems/0976/solution.cpp) |
| [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | Easy | [C](./old-problems/0977/c/solution.c) [C++](./old-problems/0977/solution.cpp) |
| [979. Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | Medium | [C++](./old-problems/0979/solution.cpp) |
| [980. Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | Hard | [C](./old-problems/0980/c/solution.c) [C++](./old-problems/0980/solution.cpp) |
| [983. Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | Medium | [C](./old-problems/0983/c/solution.c) [C++](./old-problems/0983/solution.cpp) |
| [988. Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | Medium | [C++](./old-problems/0988/solution.cpp) |
| [991. Broken Calculator](https://leetcode.com/problems/broken-calculator/) | Medium | [C](./old-problems/0991/c/solution.c) [C++](./old-problems/0991/solution.cpp) |
| [992. Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers/) | Hard | [C++](./problems/0992/solution.cpp) |
| [995. Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) | Hard | [C](./old-problems/0995/c/solution.c) [C++](./old-problems/0995/solution.cpp) |
| [997. Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | Easy | [C](./old-problems/0997/c/solution.c) [C++](./old-problems/0997/solution.cpp) |
| [1002. Find Common Characters](https://leetcode.com/problems/find-common-characters/) | Easy | [C](./old-problems/1002/c/solution.c) [C++](./old-problems/1002/solution.cpp) |
| [1006. Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/) | Medium | [C](./old-problems/1006/c/solution.c) [C++](./old-problems/1006/solution.cpp) |
| [1007. Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | Medium | [C](./old-problems/1007/c/solution.c) [C++](./old-problems/1007/solution.cpp) |
| [1008. Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | Medium | [C++](./old-problems/1008/solution.cpp) |
| [1009. Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) | Easy | [C](./old-problems/1009/c/solution.c) [C++](./old-problems/1009/solution.cpp) |
| [1011. Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) | Medium | [C](./old-problems/1011/c/solution.c) [C++](./old-problems/1011/solution.cpp) |
| [1014. Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/) | Medium | [C](./old-problems/1014/c/solution.c) [C++](./old-problems/1014/solution.cpp) |
| [1015. Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/) | Medium | [C](./old-problems/1015/c/solution.c) [C++](./old-problems/1015/solution.cpp) |
| [1018. Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) | Easy | [C](./old-problems/1018/c/solution.c) [C++](./old-problems/1018/solution.cpp) |
| [1021. Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/) | Easy | [C](./old-problems/1021/c/solution.c) [C++](./old-problems/1021/solution.cpp) |
| [1022. Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | Easy | [C++](./old-problems/1022/solution.cpp) |
| [1025. Divisor Game](https://leetcode.com/problems/divisor-game/) | Easy | [C](./old-problems/1025/c/solution.c) [C++](./old-problems/1025/solution.cpp) |
| [1026. Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | Medium | [C++](./old-problems/1026/solution.cpp) |
| [1028. Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/description) | Hard | [C++](./old-problems/1028/solution.cpp) |
| [1038. Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | Medium | [C++](./old-problems/1038/solution.cpp) |
| [1039. Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/) | Medium | [C](./old-problems/1039/c/solution.c) [C++](./old-problems/1039/solution.cpp) |
| [1043. Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/) | Medium | [C](./old-problems/1043/c/solution.c) [C++](./old-problems/1043/solution.cpp) |
| [1046. Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [C](./old-problems/1046/c/solution.c) [C++](./old-problems/1046/solution.cpp) |
| [1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | Medium | [C](./old-problems/1047/c/solution.c) [C++](./old-problems/1047/solution.cpp) |
| [1048. Longest String Chain](https://leetcode.com/problems/longest-string-chain) | Medium | [C++](./problems/1048/solution.cpp) |
| [1051. Height Checker](https://leetcode.com/problems/height-checker/) | Easy | [C](./old-problems/1051/c/solution.c) [C++](./old-problems/1051/solution.cpp) |
| [1052. Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/) | Medium | [C](./old-problems/1052/c/solution.c) [C++](./old-problems/1052/solution.cpp) |
| [1061. Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/) | Medium | [C](./old-problems/1061/c/solution.c) [C++](./old-problems/1061/solution.cpp) |
| [1071. Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | Easy | [C](./old-problems/1071/c/solution.c) [C++](./old-problems/1071/solution.cpp) |
| [1072. Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/) | Medium | [C++](./problems/1072/solution.cpp) |
| [1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/) | Hard | [C](./old-problems/1074/c/solution.c) [C++](./old-problems/1074/solution.cpp) |
| [1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/) | Medium | [C](./old-problems/1079/c/solution.c) [C++](./old-problems/1079/solution.cpp) |
| [1080. Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/) | Medium | [C++](./old-problems/1080/solution.cpp) |
| [1081. Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters) | Medium | [C++](./problems/1081/solution.cpp) |
| [1090. Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/) | Medium | [C](./old-problems/1090/c/solution.c) [C++](./old-problems/1090/solution.cpp) |
| [1092. Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence/) | Hard | [C](./old-problems/1092/c/solution.c) [C++](./old-problems/1092/solution.cpp) |
| [1103. Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | Easy | [C](./old-problems/1103/c/solution.c) [C++](./old-problems/1103/solution.cpp) |
| [1104. Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/) | Medium | [C](./old-problems/1104/c/solution.c) [C++](./old-problems/1104/solution.cpp) |
| [1105. Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) | Medium | [C](./old-problems/1105/c/solution.c) [C++](./old-problems/1105/solution.cpp) |
| [1106. Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression/) | Hard | [C](./old-problems/1106/c/solution.c) [C++](./old-problems/1106/solution.cpp) |
| [1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/) | Easy | [C](./old-problems/1108/c/solution.c) [C++](./old-problems/1108/solution.cpp) |
| [1109. Corporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings/) | Medium | [C](./old-problems/1109/c/solution.c) [C++](./old-problems/1109/solution.cpp) |
| [1110. Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/description) | Medium | [C++](./old-problems/1110/solution.cpp) |
| [1122. Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) | Easy | [C](./old-problems/1122/c/solution.c) [C++](./old-problems/1122/solution.cpp) |
| [1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | Medium | [C++](./old-problems/1123/solution.cpp) |
| [1128. Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/) | Easy | [C](./old-problems/1128/c/solution.c) [C++](./old-problems/1128/solution.cpp) |
| [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | [C](./old-problems/1137/c/solution.c) [C++](./old-problems/1137/solution.cpp) |
| [1140. Stone Game II](https://leetcode.com/problems/stone-game-ii/) | Medium | [C](./old-problems/1140/c/solution.c) [C++](./old-problems/1140/solution.cpp) |
| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [C](./old-problems/1143/c/solution.c) [C++](./old-problems/1143/solution.cpp) |
| [1155. Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) | Medium | [C](./old-problems/1155/c/solution.c) [C++](./old-problems/1155/solution.cpp) |
| [1160. Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | Easy | [C](./old-problems/1160/c/solution.c) [C++](./old-problems/1160/solution.cpp) |
| [1170. Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/) | Medium | [C++](./old-problems/1170/solution.cpp) |
| [1175. Prime Arrangements](https://leetcode.com/problems/prime-arrangements/) | Easy | [C](./old-problems/1175/c/solution.c) [C++](./old-problems/1175/solution.cpp) |
| [1184. Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/) | Easy | [C](./old-problems/1184/c/solution.c) [C++](./old-problems/1184/solution.cpp) |
| [1190. Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/) | Medium | [C](./old-problems/1190/c/solution.c) [C++](./old-problems/1190/solution.cpp) |
| [1195. Fizz Buzz Multithreaded](https://leetcode.com/problems/fizz-buzz-multithreaded/) | Medium | [C++](./old-problems/1195/solution.cpp) |
| [1207. Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | Easy | [C++](./problems/1207/solution.cpp) |
| [1208. Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/) | Medium | [C](./old-problems/1208/c/solution.c) [C++](./old-problems/1208/solution.cpp) |
| [1209. Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [C](./old-problems/1209/c/solution.c) [C++](./old-problems/1209/solution.cpp) |
| [1210. Minimum Moves to Reach Target with Rotations](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/) | Hard | [C++](./problems/1210/solution.cpp) |
| [1217. Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/) | Easy | [C++](./old-problems/1217/solution.cpp) |
| [1219. Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/) | Medium | [C](./old-problems/1219/c/solution.c) [C++](./old-problems/1219/solution.cpp) |
| [1220. Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation) | Hard | [C](./old-problems/1220/c/solution.c) [C++](./old-problems/1220/solution.cpp) |
| [1221. Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/) | Easy | [C](./old-problems/1221/c/solution.c) [C++](./old-problems/1221/solution.cpp) |
| [1232. Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line) | Easy | [C++](./problems/1232/solution.cpp) |
| [1233. Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) | Medium | [C](./old-problems/1233/c/solution.c) [C++](./old-problems/1233/solution.cpp) |
| [1235. Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) | Hard | [C++](./problems/1235/solution.cpp) |
| [1238. Circular Permutation in Binary Representation](https://leetcode.com/problems/circular-permutation-in-binary-representation/) | Medium | [C](./old-problems/1238/c/solution.c) [C++](./old-problems/1238/solution.cpp) |
| [1239. Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) | Medium | [C](./old-problems/1239/c/solution.c) [C++](./old-problems/1239/solution.cpp) |
| [1247. Minimum Swaps to Make Strings Equal](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/) | Medium | [C](./old-problems/1247/c/solution.c) [C++](./old-problems/1247/solution.cpp) |
| [1248. Count Number of Nice Subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays/) | Medium | [C](./old-problems/1248/c/solution.c) [C++](./old-problems/1248/solution.cpp) |
| [1252. Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/) | Easy | [C](./old-problems/1252/c/solution.c) [C++](./old-problems/1252/solution.cpp) |
| [1253. Reconstruct a 2-Row Binary Matrix](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix/) | Medium | [C](./old-problems/1253/c/solution.c) [C++](./old-problems/1253/solution.cpp) |
| [1255. Maximum Score Words Formed by Letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters/) | Hard | [C](./old-problems/1255/c/solution.c) [C++](./old-problems/1255/solution.cpp) |
| [1261. Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/) | Medium | [C++](./old-problems/1261/solution.cpp) |
| [1262. Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/) | Medium | [C](./old-problems/1262/c/solution.c) [C++](./old-problems/1262/solution.cpp) |
| [1266. Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/) | Easy | [C](./old-problems/1266/c/solution.c) [C++](./old-problems/1266/solution.cpp) |
| [1267. Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/) | Medium | [C](./old-problems/1267/c/solution.c) [C++](./old-problems/1267/solution.cpp) |
| [1269. Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps) | Hard | [C++](./problems/1269/solution.cpp) |
| [1275. Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/) | Easy | [C](./old-problems/1275/c/solution.c) [C++](./old-problems/1275/solution.cpp) |
| [1277. Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | Medium | [C](./old-problems/1277/c/solution.c) [C++](./old-problems/1277/solution.cpp) |
| [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/) | Easy | [C](./old-problems/1281/c/solution.c) [C++](./old-problems/1281/solution.cpp) |
| [1282. Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/) | Medium | [C](./old-problems/1282/c/solution.c) [C++](./old-problems/1282/solution.cpp) |
| [1286. Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/) | Medium | [C++](./old-problems/1286/solution.cpp) |
| [1287. Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/) | Easy | [C](./old-problems/1287/c/solution.c) [C++](./old-problems/1287/solution.cpp) |
| [1289. Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/) | Hard | [C](./old-problems/1289/c/solution.c) [C++](./old-problems/1289/solution.cpp) |
| [1290. Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | Easy | [C++](./old-problems/1290/solution.cpp) |
| [1291. Sequential Digits](https://leetcode.com/problems/sequential-digits/) | Medium | [C](./old-problems/1291/c/solution.c) [C++](./old-problems/1291/solution.cpp) |
| [1295. Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/) | Easy | [C](./old-problems/1295/c/solution.c) [C++](./old-problems/1295/solution.cpp) |
| [1298. Maximum Candies You Can Get from Boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/) | Hard | [C](./old-problems/1298/c/solution.c) [C++](./old-problems/1298/solution.cpp) |
| [1299. Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/) | Easy | [C](./old-problems/1299/c/solution.c) [C++](./old-problems/1299/solution.cpp) |
| [1302. Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/) | Medium | [C++](./old-problems/1302/solution.cpp) |
| [1304. Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/) | Easy | [C](./old-problems/1304/c/solution.c) [C++](./old-problems/1304/solution.cpp) |
| [1305. All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | Medium | [C++](./old-problems/1305/solution.cpp) |
| [1309. Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/) | Easy | [C](./old-problems/1309/c/solution.c) [C++](./old-problems/1309/solution.cpp) |
| [1310. XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/) | Medium | [C](./old-problems/1310/c/solution.c) [C++](./old-problems/1310/solution.cpp) |
| [1313. Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/) | Easy | [C](./old-problems/1313/c/solution.c) [C++](./old-problems/1313/solution.cpp) |
| [1314. Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/) | Medium | [C](./old-problems/1314/c/solution.c) [C++](./old-problems/1314/solution.cpp) |
| [1315. Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | Medium | [C++](./old-problems/1315/solution.cpp) |
| [1317. Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/) | Easy | [C](./old-problems/1317/c/solution.c) [C++](./old-problems/1317/solution.cpp) |
| [1323. Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/) | Easy | [C](./old-problems/1323/c/solution.c) [C++](./old-problems/1323/solution.cpp) |
| [1325. Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/) | Medium | [C++](./old-problems/1325/solution.cpp) |
| [1329. Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/) | Medium | [C](./old-problems/1329/c/solution.c) [C++](./old-problems/1329/solution.cpp) |
| [1331. Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/) | Easy | [C](./old-problems/1331/c/solution.c) [C++](./old-problems/1331/solution.cpp) |
| [1332. Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | Medium | [C](./old-problems/1332/c/solution.c) [C++](./old-problems/1332/solution.cpp) |
| [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/) | Medium | [C](./old-problems/1334/c/solution.c) [C++](./old-problems/1334/solution.cpp) |
| [1337. The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix) | Easy | [C++](./problems/1337/solution.cpp) |
| [1342. Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | Easy | [C](./old-problems/1342/c/solution.c) [C++](./old-problems/1342/solution.cpp) |
| [1346. Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | Easy | [C++](./old-problems/1346/solution.cpp) |
| [1347. Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | Medium | [C](./old-problems/1347/c/solution.c) [C++](./old-problems/1347/solution.cpp) |
| [1348. Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/) | Medium | [C++](./old-problems/1348/solution.cpp) |
| [1351. Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/) | Easy | [C](./old-problems/1351/c/solution.c) [C++](./old-problems/1351/solution.cpp) |
| [1352. Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/) | Medium | [C++](./old-problems/1352/solution.cpp) |
| [1353. Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | Medium | [C](./old-problems/1353/c/solution.c) [C++](./old-problems/1353/solution.cpp) |
| [1356. Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits) | Easy | [C++](./problems/1356/solution.cpp) |
| [1357. Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/) | Medium | [C++](./old-problems/1357/solution.cpp) |
| [1361. Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes) | Medium | [C](./old-problems/1361/c/solution.c) [C++](./old-problems/1361/solution.cpp) |
| [1365. How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | Easy | [C++](./old-problems/1365/solution.cpp) |
| [1366. Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [C](./old-problems/1366/c/solution.c) [C++](./old-problems/1366/solution.cpp) |
| [1367. Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/) | Medium | [C++](./old-problems/1367/solution.cpp) |
| [1370. Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/) | Easy | [C](./old-problems/1370/c/solution.c) [C++](./old-problems/1370/solution.cpp) |
| [1371. Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | Medium | [C](./old-problems/1371/c/solution.c) [C++](./old-problems/1371/solution.cpp) |
| [1374. Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/) | Easy | [C](./old-problems/1374/c/solution.c) [C++](./old-problems/1374/solution.cpp) |
| [1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | Medium | [C](./old-problems/1371/c/solution.c) [C++](./old-problems/1371/solution.cpp) |
| [1380. Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/) | Easy | [C](./old-problems/1380/c/solution.c) [C++](./old-problems/1380/solution.cpp) |
| [1381. Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | Medium | [C++](./old-problems/1381/solution.cpp) |
| [1382. Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/) | Medium | [C++](./old-problems/1382/solution.cpp) |
| [1394. Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | Easy | [C](./old-problems/1394/c/solution.c) [C++](./old-problems/1394/solution.cpp) |
| [1389. Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/) | Medium | [C](./old-problems/1389/c/solution.c) [C++](./old-problems/1389/solution.cpp) |
| [1395. Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/) | Medium | [C](./old-problems/1395/c/solution.c) [C++](./old-problems/1395/solution.cpp) |
| [1396. Design Underground System](https://leetcode.com/problems/design-underground-system/) | Medium | [C++](./old-problems/1396/solution.cpp) |
| [1399. Count Largest Group](https://leetcode.com/problems/count-largest-group/) | Easy | [C++](./old-problems/1399/solution.cpp) |
| [1402. Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [C](./old-problems/1402/c/solution.c) [C++](./old-problems/1402/solution.cpp) |
| [1403. Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/) | Easy | [C](./old-problems/1403/c/solution.c) [C++](./old-problems/1403/solution.cpp) |
| [1404. Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/) | Medium | [C](./old-problems/1404/c/solution.c) [C++](./old-problems/1404/solution.cpp) |
| [1405. Longest Happy String](https://leetcode.com/problems/longest-happy-string/) | Medium | [C](./old-problems/1405/c/solution.c) [C++](./old-problems/1405/solution.cpp) |
| [1408. String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/) | Easy | [C](./old-problems/1408/c/solution.c) [C++](./old-problems/1408/solution.cpp) |
| [1409. Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/) | Medium | [C](./old-problems/1409/c/solution.c) [C++](./old-problems/1409/solution.cpp) |
| [1415. The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/) | Medium | [C](./old-problems/1415/c/solution.c) [C++](./old-problems/1415/solution.cpp) |
| [1418. Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/) | Medium | [C++](./old-problems/1418/solution.cpp) |
| [1419. Minimum Number of Frogs Croaking](https://leetcode.com/problems/minimum-number-of-frogs-croaking/) | Medium | [C](./old-problems/1419/c/solution.c) [C++](./old-problems/1419/solution.cpp) |
| [1422. Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/) | Easy | [C](./old-problems/1422/c/solution.c) [C++](./old-problems/1422/solution.cpp) |
| [1424. Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/) | Medium | [C++](./problems/1424/solution.cpp) |
| [1425. Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum) | Hard | [C++](./problems/1425/solution.cpp) |
| [1431. Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/) | Easy | [C](./old-problems/1431/c/solution.c) [C++](./old-problems/1431/solution.cpp) |
| [1432. Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/) | Medium | [C](./old-problems/1432/c/solution.c) [C++](./old-problems/1432/solution.cpp) |
| [1436. Destination City](https://leetcode.com/problems/destination-city/) | Easy | [C++](./problems/1436/solution.cpp) |
| [1437. Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | Easy | [C](./old-problems/1437/c/solution.c) [C++](./old-problems/1437/solution.cpp) |
| [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | Medium | [C](./old-problems/1438/c/solution.c) [C++](./old-problems/1438/solution.cpp) |
| [1441. Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations) | Medium | [C++](./problems/1441/solution.cpp) |
| [1442. Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/) | Medium | [C](./old-problems/1442/c/solution.c) [C++](./old-problems/1442/solution.cpp) |
| [1448. Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | Medium | [C++](./old-problems/1448/solution.cpp) |
| [1450. Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | Easy | [C](./old-problems/1450/c/solution.c) [C++](./old-problems/1450/solution.cpp) |
| [1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/) | Easy | [C](./old-problems/1455/c/solution.c) [C++](./old-problems/1455/solution.cpp) |
| [1457. Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | Medium | [C++](./old-problems/1457/solution.cpp) |
| [1458. Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences) | Hard | [C++](./problems/1458/solution.cpp) |
| [1460. Make Two Arrays Equal by Reversing Subarrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/) | Easy | [C](./old-problems/1460/c/solution.c) [C++](./old-problems/1460/solution.cpp) |
| [1462. Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/) | Medium | [C](./old-problems/1462/c/solution.c) [C++](./old-problems/1462/solution.cpp) |
| [1464. Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | Easy | [C](./old-problems/1464/c/solution.c) [C++](./old-problems/1464/solution.cpp) |
| [1470. Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/) | Easy | [C](./old-problems/1470/c/solution.c) [C++](./old-problems/1470/solution.cpp) |
| [1472. Design Browser History](https://leetcode.com/problems/design-browser-history/) | Medium | [C++](./old-problems/1472/solution.cpp) |
| [1475. Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/) | Easy | [C](./old-problems/1475/c/solution.c) [C++](./old-problems/1475/solution.cpp) |
| [1476. Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/) | Medium | [C++](./old-problems/1476/solution.cpp) |
| [1480. Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/) | Easy | [C](./old-problems/1480/c/solution.c) [C++](./old-problems/1480/solution.cpp) |
| [1481. Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | Medium | [C++](./problems/1481/solution.cpp) |
| [1482. Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/) | Medium | [C](./old-problems/1482/c/solution.c) [C++](./old-problems/1482/solution.cpp) |
| [1486. XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) | Easy | [C](./old-problems/1486/c/solution.c) [C++](./old-problems/1486/solution.cpp) |
| [1488. Avoid Flood in The City](https://leetcode.com/problems/avoid-flood-in-the-city/) | Medium | [C++](./old-problems/1488/solution.cpp) |
| [1493. Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | Medium | [C](./old-problems/1493/c/solution.c) [C++](./old-problems/1493/solution.cpp) |
| [1496. Path Crossing](https://leetcode.com/problems/path-crossing/) | Easy | [C++](./problems/1496/solution.cpp) |
| [1497. Check If Array Pairs Are Divisible by k](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | Medium | [C](./old-problems/1497/c/solution.c) [C++](./old-problems/1497/solution.cpp) |
| [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) | Medium | [C](./old-problems/1498/c/solution.c) [C++](./old-problems/1498/solution.cpp) |
| [1503. Last Moment Before All Ants Fall Out of a Plank](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank) | Medium | [C](./old-problems/1503/c/solution.c) [C++](./old-problems/1503/solution.cpp) |
| [1507. Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [C](./old-problems/1507/c/solution.c) [C++](./old-problems/1507/solution.cpp) |
| [1508. Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/) | Medium | [C](./old-problems/1508/c/solution.c) [C++](./old-problems/1508/solution.cpp) |
| [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/) | Medium | [C](./old-problems/1509/c/solution.c) [C++](./old-problems/1509/solution.cpp) |
| [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs) | Easy | [C](./old-problems/1512/c/solution.c) [C++](./old-problems/1512/solution.cpp) |
| [1513. Number of Substrings With Only 1s](https://leetcode.com/problems/number-of-substrings-with-only-1s/) | Medium | [C](./old-problems/1513/c/solution.c) [C++](./old-problems/1513/solution.cpp) |
| [1514. Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/) | Medium | [C](./old-problems/1514/c/solution.c) [C++](./old-problems/1514/solution.cpp) |
| [1518. Water Bottles](https://leetcode.com/problems/water-bottles/) | Easy | [C](./old-problems/1518/c/solution.c) [C++](./old-problems/1518/solution.cpp) |
| [1523. Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | Easy | [C++](./old-problems/1523/solution.cpp) |
| [1524. Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | Medium | [C](./old-problems/1524/c/solution.c) [C++](./old-problems/1524/solution.cpp) |
| [1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/) | Hard | [C](./old-problems/1526/c/solution.c) [C++](./old-problems/1526/solution.cpp) |
| [1528. Shuffle String](https://leetcode.com/problems/shuffle-string/) | Easy | [C](./old-problems/1528/c/solution.c) [C++](./old-problems/1528/solution.cpp) |
| [1529. Minimum Suffix Flips](https://leetcode.com/problems/minimum-suffix-flips/) | Medium | [C](./old-problems/1529/c/solution.c) [C++](./old-problems/1529/solution.cpp) |
| [1530. Number of Good Leaf Nodes Pairs](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/) | Medium | [C++](./old-problems/1530/solution.cpp) |
| [1534. Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | Easy | [C](./old-problems/1534/c/solution.c) [C++](./old-problems/1534/solution.cpp) |
| [1535. Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game) | Medium | [C](./old-problems/1535/c/solution.c) [C++](./old-problems/1535/solution.cpp) |
| [1544. Make The String Great](https://leetcode.com/problems/make-the-string-great/) | Easy | [C](./old-problems/1544/c/solution.c) [C++](./old-problems/1544/solution.cpp) |
| [1545. Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/) | Medium | [C](./old-problems/1545/c/solution.c) [C++](./old-problems/1545/solution.cpp) |
| [1550. Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | [C](./old-problems/1550/c/solution.c) [C++](./old-problems/1550/solution.cpp) |
| [1551. Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/) | Medium | [C](./old-problems/1551/c/solution.c) [C++](./old-problems/1551/solution.cpp) |
| [1552. Magnetic Force Between Two Balls](https://leetcode.com/problems/magnetic-force-between-two-balls/) | Medium | [C](./old-problems/1552/c/solution.c) [C++](./old-problems/1552/solution.cpp) |
| [1557. Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/) | Medium | [C](./old-problems/1557/c/solution.c) [C++](./old-problems/1557/solution.cpp) |
| [1561. Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | Medium | [C](./old-problems/1561/c/solution.c) [C++](./old-problems/1561/solution.cpp) |
| [1563. Stone Game V](https://leetcode.com/problems/stone-game-v/) | Hard | [C](./old-problems/1563/c/solution.c) [C++](./old-problems/1563/solution.cpp) |
| [1566. Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/) | Easy | [C](./old-problems/1566/c/solution.c) [C++](./old-problems/1566/solution.cpp) |
| [1572. Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/) | Easy | [C](./old-problems/1572/c/solution.c) [C++](./old-problems/1572/solution.cpp) |
| [1574. Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | Medium | [C](./old-problems/1574/c/solution.c) [C++](./old-problems/1574/solution.cpp) |
| [1578. Minimum Time to Make Rope Colorful](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/) | Medium | [C++](./old-problems/1578/solution.cpp) |
| [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/) | Hard | [C](./old-problems/1579/c/solution.c) [C++](./old-problems/1579/solution.cpp) |
| [1582. Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/) | Easy | [C](./old-problems/1582/c/solution.c) [C++](./old-problems/1582/solution.cpp) |
| [1588. Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/) | Easy | [C](./old-problems/1588/c/solution.c) [C++](./old-problems/1588/solution.cpp) |
| [1590. Make Sum Divisible by P](https://leetcode.com/problems/make-sum-divisible-by-p/) | Medium | [C++](./problems/1590/solution.cpp) |
| [1593. Split a String Into the Max Number of Unique Substrings](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/) | Medium | [C++](./problems/1593/solution.cpp) |
| [1598. Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/) | Easy | [C](./old-problems/1598/c/solution.c) [C++](./old-problems/1598/solution.cpp) |
| [1600. Throne Inheritance](https://leetcode.com/problems/throne-inheritance/) | Medium | [C++](./old-problems/1600/solution.cpp) |
| [1603. Design Parking System](https://leetcode.com/problems/design-parking-system/) | Easy | [C++](./old-problems/1603/solution.cpp) |
| [1605. Find Valid Matrix Given Row and Column Sums](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/) | Medium | [C](./old-problems/1605/c/solution.c) [C++](./old-problems/1605/solution.cpp) |
| [1608. Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/) | Easy | [C](./old-problems/1608/c/solution.c) [C++](./old-problems/1608/solution.cpp) |
| [1609. Even Odd Tree](https://leetcode.com/problems/even-odd-tree/) | Medium | [C++](./old-problems/1609/solution.cpp) |
| [1611. Minimum One Bit Operations to Make Integers Zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/) | Hard | [C](./old-problems/1611/c/solution.c) [C++](./old-problems/1611/solution.cpp) |
| [1614. Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/) | Easy | [C++](./old-problems/1614/solution.cpp) [C](./old-problems/1614/c/solution.c) |
| [1624. Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/) | Easy | [C](./old-problems/1624/c/solution.c) [C++](./old-problems/1624/solution.cpp) |
| [1625. Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/) | Medium | [C++](./old-problems/1625/solution.cpp) |
| [1627. Graph Connectivity With Threshold](https://leetcode.com/problems/graph-connectivity-with-threshold/) | Hard | [C](./old-problems/1627/c/solution.c) [C++](./old-problems/1627/solution.cpp) |
| [1630. Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/) | Medium | [C](./old-problems/1630/c/solution.c) [C++](./old-problems/1630/solution.cpp) |
| [1636. Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [C](./old-problems/1636/c/solution.c) [C++](./old-problems/1636/solution.cpp) |
| [1637. Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/) | Medium | [C](./old-problems/1637/c/solution.c) [C++](./old-problems/1637/solution.cpp) |
| [1638. Count Substrings That Differ by One Character](https://leetcode.com/problems/count-substrings-that-differ-by-one-character/) | Medium | [C++](./old-problems/1638/solution.cpp) |
| [1639. Number of Ways to Form a Target String Given a Dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/) | Hard | [C](./old-problems/1639/c/solution.c) [C++](./old-problems/1639/solution.cpp) |
| [1641. Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/) | Medium | [C](./old-problems/1641/c/solution.c) [C++](./old-problems/1641/solution.cpp) |
| [1642. Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | Medium | [C++](./problems/1642/solution.cpp) |
| [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | Medium | [C](./old-problems/1652/c/solution.c) [C++](./old-problems/1652/solution.cpp) |
| [1653. Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/) | Medium | [C](./old-problems/1653/c/solution.c) [C++](./old-problems/1653/solution.cpp) |
| [1656. Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/) | Easy | [C++](./old-problems/1656/solution.cpp) |
| [1657. Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | Medium | [C](./old-problems/1657/c/solution.c) [C++](./old-problems/1657/solution.cpp) |
| [1658. Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero) | Medium | [C++](./problems/1658/solution.cpp) |
| [1662. Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | Easy | [C](./old-problems/1662/c/solution.c) [C++](./old-problems/1662/solution.cpp) |
| [1663. Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/) | Medium | [C](./old-problems/1663/c/solution.c) [C++](./old-problems/1663/solution.cpp) |
| [1668. Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | Easy | [C](./old-problems/1668/c/solution.c) [C++](./old-problems/1668/solution.cpp) |
| [1669. Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/) | Medium | [C++](./old-problems/1669/solution.cpp) |
| [1671. Minimum Number of Removals to Make Mountain Array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | Hard | [C++](./old-problems/1671/solution.cpp) |
| [1672. Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/) | Easy | [C](./old-problems/1672/c/solution.c) [C++](./old-problems/1672/solution.cpp) |
| [1678. Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/) | Easy | [C](./old-problems/1678/c/solution.c) [C++](./old-problems/1678/solution.cpp) |
| [1684. Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | Easy | [C++](./old-problems/1684/solution.cpp) |
| [1685. Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/) | Medium | [C](./old-problems/1685/c/solution.c) [C++](./old-problems/1685/solution.cpp) |
| [1686. Stone Game VI](https://leetcode.com/problems/stone-game-vi/) | Medium | [C](./old-problems/1686/c/solution.c) [C++](./old-problems/1686/solution.cpp) |
| [1688. Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/description/) | Easy | [C](./old-problems/1688/c/solution.c) [C++](./old-problems/1688/solution.cpp) |
| [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/) | Medium | [C](./old-problems/1689/c/solution.c) [C++](./old-problems/1689/solution.cpp) |
| [1690. Stone Game VII](https://leetcode.com/problems/stone-game-vii/) | Medium | [C](./old-problems/1690/c/solution.c) [C++](./old-problems/1690/solution.cpp) |
| [1695. Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | Medium | [C](./old-problems/1695/c/solution.c) [C++](./old-problems/1695/solution.cpp) |
| [1700. Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/) | Easy | [C](./old-problems/1700/c/solution.c) [C++](./old-problems/1700/solution.cpp) |
| [1701. Average Waiting Time](https://leetcode.com/problems/average-waiting-time/) | Medium | [C](./old-problems/1701/c/solution.c) [C++](./old-problems/1701/solution.cpp) |
| [1704. Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | Easy | [C](./old-problems/1704/c/solution.c) [C++](./old-problems/1704/solution.cpp) |
| [1710. Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | Easy | [C](./old-problems/1710/c/solution.c) [C++](./old-problems/1710/solution.cpp) |
| [1716. Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/) | Easy | [C](./old-problems/1716/c/solution.c) [C++](./old-problems/1716/solution.cpp) |
| [1717. Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/) | Medium | [C](./old-problems/1717/c/solution.c) [C++](./old-problems/1717/solution.cpp) |
| [1718. Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | Medium | [C](./old-problems/1718/c/solution.c) [C++](./old-problems/1718/solution.cpp) |
| [1720. Decode XORed Array](https://leetcode.com/problems/decode-xored-array/) | Easy | [C](./old-problems/1720/c/solution.c) [C++](./old-problems/1720/solution.cpp) |
| [1723. Find Minimum Time to Finish All Jobs](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/) | Hard | [C++](./problems/1723/solution.cpp) |
| [1725. Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/) | Easy | [C](./old-problems/1725/c/solution.c) [C++](./old-problems/1725/solution.cpp) |
| [1726. Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/) | Medium | [C](./old-problems/1726/c/solution.c) [C++](./old-problems/1726/solution.cpp) |
| [1727. Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/) | Medium | [C](./old-problems/1727/c/solution.c) [C++](./old-problems/1727/solution.cpp) |
| [1732. Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/) | Easy | [C](./old-problems/1732/c/solution.c) [C++](./old-problems/1732/solution.cpp) |
| [1733. Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/) | Medium | [C](./old-problems/1733/c/solution.c) [C++](./old-problems/1733/solution.cpp) |
| [1742. Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/) | Easy | [C](./old-problems/1742/c/solution.c) [C++](./old-problems/1742/solution.cpp) |
| [1743. Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs) | Medium | [C++](./problems/1743/solution.cpp) |
| [1748. Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/) | Easy | [C](./old-problems/1748/c/solution.c) [C++](./old-problems/1748/solution.cpp) |
| [1749. Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | Medium | [C](./old-problems/1749/c/solution.c) [C++](./old-problems/1749/solution.cpp) |
| [1750. Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/) | Medium | [C](./old-problems/1750/c/solution.c) [C++](./old-problems/1750/solution.cpp) |
| [1751. Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/) | Hard | [C](./old-problems/1751/c/solution.c) [C++](./old-problems/1751/solution.cpp) |
| [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | Easy | [C](./old-problems/1752/c/solution.c) [C++](./old-problems/1752/solution.cpp) |
| [1758. Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/) | Easy | [C](./old-problems/1758/c/solution.c) [C++](./old-problems/1758/solution.cpp) |
| [1759. Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings) | Medium | [C](./old-problems/1759/c/solution.c) [C++](./old-problems/1759/solution.cpp) |
| [1760. Minimum Limit of Balls in a Bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/) | Medium | [C](./old-problems/1760/c/solution.c) [C++](./old-problems/1760/solution.cpp) |
| [1765. Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/description/) | Medium | [C++](./old-problems/1765/solution.cpp) |
| [1768. Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | Easy | [C](./old-problems/1768/c/solution.c) [C++](./old-problems/1768/solution.cpp) |
| [1769. Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | Medium | [C](./old-problems/1769/c/solution.c) [C++](./old-problems/1769/solution.cpp) |
| [1770. Maximum Score from Performing Multiplication Operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/) | Hard | [C](./old-problems/1770/c/solution.c) [C++](./old-problems/1770/solution.cpp) |
| [1773. Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/) | Easy | [C](./old-problems/1773/c/solution.c) [C++](./old-problems/1773/solution.cpp) |
| [1780. Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | Medium | [C](./old-problems/1780/c/solution.c) [C++](./old-problems/1780/solution.cpp) |
| [1781. Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/) | Medium | [C++](./old-problems/1781/solution.cpp) |
| [1790. Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | Easy | [C](./old-problems/1790/c/solution.c) [C++](./old-problems/1790/solution.cpp) |
| [1791. Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/) | Easy | [C](./old-problems/1791/c/solution.c) [C++](./old-problems/1791/solution.cpp) |
| [1792. Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) | Medium | [C++](./problems/1792/solution.cpp) |
| [1793. Maximum Score of a Good Subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray) | Hard | [C](./old-problems/1793/c/solution.c) [C++](./old-problems/1793/solution.cpp) |
| [1798. Maximum Number of Consecutive Values You Can Make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/) | Medium | [C](./old-problems/1798/c/solution.c) [C++](./old-problems/1798/solution.cpp) |
| [1800. Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | [C](./old-problems/1800/c/solution.c) [C++](./old-problems/1800/solution.cpp) |
| [1812. Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | Easy | [C](./old-problems/1812/c/solution.c) [C++](./old-problems/1812/solution.cpp) |
| [1813. Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/) | Medium | [C](./old-problems/1813/c/solution.c) [C++](./old-problems/1813/solution.cpp) |
| [1814. Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | Medium | [C++](./problems/1814/solution.cpp) |
| [1816. Truncate Sentence](https://leetcode.com/problems/truncate-sentence/) | Easy | [C](./old-problems/1816/c/solution.c) [C++](./old-problems/1816/solution.cpp) |
| [1817. Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/) | Medium | [C](./old-problems/1817/c/solution.c) [C++](./old-problems/1817/solution.cpp) |
| [1823. Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | Medium | [C](./old-problems/1823/c/solution.c) [C++](./old-problems/1823/solution.cpp) |
| [1827. Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | Easy | [C](./old-problems/1827/c/solution.c) [C++](./old-problems/1827/solution.cpp) |
| [1828. Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/) | Medium | [C](./old-problems/1828/c/solution.c) [C++](./old-problems/1828/solution.cpp) |
| [1829. Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/) | Medium | [C](./old-problems/1829/c/solution.c) [C++](./old-problems/1829/solution.cpp) |
| [1832. Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | Easy | [C](./old-problems/1832/c/solution.c) [C++](./old-problems/1832/solution.cpp) |
| [1833. Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/) | Medium | [C](./old-problems/1833/c/solution.c) [C++](./old-problems/1833/solution.cpp) |
| [1837. Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | Easy | [C](./old-problems/1837/c/solution.c) [C++](./old-problems/1837/solution.cpp) |
| [1838. Frequency of the Most Frequent Element](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) | Medium | [C++](./problems/1838/solution.cpp) |
| [1844. Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/) | Easy | [C](./old-problems/1844/c/solution.c) [C++](./old-problems/1844/solution.cpp) |
| [1845. Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | Medium | [C++](./old-problems/1845/solution.cpp) |
| [1846. Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging) | Medium | [C](./old-problems/1846/c/solution.c) [C++](./old-problems/1846/solution.cpp) |
| [1859. Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/) | Easy | [C](./old-problems/1859/c/solution.c) [C++](./old-problems/1859/solution.cpp) |
| [1860. Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/) | Medium | [C](./old-problems/1860/c/solution.c) [C++](./old-problems/1860/solution.cpp) |
| [1861. Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [C](./old-problems/1861/c/solution.c) [C++](./old-problems/1861/solution.cpp) |
| [1863. Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/) | Easy | [C](./old-problems/1863/c/solution.c) [C++](./old-problems/1863/solution.cpp) |
| [1865. Finding Pairs With a Certain Sum](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/) | Medium | [C++](./old-problems/1865/solution.cpp) |
| [1876. Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters) | Easy | [C](./old-problems/1876/c/solution.c) [C++](./old-problems/1876/solution.cpp) |
| [1877. Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/) | Medium | [C++](./old-problems/1877/c/solution.c) [C++](./old-problems/1877/solution.cpp) |
| [1880. Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/) | Easy | [C](./old-problems/1880/c/solution.c) [C++](./old-problems/1880/solution.cpp) |
| [1884. Egg Drop With 2 Eggs and N Floors](https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors/) | Medium | [C](./old-problems/1884/c/solution.c) [C++](./old-problems/1884/solution.cpp) |
| [1887. Reduction Operations to Make the Array Elements Equal](https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal/) | Medium | [C](./old-problems/1887/c/solution.c) [C++](./old-problems/1887/solution.cpp) |
| [1888. Minimum Number of Flips to Make the Binary String Alternating](https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/) | Medium | [C](./old-problems/1888/c/solution.c) [C++](./old-problems/1888/solution.cpp) |
| [1893. Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/) | Easy | [C](./old-problems/1893/c/solution.c) [C++](./old-problems/1893/solution.cpp) |
| [1894. Find the Student that Will Replace the Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | Medium | [C](./old-problems/1894/c/solution.c) [C++](./old-problems/1894/solution.cpp) |
| [1895. Largest Magic Square](https://leetcode.com/problems/largest-magic-square/) | Medium | [C](./old-problems/1895/c/solution.c) [C++](./old-problems/1895/solution.cpp) |
| [1897. Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) | Easy | [C](./old-problems/1897/c/solution.c) [C++](./old-problems/1897/solution.cpp) |
| [1903. Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/) | Easy | [C](./old-problems/1903/c/solution.c) [C++](./old-problems/1903/solution.cpp) |
| [1904. The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/) | Medium | [C](./old-problems/1904/c/solution.c) [C++](./old-problems/1904/solution.cpp) |
| [1905. Count Sub Islands](https://leetcode.com/problems/count-sub-islands/) | Medium | [C](./old-problems/1905/c/solution.c) [C++](./old-problems/1905/solution.cpp) |
| [1906. Minimum Absolute Difference Queries](https://leetcode.com/problems/minimum-absolute-difference-queries/) | Medium | [C](./old-problems/1906/c/solution.c) [C++](./old-problems/1906/solution.cpp) |
| [1909. Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/) | Easy | [C](./old-problems/1909/c/solution.c) [C++](./old-problems/1909/solution.cpp) |
| [1910. Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | Medium | [C](./old-problems/1910/c/solution.c) [C++](./old-problems/1910/solution.cpp) |
| [1913. Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/) | Easy | [C](./old-problems/1913/c/solution.c) [C++](./old-problems/1913/solution.cpp) |
| [1915. Number of Wonderful Substrings](https://leetcode.com/problems/number-of-wonderful-substrings/) | Medium | [C](./old-problems/1915/c/solution.c) [C++](./old-problems/1915/solution.cpp) |
| [1920. Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/) | Easy | [C++](./old-problems/1920/solution.cpp) |
| [1921. Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters) | Medium | [C](./old-problems/1921/c/solution.c) [C++](./old-problems/1921/solution.cpp) |
| [1922. Count Good Numbers](https://leetcode.com/problems/count-good-numbers/) | Medium | [C](./old-problems/1922/c/solution.c) [C++](./old-problems/1922/solution.cpp) |
| [1925. Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/) | Easy | [C++](./old-problems/1925/solution.cpp) |
| [1929. Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/) | Easy | [C](./old-problems/1929/c/solution.c) [C++](./old-problems/1929/solution.cpp) |
| [1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences) | Medium | [C](./old-problems/1930/c/solution.c) [C++](./old-problems/1930/solution.cpp) |
| [1935. Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/) | Easy | [C](./old-problems/1935/c/solution.c) [C++](./old-problems/1935/solution.cpp) |
| [1936. Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/) | Medium | [C](./old-problems/1936/c/solution.c) [C++](./old-problems/1936/solution.cpp) |
| [1937. Maximum Number of Points with Cost](https://leetcode.com/problems/maximum-number-of-points-with-cost/) | Medium | [C](./old-problems/1937/c/solution.c) [C++](./old-problems/1937/solution.cpp) |
| [1941. Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/) | Easy | [C](./old-problems/1941/c/solution.c) [C++](./old-problems/1941/solution.cpp) |
| [1942. The Number of the Smallest Unoccupied Chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/) | Medium | [C++](./problems/1942/solution.cpp) |
| [1944. Number of Visible People in a Queue](https://leetcode.com/problems/number-of-visible-people-in-a-queue/) | Hard | [C](./old-problems/1944/c/solution.c) [C++](./old-problems/1944/solution.cpp) |
| [1945. Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/) | Easy | [C](./old-problems/1945/c/solution.c) [C++](./old-problems/1945/solution.cpp) |
| [1957. Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | [C](./old-problems/1957/c/solution.c) [C++](./old-problems/1957/solution.cpp) |
| [1963. Minimum Number of Swaps to Make the String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/) | Medium | [C](./old-problems/1963/c/solution.c) [C++](./old-problems/1963/solution.cpp) |
| [1967. Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/) | Easy | [C](./old-problems/1967/c/solution.c) [C++](./old-problems/1967/solution.cpp) |
| [1971. Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/) | Easy | [C](./old-problems/1971/c/solution.c) [C++](./old-problems/1971/solution.cpp) |
| [1974. Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/) | Easy | [C](./old-problems/1974/c/solution.c) [C++](./old-problems/1974/solution.cpp) |
| [1975. Maximum Matrix Sum](https://leetcode.com/problems/maximum-matrix-sum/) | Medium | [C++](./old-problems/1975/solution.cpp) |
| [1976. Number of Ways to Arrive at Destination](https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/) | Medium | [C++](./old-problems/1976/solution.cpp) |
| [1979. Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/) | Easy | [C](./old-problems/1979/c/solution.c) [C++](./old-problems/1979/solution.cpp) |
| [1980. Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/) | Medium | [C++](./old-problems/1980/solution.cpp) |
| [1992. Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/) | Medium | [C](./old-problems/1992/c/solution.c) [C++](./old-problems/1992/solution.cpp) |
| [1995. Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/) | Easy | [C](./old-problems/1995/c/solution.c) [C++](./old-problems/1995/solution.cpp) |
| [2000. Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/) | Easy | [C](./old-problems/2000/c/solution.c) [C++](./old-problems/2000/solution.cpp) |
| [2001. Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/) | Medium | [C](./old-problems/2001/c/solution.c) [C++](./old-problems/2001/solution.cpp) |
| [2006. Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/) | Easy | [C](./old-problems/2006/c/solution.c) [C++](./old-problems/2006/solution.cpp) |
| [2009. Minimum Number of Operations to Make Array Continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous) | Hard | [C++](./problems/2009/solution.cpp) |
| [2016. Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [C](./old-problems/2016/c/solution.c) [C++](./old-problems/2016/solution.cpp) |
| [2011. Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) | Easy | [C](./old-problems/2011/c/solution.c) [C++](./old-problems/2011/solution.cpp) |
| [2017. Grid Game](https://leetcode.com/problems/grid-game/) | Medium | [C](./old-problems/2017/c/solution.c) [C++](./old-problems/2017/solution.cpp) |
| [2018. Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/) | Medium | [C](./old-problems/2018/c/solution.c) [C++](./old-problems/2018/solution.cpp) |
| [2022. Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/) | Medium | [C](./old-problems/2022/c/solution.c) [C++](./old-problems/2022/solution.cpp) |
| [2023. Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/) | Medium | [C](./old-problems/2023/c/solution.c) [C++](./old-problems/2023/solution.cpp) |
| [2028. Find Missing Observations](https://leetcode.com/problems/find-missing-observations/) | Medium | [C](./old-problems/2028/c/solution.c) [C++](./old-problems/2028/solution.cpp) |
| [2032. Two Out of Three](https://leetcode.com/problems/two-out-of-three/) | Easy | [C](./old-problems/2032/c/solution.c) [C++](./old-problems/2032/solution.cpp) |
| [2033. Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/description/) | Medium | [C](./old-problems/2033/c/solution.c) [C++](./old-problems/2033/solution.cpp) |
| [2037. Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/) | Easy | [C](./old-problems/2037/c/solution.c) [C++](./old-problems/2037/solution.cpp) |
| [2038. Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color) | Medium | [C](./old-problems/2038/c/solution.c) [C++](./old-problems/2038/solution.cpp) |
| [2044. Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) | Medium | [C](./old-problems/2044/c/solution.c) [C++](./old-problems/2044/solution.cpp) |
| [2048. Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/) | Medium | [C](./old-problems/2048/c/solution.c) [C++](./old-problems/2048/solution.cpp) |
| [2050. Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii) | Hard | [C++](./problems/2050/solution.cpp) |
| [2053. Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/) | Easy | [C++](./problems/2053/solution.cpp) |
| [2057. Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/) | Easy | [C++](./old-problems/2057/solution.cpp) |
| [2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/) | Medium | [C++](./old-problems/2058/solution.cpp) |
| [2064. Minimized Maximum of Products Distributed to Any Store](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/) | Medium | [C](./old-problems/2064/c/solution.c) [C++](./old-problems/2064/solution.cpp) |
| [2070. Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/) | Medium | [C](./old-problems/2070/c/solution.c) [C++](./old-problems/2070/solution.cpp) |
| [2071. Maximum Number of Tasks You Can Assign](https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/) | Hard | [C](./old-problems/2071/c/solution.c) [C++](./old-problems/2071/solution.cpp) |
| [2073. Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/) | Easy | [C](./old-problems/2073/c/solution.c) [C++](./old-problems/2073/solution.cpp) |
| [2079. Watering Plants](https://leetcode.com/problems/watering-plants/) | Medium | [C](./old-problems/2079/c/solution.c) [C++](./old-problems/2079/solution.cpp) |
| [2081. Sum of k-Mirror Numbers](https://leetcode.com/problems/sum-of-k-mirror-numbers/) | Hard | [C](./old-problems/2081/c/solution.c) [C++](./old-problems/2081/solution.cpp) |
| [2085. Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/) | Easy | [C++](./problems/2085/solution.cpp) |
| [2089. Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/) | Easy | [C](./old-problems/2089/c/solution.c) [C++](./old-problems/2089/solution.cpp) |
| [2092. Find All People With Secret](https://leetcode.com/problems/find-all-people-with-secret/) | Hard | [C](./old-problems/2092/c/solution.c) [C++](./old-problems/2092/solution.cpp) |
| [2094. Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/) | Easy | [C](./old-problems/2094/c/solution.c) [C++](./old-problems/2094/solution.cpp) |
| [2096. Step-By-Step Directions From a Binary Tree Node to Another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/) | Medium | [C++](./old-problems/2096/solution.cpp) |
| [2099. Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) | Easy | [C](./old-problems/2099/c/solution.c) [C++](./old-problems/2099/solution.cpp) |
| [2103. Rings and Rods](https://leetcode.com/problems/rings-and-rods/) | Easy | [C](./old-problems/2103/c/solution.c) [C++](./old-problems/2103/solution.cpp) |
| [2108. Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/) | Easy | [C](./old-problems/2108/c/solution.c) [C++](./old-problems/2108/solution.cpp) |
| [2109. Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/) | Medium | [C](./old-problems/2109/c/solution.c) [C++](./old-problems/2109/solution.cpp) |
| [2114. Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/) | Easy | [C](./old-problems/2114/c/solution.c) [C++](./old-problems/2114/solution.cpp) |
| [2115. Find All Possible Recipes from Given Supplies](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/) | Medium | [C++](./old-problems/2115/solution.cpp) |
| [2116. Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | Medium | [C++](./old-problems/2116/solution.cpp) |
| [2119. A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/) | Easy | [C](./old-problems/2119/c/solution.c) [C++](./old-problems/2119/solution.cpp) |
| [2120. Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/) | Medium | [C](./old-problems/2120/c/solution.c) [C++](./old-problems/2120/solution.cpp) |
| [2124. Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/) | Easy | [C](./old-problems/2124/c/solution.c) [C++](./old-problems/2124/solution.cpp) |
| [2125. Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/) | Medium | [C](./old-problems/2125/c/solution.c) [C++](./old-problems/2125/solution.cpp) |
| [2130. Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/) | Medium | [C++](./old-problems/2130/solution.cpp) |
| [2131. Longest Palindrome by Concatenating Two Letter Words](https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/) | Medium | [C++](./old-problems/2131/solution.cpp) |
| [2134. Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/) | Medium | [C](./old-problems/2134/c/solution.c) [C++](./old-problems/2134/solution.cpp) |
| [2135. Count Words Obtained After Adding a Letter](https://leetcode.com/problems/count-words-obtained-after-adding-a-letter/) | Medium | [C](./old-problems/2135/c/solution.c) [C++](./old-problems/2135/solution.cpp) |
| [2138. Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/) | Easy | [C++](./old-problems/2138/solution.cpp) |
| [2140. Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/) | Medium | [C](./old-problems/2140/c/solution.c) [C++](./old-problems/2140/solution.cpp) |
| [2141. Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/) | Hard | [C](./old-problems/2141/c/solution.c) [C++](./old-problems/2141/solution.cpp) |
| [2144. Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/) | Easy | [C](./old-problems/2144/c/solution.c) [C++](./old-problems/2144/solution.cpp) |
| [2145. Count the Hidden Sequences](https://leetcode.com/problems/count-the-hidden-sequences/) | Medium | [C](./old-problems/2145/c/solution.c) [C++](./old-problems/2145/solution.cpp) |
| [2147. Number of Ways to Divide a Long Corridor](https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/) | Hard | [C](./old-problems/2147/c/solution.c) [C++](./old-problems/2147/solution.cpp) |
| [2149. Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/) | Medium | [C](./old-problems/2149/c/solution.c) [C++](./old-problems/2149/solution.cpp) |
| [2154. Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/) | Easy | [C](./old-problems/2154/c/solution.c) [C++](./old-problems/2154/solution.cpp) |
| [2160. Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/) | Easy | [C](./old-problems/2160/c/solution.c) [C++](./old-problems/2160/solution.cpp) |
| [2161. Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | Medium | [C](./old-problems/2161/c/solution.c) [C++](./old-problems/2161/solution.cpp) |
| [2165. Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/) | Medium | [C](./old-problems/2165/c/solution.c) [C++](./old-problems/2165/solution.cpp) |
| [2169. Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/) | Easy | [C](./old-problems/2169/c/solution.c) [C++](./old-problems/2169/solution.cpp) |
| [2170. Minimum Operations to Make the Array Alternating](https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/) | Medium | [C++](./old-problems/2170/solution.cpp) |
| [2176. Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/) | Easy | [C](./old-problems/2176/c/solution.c) [C++](./old-problems/2176/solution.cpp) |
| [2179. Count Good Triplets in an Array](https://leetcode.com/problems/count-good-triplets-in-an-array/) | Hard | [C](./old-problems/2179/c/solution.c) [C++](./old-problems/2179/solution.cpp) |
| [2181. Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/) | Medium | [C++](./old-problems/2181/solution.cpp) |
| [2182. Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/) | Medium | [C](./old-problems/2182/c/solution.c) [C++](./old-problems/2182/solution.cpp) |
| [2185. Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/) | Easy | [C](./old-problems/2185/c/solution.c) [C++](./old-problems/2185/solution.cpp) |
| [2191. Sort the Jumbled Numbers](https://leetcode.com/problems/sort-the-jumbled-numbers/) | Medium | [C++](./old-problems/2191/solution.cpp) |
| [2192. All Ancestors of a Node in a Directed Acyclic Graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/) | Medium | [C++](./problems/2192/solution.cpp) |
| [2194. Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/) | Easy | [C](./old-problems/2194/c/solution.c) [C++](./old-problems/2194/solution.cpp) |
| [2196. Create Binary Tree From Descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions/) | Medium | [C++](./old-problems/2196/solution.cpp) |
| [2197. Replace Non-Coprime Numbers in Array](https://leetcode.com/problems/replace-non-coprime-numbers-in-array/) | Hard | [C++](./old-problems/2197/solution.cpp) |
| [2200. Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/) | Easy | [C](./old-problems/2200/c/solution.c) [C++](./old-problems/2200/solution.cpp) |
| [2206. Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/) | Easy | [C](./old-problems/2206/c/solution.c) [C++](./old-problems/2206/solution.cpp) |
| [2210. Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/) | Easy | [C](./old-problems/2210/c/solution.c) [C++](./old-problems/2210/solution.cpp) |
| [2211. Count Collisions on a Road](https://leetcode.com/problems/count-collisions-on-a-road/) | Medium | [C](./old-problems/2211/c/solution.c) [C++](./old-problems/2211/solution.cpp) |
| [2215. Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/) | Easy | [C](./old-problems/2215/c/solution.c) [C++](./old-problems/2215/solution.cpp) |
| [2216. Minimum Deletions to Make Array Beautiful](https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful/) | Medium | [C](./old-problems/2216/c/solution.c) [C++](./old-problems/2216/solution.cpp) |
| [2220. Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/) | Easy | [C](./old-problems/2220/c/solution.c) [C++](./old-problems/2220/solution.cpp) |
| [2221. Find Triangular Sum of an Array](https://leetcode.com/problems/find-triangular-sum-of-an-array/) | Medium | [C](./old-problems/2221/c/solution.c) [C++](./old-problems/2221/solution.cpp) |
| [2225. Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/) | Medium | [C++](./problems/2225/solution.cpp) |
| [2232. Minimize Result by Adding Parentheses to Expression](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression/) | Medium | [C](./old-problems/2232/c/solution.c) [C++](./old-problems/2232/solution.cpp) |
| [2235. Add Two Integers](https://leetcode.com/problems/add-two-integers) | Easy | [C](./old-problems/2235/c/solution.c) [C++](./old-problems/2235/solution.cpp) |
| [2236. Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/) | Easy | [C++](./old-problems/2236/solution.cpp) |
| [2248. Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/) | Easy | [C](./old-problems/2248/c/solution.c) [C++](./old-problems/2248/solution.cpp) |
| [2251. Number of Flowers in Full Bloom](https://leetcode.com/problems/number-of-flowers-in-full-bloom) | Hard | [C++](./problems/2251/solution.cpp) |
| [2255. Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/) | Easy | [C](./old-problems/2255/c/solution.c) [C++](./old-problems/2255/solution.cpp) |
| [2257. Count Unguarded Cells in the Grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid/) | Medium | [C](./old-problems/2257/c/solution.c) [C++](./old-problems/2257/solution.cpp) |
| [2264. Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/) | Easy | [C](./old-problems/2264/c/solution.c) [C++](./old-problems/2264/solution.cpp) |
| [2226. Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/) | Medium | [C](./old-problems/2226/c/solution.c) [C++](./old-problems/2226/solution.cpp) |
| [2270. Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/) | Medium | [C](./old-problems/2270/c/solution.c) [C++](./old-problems/2270/solution.cpp) |
| [2275. Largest Combination With Bitwise AND Greater Than Zero](https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/) | Medium | [C](./old-problems/2275/c/solution.c) [C++](./old-problems/2275/solution.cpp) |
| [2278. Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/) | Easy | [C](./old-problems/2278/c/solution.c) [C++](./old-problems/2278/solution.cpp) |
| [2283. Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/) | Easy | [C](./old-problems/2283/c/solution.c) [C++](./old-problems/2283/solution.cpp) |
| [2285. Maximum Total Importance of Roads](https://leetcode.com/problems/maximum-total-importance-of-roads/) | Medium | [C](./old-problems/2285/c/solution.c) [C++](./old-problems/2285/solution.cpp) |
| [2290. Minimum Obstacle Removal to Reach Corner](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/) | Hard | [C++](./problems/2290/solution.cpp) |
| [2294. Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/) | Medium | [C](./old-problems/2294/c/solution.c) [C++](./old-problems/2294/solution.cpp) |
| [2300. Successful Pairs of Spells and Potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/) | Medium | [C](./old-problems/2300/c/solution.c) [C++](./old-problems/2300/solution.cpp) |
| [2302. Count Subarrays With Score Less Than K](https://leetcode.com/problems/count-subarrays-with-score-less-than-k/) | Hard | [C](./old-problems/2302/c/solution.c) [C++](./old-problems/2302/solution.cpp) |
| [2311. Longest Binary Subsequence Less Than or Equal to K](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) | Medium | [C](./old-problems/2311/c/solution.c) [C++](./old-problems/2311/solution.cpp) |
| [2315. Count Asterisks](https://leetcode.com/problems/count-asterisks/) | Easy | [C](./old-problems/2315/c/solution.c) [C++](./old-problems/2315/solution.cpp) |
| [2317. Maximum XOR After Operations](https://leetcode.com/problems/maximum-xor-after-operations/) | Medium | [C](./old-problems/2317/c/solution.c) [C++](./old-problems/2317/solution.cpp) |
| [2325. Decode the Message](https://leetcode.com/problems/decode-the-message/) | Easy | [C](./old-problems/2325/c/solution.c) [C++](./old-problems/2325/solution.cpp) |
| [2326. Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/) | Medium | [C++](./old-problems/2326/solution.cpp) |
| [2327. Number of People Aware of a Secret](https://leetcode.com/problems/number-of-people-aware-of-a-secret/) | Medium | [C](./old-problems/2327/c/solution.c) [C++](./old-problems/2327/solution.cpp) |
| [2331. Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/) | Easy | [C++](./old-problems/2331/solution.cpp) |
| [2337. Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/) | Medium | [C](./old-problems/2337/c/solution.c) [C++](./old-problems/2337/solution.cpp) |
| [2341. Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/) | Easy | [C](./old-problems/2341/c/solution.c) [C++](./old-problems/2341/solution.cpp) |
| [2342. Max Sum of a Pair With Equal Sum of Digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/) | Medium | [C](./old-problems/2342/c/solution.c) [C++](./old-problems/2342/solution.cpp) |
| [2347. Best Poker Hand](https://leetcode.com/problems/best-poker-hand/) | Easy | [C](./old-problems/2347/c/solution.c) [C++](./old-problems/2347/solution.cpp) |
| [2348. Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/) | Medium | [C](./old-problems/2348/c/solution.c) [C++](./old-problems/2348/solution.cpp) |
| [2351. First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/) | Easy | [C](./old-problems/2351/c/solution.c) [C++](./old-problems/2351/solution.cpp) |
| [2353. Design a Food Rating System](https://leetcode.com/problems/design-a-food-rating-system/) | Medium | [C++](./old-problems/2353/solution.cpp) |
| [2363. Merge Similar Items](https://leetcode.com/problems/merge-similar-items/) | Easy | [C](./old-problems/2363/c/solution.c) [C++](./old-problems/2363/solution.cpp) |
| [2357. Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/) | Easy | [C](./old-problems/2357/c/solution.c) [C++](./old-problems/2357/solution.cpp) |
| [2359. Find Closest Node to Given Two Nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes/) | Medium | [C](./old-problems/2359/c/solution.c) [C++](./old-problems/2359/solution.cpp) |
| [2364. Count Number of Bad Pairs](https://leetcode.com/problems/count-number-of-bad-pairs/) | Medium | [C](./old-problems/2364/c/solution.c) [C++](./old-problems/2364/solution.cpp) |
| [2367. Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/) | Easy | [C](./old-problems/2367/c/solution.c) [C++](./old-problems/2367/solution.cpp) |
| [2370. Longest Ideal Subsequence](https://leetcode.com/problems/longest-ideal-subsequence/) | Medium | [C](./old-problems/2370/c/solution.c) [C++](./old-problems/2370/solution.cpp) |
| [2373. Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix/) | Easy | [C](./old-problems/2373/c/solution.c) [C++](./old-problems/2373/solution.cpp) |
| [2375. Construct Smallest Number From DI String](https://leetcode.com/problems/construct-smallest-number-from-di-string/) | Medium | [C](./old-problems/2375/c/solution.c) [C++](./old-problems/2375/solution.cpp) |
| [2379. Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/) | Easy | [C](./old-problems/2379/c/solution.c) [C++](./old-problems/2379/solution.cpp) |
| [2380. Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/) | Medium | [C++](./old-problems/2380/solution.cpp) |
| [2381. Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/description/) | Medium | [C](./old-problems/2381/c/solution.c) [C++](./old-problems/2381/solution.cpp) |
| [2385. Amount of Time for Binary Tree to Be Infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/) | Medium | [C++](./old-problems/2385/solution.cpp) |
| [2389. Longest Subsequence With Limited Sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum/) | Medium | [C](./old-problems/2389/c/solution.c) [C++](./old-problems/2389/solution.cpp) |
| [2390. Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/) | Medium | [C](./old-problems/2390/c/solution.c) [C++](./old-problems/2390/solution.cpp) |
| [2391. Minimum Amount of Time to Collect Garbage](https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage/) | Medium | [C](./old-problems/2391/c/solution.c) [C++](./old-problems/2391/solution.cpp) |
| [2396. Strictly Palindromic Number](https://leetcode.com/problems/strictly-palindromic-number/) | Medium | [C](./old-problems/2396/c/solution.c) [C++](./old-problems/2396/solution.cpp) |
| [2938. Separate Black and White Balls](https://leetcode.com/problems/separate-black-and-white-balls/) | Medium | [C++](./old-problems/2938/solution.cpp) |
| [2942. Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/) | Easy | [C](./old-problems/2942/c/solution.c) [C++](./old-problems/2942/solution.cpp) |
| [2401. Longest Nice Subarray](https://leetcode.com/problems/longest-nice-subarray/) | Medium | [C](./old-problems/2401/c/solution.c) [C++](./old-problems/2401/solution.cpp) |
| [2402. Meeting Rooms III](https://leetcode.com/problems/meeting-rooms-iii/) | Hard | [C](./old-problems/2402/c/solution.c) [C++](./old-problems/2402/solution.cpp) |
| [2405. Optimal Partition of String](https://leetcode.com/problems/optimal-partition-of-string/) | Medium | [C](./old-problems/2405/c/solution.c) [C++](./old-problems/2405/solution.cpp) |
| [2406. Divide Intervals Into Minimum Number of Groups](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/) | Medium | [C](./old-problems/2406/c/solution.c) [C++](./old-problems/2406/solution.cpp) |
| [2410. Maximum Matching of Players With Trainers](https://leetcode.com/problems/maximum-matching-of-players-with-trainers/) | Medium | [C](./old-problems/2410/c/solution.c) [C++](./old-problems/2410/solution.cpp) |
| [2411. Smallest Subarrays With Maximum Bitwise OR](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) | Medium | [C](./old-problems/2411/c/solution.c) [C++](./old-problems/2411/solution.cpp) |
| [2413. Smallest Even Multiple](https://leetcode.com/problems/smallest-even-multiple/) | Easy | [C](./old-problems/2413/c/solution.c) [C++](./old-problems/2413/solution.cpp) |
| [2415. Reverse Odd Levels of Binary Tree](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/) | Medium | [C++](./old-problems/2415/solution.cpp) |
| [2416. Sum of Prefix Scores of Strings](https://leetcode.com/problems/sum-of-prefix-scores-of-strings/) | Hard | [C](./old-problems/2416/c/solution.c) [C++](./old-problems/2416/solution.cpp) |
| [2418. Sort the People](https://leetcode.com/problems/sort-the-people/) | Easy | [C](./old-problems/2418/c/solution.c) [C++](./old-problems/2418/solution.cpp) |
| [2419. Longest Subarray With Maximum Bitwise AND](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) | Medium | [C](./old-problems/2419/c/solution.c) [C++](./old-problems/2419/solution.cpp) |
| [2423. Remove Letter To Equalize Frequency](https://leetcode.com/problems/remove-letter-to-equalize-frequency/) | Easy | [C](./old-problems/2423/c/solution.c) [C++](./old-problems/2423/solution.cpp) |
| [2424. Longest Uploaded Prefix](https://leetcode.com/problems/longest-uploaded-prefix/) | Medium | [C++](./old-problems/2424/solution.cpp) |
| [2425. Bitwise XOR of All Pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | Medium | [C](./old-problems/2425/c/solution.c) [C++](./old-problems/2425/solution.cpp) |
| [2427. Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/) | Medium | [C](./old-problems/2427/c/solution.c) [C++](./old-problems/2427/solution.cpp) |
| [2428. Maximum Sum of an Hourglass](https://leetcode.com/problems/maximum-sum-of-an-hourglass/) | Medium | [C](./old-problems/2428/c/solution.c) [C++](./old-problems/2428/solution.cpp) |
| [2429. Minimize XOR](https://leetcode.com/problems/minimize-xor/) | Medium | [C](./old-problems/2429/c/solution.c) [C++](./old-problems/2429/solution.cpp) |
| [2433. Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor) | Medium | [C++](./problems/2433/solution.cpp) |
| [2434. Using a Robot to Print the Lexicographically Smallest String](https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string/) | Medium | [C](./old-problems/2434/c/solution.c) [C++](./old-problems/2434/solution.cpp) |
| [2435. Paths in Matrix Whose Sum Is Divisible by K](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/) | Hard | [C](./old-problems/2435/c/solution.c) [C++](./old-problems/2435/solution.cpp) |
| [2441. Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/) | Easy | [C](./old-problems/2441/c/solution.c) [C++](./old-problems/2441/solution.cpp) |
| [2442. Count Number of Distinct Integers After Reverse Operations](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/) | Medium | [C](./old-problems/2442/c/solution.c) [C++](./old-problems/2442/solution.cpp) |
| [2444. Count Subarrays With Fixed Bounds](https://leetcode.com/problems/count-subarrays-with-fixed-bounds/) | Hard | [C](./old-problems/2444/c/solution.c) [C++](./old-problems/2444/solution.cpp) |
| [2460. Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/) | Easy | [C](./old-problems/2460/c/solution.c) [C++](./old-problems/2460/solution.cpp) |
| [2461. Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/) | Medium | [C](./old-problems/2461/c/solution.c) [C++](./old-problems/2461/solution.cpp) |
| [2463. Minimum Total Distance Traveled](https://leetcode.com/problems/minimum-total-distance-traveled/) | Hard | [C++](./old-problems/2463/solution.cpp) |
| [2466. Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/) | Medium | [C](./old-problems/2466/c/solution.c) [C++](./old-problems/2466/solution.cpp) |
| [2467. Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree/) | Medium | [C](./old-problems/2467/c/solution.c) [C++](./old-problems/2467/solution.cpp) |
| [2469. Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/) | Easy | [C](./old-problems/2469/c/solution.c) [C++](./old-problems/2469/solution.cpp) |
| [2475. Number of Unequal Triplets in Array](https://leetcode.com/problems/number-of-unequal-triplets-in-array/) | Easy | [C](./old-problems/2475/c/solution.c) [C++](./old-problems/2475/solution.cpp) |
| [2481. Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/) | Easy | [C](./old-problems/2481/c/solution.c) [C++](./old-problems/2481/solution.cpp) |
| [2482. Difference Between Ones and Zeros in Row and Column](https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/) | Medium | [C](./old-problems/2482/c/solution.c) [C++](./old-problems/2482/solution.cpp) |
| [2485. Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/) | Easy | [C](./old-problems/2485/c/solution.c) [C++](./old-problems/2485/solution.cpp) |
| [2486. Append Characters to String to Make Subsequence](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/) | Medium | [C](./old-problems/2486/c/solution.c) [C++](./old-problems/2486/solution.cpp) |
| [2487. Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/) | Medium | [C++](./old-problems/2487/solution.cpp) |
| [2490. Circular Sentence](https://leetcode.com/problems/circular-sentence/) | Easy | [C](./old-problems/2490/c/solution.c) [C++](./old-problems/2490/solution.cpp) |
| [2491. Divide Players Into Teams of Equal Skill](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/) | Medium | [C](./old-problems/2491/c/solution.c) [C++](./old-problems/2491/solution.cpp) |
| [2493. Divide Nodes Into the Maximum Number of Groups](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/) | Hard | [C++](./old-problems/2493/solution.cpp) |
| [2496. Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/) | Easy | [C](./old-problems/2496/c/solution.c) [C++](./old-problems/2496/solution.cpp) |
| [2497. Maximum Star Sum of a Graph](https://leetcode.com/problems/maximum-star-sum-of-a-graph/) | Medium | [C++](./old-problems/2497/solution.cpp) |
| [2500. Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/) | Easy | [C](./old-problems/2500/c/solution.c) [C++](./old-problems/2500/solution.cpp) |
| [2501. Longest Square Streak in an Array](https://leetcode.com/problems/longest-square-streak-in-an-array/) | Medium | [C](./old-problems/2501/c/solution.c) [C++](./old-problems/2501/solution.cpp) |
| [2503. Maximum Number of Points From Grid Queries](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/) | Hard | [C](./old-problems/2503/c/solution.c) [C++](./old-problems/2503/solution.cpp) |
| [2506. Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/) | Easy | [C++](./old-problems/2506/solution.cpp) |
| [2511. Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/) | Easy | [C](./old-problems/2511/c/solution.c) [C++](./old-problems/2511/solution.cpp) |
| [2516. Take K of Each Character From Left and Right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/) | Medium | [C++](./old-problems/2516/solution.cpp) |
| [2520. Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/) | Easy | [C](./old-problems/2520/c/solution.c) [C++](./old-problems/2520/solution.cpp) |
| [2523. Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/) | Medium | [C](./old-problems/2523/c/solution.c) [C++](./old-problems/2523/solution.cpp) |
| [2525. Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/) | Easy | [C](./old-problems/2525/c/solution.c) [C++](./old-problems/2525/solution.cpp) |
| [2528. Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city/) | Hard | [C](./old-problems/2528/c/solution.c) [C++](./old-problems/2528/solution.cpp) |
| [2529. Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | Easy | [C](./old-problems/2529/c/solution.c) [C++](./old-problems/2529/solution.cpp) |
| [2530. Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/) | Medium | [C++](./old-problems/2530/solution.cpp) |
| [2531. Make Number of Distinct Characters Equal](https://leetcode.com/problems/make-number-of-distinct-characters-equal/) | Medium | [C](./old-problems/2531/c/solution.c) [C++](./old-problems/2531/solution.cpp) |
| [2535. Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/) | Easy | [C](./old-problems/2535/c/solution.c) [C++](./old-problems/2535/solution.cpp) |
| [2537. Count the Number of Good Subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays/) | Medium | [C++](./problems/2537/solution.cpp) |
| [2540. Minimum Common Value](https://leetcode.com/problems/minimum-common-value/) | Easy | [C](./old-problems/2540/c/solution.c) [C++](./old-problems/2540/solution.cpp) |
| [2544. Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum/) | Easy | [C](./old-problems/2544/c/solution.c) [C++](./old-problems/2544/solution.cpp) |
| [2545. Sort the Students by Their Kth Score](https://leetcode.com/problems/sort-the-students-by-their-kth-score/) | Medium | [C](./old-problems/2545/c/solution.c) [C++](./old-problems/2545/solution.cpp) |
| [2349. Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/) | Medium | [C++](./old-problems/2349/solution.cpp) |
| [2551. Put Marbles in Bags](https://leetcode.com/problems/put-marbles-in-bags/) | Hard | [C](./old-problems/2551/c/solution.c) [C++](./old-problems/2551/solution.cpp) |
| [2553. Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array/) | Easy | [C](./old-problems/2553/c/solution.c) [C++](./old-problems/2553/solution.cpp) |
| [2554. Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/) | Medium | [C](./old-problems/2554/c/solution.c) [C++](./old-problems/2554/solution.cpp) |
| [2558. Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/) | Easy | [C++](./problems/2558/solution.cpp) |
| [2559. Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/) | Medium | [C](./old-problems/2559/c/solution.c) [C++](./old-problems/2559/solution.cpp) |
| [2560. House Robber IV](https://leetcode.com/problems/house-robber-iv/) | Medium | [C](./old-problems/2560/c/solution.c) [C++](./old-problems/2560/solution.cpp) |
| [2563. Count the Number of Fair Pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs/) | Medium | [C](./old-problems/2563/c/solution.c) [C++](./old-problems/2563/solution.cpp) |
| [2566. Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/) | Easy | [C](./old-problems/2566/c/solution.c) [C++](./old-problems/2566/solution.cpp) |
| [2570. Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | [C](./old-problems/2570/c/solution.c) [C++](./old-problems/2570/solution.cpp) |
| [2574. Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences/) | Easy | [C](./old-problems/2574/c/solution.c) [C++](./old-problems/2574/solution.cpp) |
| [2577. Minimum Time to Visit a Cell In a Grid](https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/) | Hard | [C++](./problems/2577/solution.cpp) |
| [2578. Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum/) | Easy | [C++](./old-problems/2578/solution.cpp) |
| [2579. Count Total Number of Colored Cells](https://leetcode.com/problems/count-total-number-of-colored-cells/) | Medium | [C](./old-problems/2579/c/solution.c) [C++](./old-problems/2579/solution.cpp) |
| [2582. Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/) | Easy | [C](./old-problems/2582/c/solution.c) [C++](./old-problems/2582/solution.cpp) |
| [2583. Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/) | Medium | [C++](./old-problems/2583/solution.cpp) |
| [2586. Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/) | Easy | [C](./old-problems/2586/c/solution.c) [C++](./old-problems/2586/solution.cpp) |
| [2593. Find Score of an Array After Marking All Elements](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/) | Medium | [C](./old-problems/2593/c/solution.c) [C++](./old-problems/2593/solution.cpp) |
| [2594. Minimum Time to Repair Cars](https://leetcode.com/problems/minimum-time-to-repair-cars/) | Medium | [C](./old-problems/2594/c/solution.c) [C++](./old-problems/2594/solution.cpp) |
| [2595. Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/) | Medium | [C](./old-problems/2595/c/solution.c) [C++](./old-problems/2595/solution.cpp) |
| [2597. The Number of Beautiful Subsets](https://leetcode.com/problems/the-number-of-beautiful-subsets/) | Medium | [C](./old-problems/2597/c/solution.c) [C++](./old-problems/2597/solution.cpp) |
| [2598. Smallest Missing Non-negative Integer After Operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) | Medium | [C](./old-problems/2598/c/solution.c) [C++](./old-problems/2598/solution.cpp) |
| [2601. Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation/) | Medium | [C](./old-problems/2601/c/solution.c) [C++](./old-problems/2601/solution.cpp) |
| [2605. Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/) | Easy | [C](./old-problems/2605/c/solution.c) [C++](./old-problems/2605/solution.cpp) |
| [2610. Convert an Array Into a 2D Array With Conditions](https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions) | Medium | [C++](./problems/2610/solution.cpp) |
| [2616. Minimize the Maximum Difference of Pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/) | Medium | [C](./old-problems/2616/c/solution.c) [C++](./old-problems/2616/solution.cpp) |
| [2640. Find the Score of All Prefixes of an Array](https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/) | Medium | [C++](./old-problems/2640/solution.cpp) |
| [2641. Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/) | Medium | [C++](./old-problems/2641/solution.cpp) |
| [2642. Design Graph With Shortest Path Calculator](https://leetcode.com/problems/design-graph-with-shortest-path-calculator) | Hard | [C++](./old-problems/2642/solution.cpp) |
| [2643. Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/) | Easy | [C](./old-problems/2643/c/solution.c) [C++](./old-problems/2643/solution.cpp) |
| [2651. Calculate Delayed Arrival Time](https://leetcode.com/problems/calculate-delayed-arrival-time/) | Easy | [C](./old-problems/2651/c/solution.c) [C++](./old-problems/2651/solution.cpp) |
| [2652. Sum Multiples](https://leetcode.com/problems/sum-multiples/) | Easy | [C](./old-problems/2652/c/solution.c) [C++](./old-problems/2652/solution.cpp) |
| [2654. Minimum Number of Operations to Make All Array Elements Equal to 1](https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/) | Medium | [C](./old-problems/2654/c/solution.c) [C++](./old-problems/2654/solution.cpp) |
| [2656. Maximum Sum With Exactly K Elements](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/) | Easy | [C](./old-problems/2656/c/solution.c) [C++](./old-problems/2656/solution.cpp) |
| [2657. Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | Medium | [C](./old-problems/2657/c/solution.c) [C++](./old-problems/2657/solution.cpp) |
| [2658. Maximum Number of Fish in a Grid](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/) | Medium | [C](./old-problems/2658/c/solution.c) [C++](./old-problems/2658/solution.cpp) |
| [2661. First Completely Painted Row or Column](https://leetcode.com/problems/first-completely-painted-row-or-column/) | Medium | [C](./old-problems/2661/c/solution.c) [C++](./old-problems/2661/solution.cpp) |
| [2670. Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/) | Easy | [C](./old-problems/2670/c/solution.c) [C++](./old-problems/2670/solution.cpp) |
| [2678. Number of Senior Citizens](https://leetcode.com/problems/number-of-senior-citizens/) | Easy | [C](./old-problems/2678/c/solution.c) [C++](./old-problems/2678/solution.cpp) |
| [2683. Neighboring Bitwise XOR](https://leetcode.com/problems/neighboring-bitwise-xor/) | Medium | [C](./old-problems/2683/c/solution.c) [C++](./old-problems/2683/solution.cpp) |
| [2684. Maximum Number of Moves in a Grid](https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/) | Medium | [C](./old-problems/2684/c/solution.c) [C++](./old-problems/2684/solution.cpp) |
| [2685. Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components/) | Medium | [C++](./old-problems/2685/solution.cpp) |
| [2696. Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/) | Easy | [C](./old-problems/2696/c/solution.c) [C++](./old-problems/2696/solution.cpp) |
| [2697. Lexicographically Smallest Palindrome](https://leetcode.com/problems/lexicographically-smallest-palindrome/) | Easy | [C](./old-problems/2697/c/solution.c) [C++](./old-problems/2697/solution.cpp) |
| [2698. Find the Punishment Number of an Integer](https://leetcode.com/problems/find-the-punishment-number-of-an-integer/) | Medium | [C](./old-problems/2698/c/solution.c) [C++](./old-problems/2698/solution.cpp) |
| [2706. Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/) | Easy | [C](./old-problems/2706/c/solution.c) [C++](./old-problems/2706/solution.cpp) |
| [2707. Extra Characters in a String](https://leetcode.com/problems/extra-characters-in-a-string/) | Medium | [C](./old-problems/2707/c/solution.c) [C++](./old-problems/2707/solution.cpp) |
| [2710. Remove Trailing Zeros From a String](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/) | Easy | [C](./old-problems/2710/c/solution.c) [C++](./old-problems/2710/solution.cpp) |
| [2716. Minimize String Length](https://leetcode.com/problems/minimize-string-length/) | Easy | [C](./old-problems/2716/c/solution.c) [C++](./old-problems/2716/solution.cpp) |
| [2733. Neither Minimum nor Maximum](https://leetcode.com/problems/neither-minimum-nor-maximum/) | Easy | [C](./old-problems/2733/c/solution.c) [C++](./old-problems/2733/solution.cpp) |
| [2742. Painting the Walls](https://leetcode.com/problems/painting-the-walls) | Hard | [C++](./problems/2742/solution.cpp) |
| [2744. Find Maximum Number of String Pairs](https://leetcode.com/problems/find-maximum-number-of-string-pairs/) | Easy | [C](./old-problems/2744/c/solution.c) [C++](./old-problems/2744/solution.cpp) |
| [2747. Count Zero Request Servers](https://leetcode.com/problems/count-zero-request-servers/) | Medium | [C](./old-problems/2747/c/solution.c) [C++](./old-problems/2747/solution.cpp) |
| [2748. Number of Beautiful Pairs](https://leetcode.com/problems/number-of-beautiful-pairs/) | Easy | [C](./old-problems/2748/c/solution.c) [C++](./old-problems/2748/solution.cpp) |
| [2749. Minimum Operations to Make the Integer Zero](https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero/) | Medium | [C](./old-problems/2749/c/solution.c) [C++](./old-problems/2749/solution.cpp) |
| [2751. Robot Collisions](https://leetcode.com/problems/robot-collisions/) | Hard | [C](./old-problems/2751/c/solution.c) [C++](./old-problems/2751/solution.cpp) |
| [2762. Continuous Subarrays](https://leetcode.com/problems/continuous-subarrays/) | Medium | [C](./old-problems/2762/c/solution.c) [C++](./old-problems/2762/solution.cpp) |
| [2769. Find the Maximum Achievable Number](https://leetcode.com/problems/find-the-maximum-achievable-number/) | Easy | [C](./old-problems/2769/c/solution.c) [C++](./old-problems/2769/solution.cpp) |
| [2770. Maximum Number of Jumps to Reach the Last Index](https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index/) | Medium | [C](./old-problems/2770/c/solution.c) [C++](./old-problems/2770/solution.cpp) |
| [2778. Sum of Squares of Special Elements](https://leetcode.com/problems/sum-of-squares-of-special-elements/) | Easy | [C](./old-problems/2778/c/solution.c) [C++](./old-problems/2778/solution.cpp) |
| [2779. Maximum Beauty of an Array After Applying Operation](https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/) | Medium | [C](./old-problems/2779/c/solution.c) [C++](./old-problems/2779/solution.cpp) |
| [2780. Minimum Index of a Valid Split](https://leetcode.com/problems/minimum-index-of-a-valid-split/description/) | Medium | [C](./old-problems/2780/c/solution.c) [C++](./old-problems/2780/solution.cpp) |
| [2785. Sort Vowels in a String](https://leetcode.com/problems/sort-vowels-in-a-string) | Medium | [C](./old-problems/2785/c/solution.c) [C++](./old-problems/2785/solution.cpp) |
| [2788. Split Strings by Separator](https://leetcode.com/problems/split-strings-by-separator/) | Easy | [C](./old-problems/2788/c/solution.c) [C++](./old-problems/2788/solution.cpp) |
| [2798. Number of Employees Who Met the Target](https://leetcode.com/problems/number-of-employees-who-met-the-target/) | Easy | [C](./old-problems/2798/c/solution.c) [C++](./old-problems/2798/solution.cpp) |
| [2799. Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/) | Medium | [C](./old-problems/2799/c/solution.c) [C++](./old-problems/2799/solution.cpp) |
| [2807. Insert Greatest Common Divisors in Linked List](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/) | Medium | [C++](./old-problems/2807/solution.cpp) |
| [2810. Faulty Keyboard](https://leetcode.com/problems/faulty-keyboard/) | Easy | [C](./old-problems/2810/c/solution.c) [C++](./old-problems/2810/solution.cpp) |
| [2812. Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid/) | Medium | [C++](./problems/2812/solution.cpp) |
| [2816. Double a Number Represented as a Linked List](https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/) | Medium | [C++](./old-problems/2816/solution.cpp) |
| [2818. Apply Operations to Maximize Score](https://leetcode.com/problems/apply-operations-to-maximize-score/) | Hard | [C++](./old-problems/2818/solution.cpp) |
| [2824. Count Pairs Whose Sum is Less than Target](https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/) | Easy | [C](./old-problems/2824/c/solution.c) [C++](./old-problems/2824/solution.cpp) |
| [2825. Make String a Subsequence Using Cyclic Increments](https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/) | Medium | [C](./old-problems/2825/c/solution.c) [C++](./old-problems/2825/solution.cpp) |
| [2828. Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/) | Easy | [C++](./old-problems/2828/solution.cpp) |
| [2843. Count Symmetric Integers](https://leetcode.com/problems/count-symmetric-integers/) | Easy | [C](./old-problems/2843/c/solution.c) [C++](./old-problems/2843/solution.cpp) |
| [2848. Points That Intersect With Cars](https://leetcode.com/problems/points-that-intersect-with-cars/) | Easy | [C](./old-problems/2848/c/solution.c) [C++](./old-problems/2848/solution.cpp) |
| [2845. Count of Interesting Subarrays](https://leetcode.com/problems/count-of-interesting-subarrays/) | Medium | [C++](./problems/2845/solution.cpp) |
| [2849. Determine if a Cell Is Reachable at a Given Time](https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time) | Medium | [C](./old-problems/2849/c/solution.c) [C++](./old-problems/2849/solution.cpp) |
| [2859. Sum of Values at Indices With K Set Bits](https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/) | Easy | [C](./old-problems/2859/c/solution.c) [C++](./old-problems/2849/solution.cpp) |
| [2864. Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/) | Easy | [C](./old-problems/2864/c/solution.c) [C++](./old-problems/2864/solution.cpp) |
| [2870. Minimum Number of Operations to Make Array Empty](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/) | Medium | [C++](./problems/2870/solution.cpp) |
| [2872. Maximum Number of K-Divisible Components](https://leetcode.com/problems/maximum-number-of-k-divisible-components/) | Hard | [C](./old-problems/2872/c/solution.c) [C++](./old-problems/2872/solution.cpp) |
| [2873. Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/) | Easy | [C](./old-problems/2873/c/solution.c) [C++](./old-problems/2873/solution.cpp) |
| [2874. Maximum Value of an Ordered Triplet II](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/) | Medium | [C](./old-problems/2874/c/solution.c) [C++](./old-problems/2874/solution.cpp) |
| [2894. Divisible and Non-divisible Sums Difference](https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/) | Easy | [C](./old-problems/2894/c/solution.c) [C++](./old-problems/2894/solution.cpp) |
| [2900. Longest Unequal Adjacent Groups Subsequence I](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/) | Easy | [C](./old-problems/2900/c/solution.c) [C++](./old-problems/2900/solution.cpp) |
| [2901. Longest Unequal Adjacent Groups Subsequence II](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/) | Medium | [C](./old-problems/2901/c/solution.c) [C++](./old-problems/2901/solution.cpp) |
| [2913. Subarrays Distinct Element Sum of Squares I](https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/) | Easy | [C](./old-problems/2913/c/solution.c) [C++](./old-problems/2913/solution.cpp) |
| [2914. Minimum Number of Changes to Make Binary String Beautiful](https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/) | Medium | [C](./old-problems/2914/c/solution.c) [C++](./old-problems/2914/solution.cpp) |
| [2917. Find the K-or of an Array](https://leetcode.com/problems/find-the-k-or-of-an-array/) | Easy | [C++](./old-problems/2917/solution.cpp) |
| [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/) | Medium | [C](./old-problems/2918/c/solution.c) [C++](./old-problems/2918/solution.cpp) |
| [2923. Find Champion I](https://leetcode.com/problems/find-champion-i/) | Easy | [C](./old-problems/2923/c/solution.c) [C++](./old-problems/2923/solution.cpp) |
| [2924. Find Champion II](https://leetcode.com/problems/find-champion-ii/description/) | Medium | [C](./old-problems/2924/c/solution.c) [C++](./old-problems/2924/solution.cpp) |
| [2928. Distribute Candies Among Children I](https://leetcode.com/problems/distribute-candies-among-children-i/) | Easy | [C](./old-problems/2928/c/solution.c) [C++](./old-problems/2928/solution.cpp) |
| [2932. Maximum Strong Pair XOR I](https://leetcode.com/problems/maximum-strong-pair-xor-i/) | Easy | [C](./old-problems/2932/c/solution.c) [C++](./old-problems/2932/solution.cpp) |
| [2938. Separate Black and White Balls](https://leetcode.com/problems/separate-black-and-white-balls/) | Medium | [C++](./old-problems/2938/solution.cpp) |
| [2940. Find Building Where Alice and Bob Can Meet](https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/) | Hard | [C](./old-problems/2940/c/solution.c) [C++](./old-problems/2940/solution.cpp) |
| [2948. Make Lexicographically Smallest Array by Swapping Elements](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/) | Medium | [C](./old-problems/2948/c/solution.c) [C++](./old-problems/2948/solution.cpp) |
| [2951. Find the Peaks](https://leetcode.com/problems/find-the-peaks/) | Easy | [C](./old-problems/2951/c/solution.c) [C++](./old-problems/2951/solution.cpp) |
| [2956. Find Common Elements Between Two Arrays](https://leetcode.com/problems/find-common-elements-between-two-arrays/) | Easy | [C](./old-problems/2956/c/solution.c) [C++](./old-problems/2956/solution.cpp) |
| [2958. Length of Longest Subarray With at Most K Frequency](https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/) | Medium | [C++](./problems/2958/solution.cpp) |
| [2960. Count Tested Devices After Test Operations](https://leetcode.com/problems/count-tested-devices-after-test-operations/) | Easy | [C](./old-problems/2960/c/solution.c) [C++](./old-problems/2960/solution.cpp) |
| [2962. Count Subarrays Where Max Element Appears at Least K Times](https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times/) | Medium | [C](./old-problems/2962/c/solution.c) [C++](./old-problems/2962/solution.cpp) |
| [2965. Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/) | Easy | [C](./old-problems/2965/c/solution.c) [C++](./old-problems/2965/solution.cpp) |
| [2966. Divide Array Into Arrays With Max Difference](https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/) | Medium | [C](./old-problems/2966/c/solution.c) [C++](./old-problems/2966/solution.cpp) |
| [2971. Find Polygon With the Largest Perimeter](https://leetcode.com/problems/find-polygon-with-the-largest-perimeter/) | Medium | [C](./old-problems/2971/c/solution.c) [C++](./old-problems/2971/solution.cpp) |
| [2974. Minimum Number Game](https://leetcode.com/problems/minimum-number-game/) | Easy | [C](./old-problems/2974/c/solution.c) [C++](./old-problems/2974/solution.cpp) |
| [2981. Find Longest Special Substring That Occurs Thrice I](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/) | Medium | [C](./old-problems/2981/c/solution.c) [C++](./old-problems/2981/solution.cpp) |
| [2997. Minimum Number of Operations to Make Array XOR Equal to K](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/) | Medium | [C](./old-problems/2997/c/solution.c) [C++](./old-problems/2997/solution.cpp) |
| [2998. Minimum Number of Operations to Make X and Y Equal](https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal/) | Medium | [C](./old-problems/2998/c/solution.c) [C++](./old-problems/2998/solution.cpp) |
| [2999. Count the Number of Powerful Integers](https://leetcode.com/problems/count-the-number-of-powerful-integers/) | Medium | [C](./old-problems/2999/c/solution.c) [C++](./old-problems/2999/solution.cpp) |
| [3000. Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/) | Easy | [C](./old-problems/3000/c/solution.c) [C++](./old-problems/3000/solution.cpp) |
| [3005. Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/) | Easy | [C++](./old-problems/3005/solution.cpp) |
| [3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K](https://leetcode.com/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/) | Medium | [C](./old-problems/3007/c/solution.c) [C++](./old-problems/3007/solution.cpp) |
| [3011. Find if Array Can Be Sorted](https://leetcode.com/problems/find-if-array-can-be-sorted/) | Medium | [C](./old-problems/3011/c/solution.c) [C++](./old-problems/3011/solution.cpp) |
| [3016. Minimum Number of Pushes to Type Word II](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/description) | Medium | [C](./old-problems/3016/c/solution.c) [C++](./old-problems/3016/solution.cpp) |
| [3019. Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys/) | Easy | [C](./old-problems/3019/c/solution.c) [C++](./old-problems/3019/solution.cpp) |
| [3021. Alice and Bob Playing Flower Game](https://leetcode.com/problems/alice-and-bob-playing-flower-game/) | Medium | [C](./old-problems/3021/c/solution.c) [C++](./old-problems/3021/solution.cpp) |
| [3024. Type of Triangle](https://leetcode.com/problems/type-of-triangle/) | Easy | [C](./old-problems/3024/c/solution.c) [C++](./old-problems/3024/solution.cpp) |
| [3025. Find the Number of Ways to Place People I](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i/) | Medium | [C](./old-problems/3025/c/solution.c) [C++](./old-problems/3025/solution.cpp) |
| [3027. Find the Number of Ways to Place People II](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/) | Hard | [C](./old-problems/3027/c/solution.c) [C++](./old-problems/3027/solution.cpp) |
| [3028. Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/) | Easy | [C](./old-problems/3028/c/solution.c) [C++](./old-problems/3028/solution.cpp) |
| [3042. Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/) | Easy | [C](./old-problems/3042/c/solution.c) [C++](./old-problems/3042/solution.cpp) |
| [3043. Find the Length of the Longest Common Prefix](https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/) | Medium | [C++](./problems/3043/solution.cpp) |
| [3046. Split the Array](https://leetcode.com/problems/split-the-array/) | Easy | [C](./old-problems/3046/c/solution.c) [C++](./old-problems/3046/solution.cpp) |
| [3065. Minimum Operations to Exceed Threshold Value I](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/) | Easy | [C](./old-problems/3065/c/solution.c) [C++](./old-problems/3065/solution.cpp) |
| [3066. Minimum Operations to Exceed Threshold Value II](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii/) | Medium | [C++](./problems/3066/solution.cpp) |
| [3068. Find the Maximum Sum of Node Values](https://leetcode.com/problems/find-the-maximum-sum-of-node-values/) | Hard | [C](./old-problems/3068/c/solution.c) [C++](./old-problems/3068/solution.cpp) |
| [3075. Maximize Happiness of Selected Children](https://leetcode.com/problems/maximize-happiness-of-selected-children/) | Medium | [C](./old-problems/3075/c/solution.c) [C++](./old-problems/3075/solution.cpp) |
| [3079. Find the Sum of Encrypted Integers](https://leetcode.com/problems/find-the-sum-of-encrypted-integers/) | Easy | [C](./old-problems/3079/c/solution.c) [C++](./old-problems/3079/solution.cpp) |
| [3085. Minimum Deletions to Make String K-Special](https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/) | Medium | [C](./old-problems/3085/c/solution.c) [C++](./old-problems/3085/solution.cpp) |
| [3097. Shortest Subarray With OR at Least K II](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/) | Medium | [C](./old-problems/3097/c/solution.c) [C++](./old-problems/3097/solution.cpp) |
| [3099. Harshad Number](https://leetcode.com/problems/harshad-number/) | Easy | [C](./old-problems/3099/c/solution.c) [C++](./old-problems/3099/solution.cpp) |
| [3100. Water Bottles II](https://leetcode.com/problems/water-bottles-ii/) | Medium | [C](./old-problems/3100/c/solution.c) [C++](./old-problems/3100/solution.cpp) |
| [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/) | Easy | [C](./old-problems/3105/c/solution.c) [C++](./old-problems/3105/solution.cpp) |
| [3108. Minimum Cost Walk in Weighted Graph](https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/) | Hard | [C](./old-problems/3108/c/solution.c) [C++](./old-problems/3108/solution.cpp) |
| [3110. Score of a String](https://leetcode.com/problems/score-of-a-string/) | Easy | [C](./old-problems/3110/c/solution.c) [C++](./old-problems/3110/solution.cpp) |
| [3131. Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/) | Easy | [C](./old-problems/3131/c/solution.c) [C++](./old-problems/3131/solution.cpp) |
| [3133. Minimum Array End](https://leetcode.com/problems/minimum-array-end/) | Medium | [C](./old-problems/3133/c/solution.c) [C++](./old-problems/3133/solution.cpp) |
| [3136. Valid Word](https://leetcode.com/problems/valid-word/) | Easy | [C](./old-problems/3136/c/solution.c) [C++](./old-problems/3136/solution.cpp) |
| [3137. Minimum Number of Operations to Make Word K-Periodic](https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic/) | Medium | [C++](./old-problems/3137/solution.cpp) |
| [3146. Permutation Difference between Two Strings](https://leetcode.com/problems/permutation-difference-between-two-strings/) | Easy | [C](./old-problems/3146/c/solution.c) [C++](./old-problems/3146/solution.cpp) |
| [3147. Taking Maximum Energy From the Mystic Dungeon](https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/) | Medium | [C](./old-problems/3147/c/solution.c) [C++](./old-problems/3147/solution.cpp) |
| [3151. Special Array I](https://leetcode.com/problems/special-array-i/) | Easy | [C](./old-problems/3151/c/solution.c) [C++](./old-problems/3151/solution.cpp) |
| [3152. Special Array II](https://leetcode.com/problems/special-array-ii/) | Medium | [C++](./old-problems/3152/solution.cpp) |
| [3158. Find the XOR of Numbers Which Appear Twice](https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/) | Easy | [C](./old-problems/3158/c/solution.c) [C++](./old-problems/3158/solution.cpp) |
| [3159. Find Occurrences of an Element in an Array](https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array/) | Medium | [C](./old-problems/3159/c/solution.c) [C++](./old-problems/3159/solution.cpp) |
| [3160. Find the Number of Distinct Colors Among the Balls](https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/) | Medium | [C++](./old-problems/3160/solution.cpp) |
| [3162. Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/) | Easy | [C](./old-problems/3162/c/solution.c) [C++](./old-problems/3162/solution.cpp) |
| [3174. Clear Digits](https://leetcode.com/problems/clear-digits/) | Easy | [C](./old-problems/3174/c/solution.c) [C++](./old-problems/3174/solution.cpp) |
| [3163. String Compression III](https://leetcode.com/problems/string-compression-iii/description/) | Medium | [C](./old-problems/3163/c/solution.c) [C++](./old-problems/3163/solution.cpp) |
| [3168. Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/) | Easy | [C](./old-problems/3168/c/solution.c) [C++](./old-problems/3168/solution.cpp) |
| [3169. Count Days Without Meetings](https://leetcode.com/problems/count-days-without-meetings/description/) | Medium | [C](./old-problems/3169/c/solution.c) [C++](./old-problems/3169/solution.cpp) |
| [3170. Lexicographically Minimum String After Removing Stars](https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars/) | Medium | [C](./old-problems/3170/c/solution.c) [C++](./old-problems/3170/solution.cpp) |
| [3184. Count Pairs That Form a Complete Day I](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/) | Easy | [C](./old-problems/3184/c/solution.c) [C++](./old-problems/3184/solution.cpp) |
| [3186. Maximum Total Damage With Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/) | Medium | [C](./old-problems/3186/c/solution.c) [C++](./old-problems/3186/solution.cpp) |
| [3190. Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/) | Easy | [C](./old-problems/3190/c/solution.c) [C++](./old-problems/3190/solution.cpp) |
| [3191. Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/) | Medium | [C](./old-problems/3191/c/solution.c) [C++](./old-problems/3191/solution.cpp) |
| [3194. Minimum Average of Smallest and Largest Elements](https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/) | Easy | [C](./old-problems/3194/c/solution.c) [C++](./old-problems/3194/solution.cpp) |
| [3195. Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/) | Medium | [C](./old-problems/3195/c/solution.c) [C++](./old-problems/3195/solution.cpp) |
| [3201. Find the Maximum Length of Valid Subsequence I](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i/) | Medium | [C](./old-problems/3201/c/solution.c) [C++](./old-problems/3201/solution.cpp) |
| [3202. Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/) | Medium | [C](./old-problems/3202/c/solution.c) [C++](./old-problems/3202/solution.cpp) |
| [3211. Generate Binary Strings Without Adjacent Zeros](https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/) | Medium | [C](./old-problems/3211/c/solution.c) [C++](./old-problems/3211/solution.cpp) |
| [3217. Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/) | Medium | [C++](./old-problems/3217/solution.cpp) |
| [3223. Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/) | Medium | [C](./old-problems/3223/c/solution.c) [C++](./old-problems/3223/solution.cpp) |
| [3227. Vowels Game in a String](https://leetcode.com/problems/vowels-game-in-a-string/) | Medium | [C](./old-problems/3227/c/solution.c) [C++](./old-problems/3227/solution.cpp) |
| [3228. Maximum Number of Operations to Move Ones to the End](https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/) | Medium | [C](./old-problems/3228/c/solution.c) [C++](./old-problems/3228/solution.cpp) |
| [3232. Find if Digit Game Can Be Won](https://leetcode.com/problems/find-if-digit-game-can-be-won/) | Easy | [C](./old-problems/3232/c/solution.c) [C++](./old-problems/3232/solution.cpp) |
| [3239. Minimum Number of Flips to Make Binary Grid Palindromic I](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/) | Medium | [C](./old-problems/3239/c/solution.c) [C++](./old-problems/3239/solution.cpp) |
| [3242. Design Neighbor Sum Service](https://leetcode.com/problems/design-neighbor-sum-service/) | Easy | [C++](./old-problems/3242/solution.cpp) |
| [3243. Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/) | Medium | [C++](./problems/3243/solution.cpp) |
| [3248. Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/) | Easy | [C](./old-problems/3248/c/solution.c) [C++](./old-problems/3248/solution.cpp) |
| [3254. Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | Medium | [C](./old-problems/3254/c/solution.c) [C++](./old-problems/3254/solution.cpp) |
| [3258. Count Substrings That Satisfy K-Constraint I](https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/) | Easy | [C](./old-problems/3258/c/solution.c) [C++](./old-problems/3258/solution.cpp) |
| [3264. Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/) | Easy | [C](./old-problems/3264/c/solution.c) [C++](./old-problems/3264/solution.cpp) |
| [3270. Find the Key of the Numbers](https://leetcode.com/problems/find-the-key-of-the-numbers/) | Easy | [C](./old-problems/3270/c/solution.c) [C++](./old-problems/3270/solution.cpp) |
| [3271. Hash Divided String](https://leetcode.com/problems/hash-divided-string/) | Medium | [C](./old-problems/3271/c/solution.c) [C++](./old-problems/3271/solution.cpp) |
| [3272. Find the Count of Good Integers](https://leetcode.com/problems/find-the-count-of-good-integers/) | Hard | [C++](./problems/3272/solution.cpp) |
| [3280. Convert Date to Binary](https://leetcode.com/problems/convert-date-to-binary/) | Easy | [C](./old-problems/3280/c/solution.c) [C++](./old-problems/3280/solution.cpp) |
| [3285. Find Indices of Stable Mountains](https://leetcode.com/problems/find-indices-of-stable-mountains/) | Easy | [C](./old-problems/3285/c/solution.c) [C++](./old-problems/3285/solution.cpp) |
| [3289. The Two Sneaky Numbers of Digitville](https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/) | Easy | [C](./old-problems/3289/c/solution.c) [C++](./old-problems/3289/solution.cpp) |
| [3300. Minimum Element After Replacement With Digit Sum](https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/) | Easy | [C++](./old-problems/3300/solution.cpp) |
| [3304. Find the K-th Character in String Game I](https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/) | Easy | [C](./old-problems/3304/c/solution.c) [C++](./old-problems/3304/solution.cpp) |
| [3307. Find the K-th Character in String Game II](https://leetcode.com/problems/find-the-k-th-character-in-string-game-ii/) | Hard | [C](./old-problems/3307/c/solution.c) [C++](./old-problems/3307/solution.cpp) |
| [3314. Construct the Minimum Bitwise Array I](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/) | Easy | [C](./old-problems/3314/c/solution.c) [C++](./old-problems/3314/solution.cpp) |
| [3318. Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/) | Easy | [C](./old-problems/3318/c/solution.c) [C++](./old-problems/3318/solution.cpp) |
| [3324. Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/) | Medium | [C](./old-problems/3324/c/solution.c) [C++](./old-problems/3324/solution.cpp) |
| [3330. Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/) | Easy | [C](./old-problems/3330/c/solution.c) [C++](./old-problems/3330/solution.cpp) |
| [3335. Total Characters in String After Transformations I](https://leetcode.com/problems/total-characters-in-string-after-transformations-i/) | Medium | [C](./old-problems/3335/c/solution.c) [C++](./old-problems/3335/solution.cpp) |
| [3337. Total Characters in String After Transformations II](https://leetcode.com/problems/total-characters-in-string-after-transformations-ii/) | Hard | [C++](./old-problems/3337/solution.cpp) |
| [3340. Check Balanced String](https://leetcode.com/problems/check-balanced-string/) | Easy | [C](./old-problems/3340/c/solution.c) [C++](./old-problems/3340/solution.cpp) |
| [3341. Find Minimum Time to Reach Last Room I](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/) | Medium | [C](./old-problems/3341/c/solution.c) [C++](./old-problems/3341/solution.cpp) |
| [3342. Find Minimum Time to Reach Last Room II](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/) | Medium | [C](./old-problems/3342/c/solution.c) [C++](./old-problems/3342/solution.cpp) |
| [3343. Count Number of Balanced Permutations](https://leetcode.com/problems/count-number-of-balanced-permutations/) | Hard | [C++](./old-problems/3343/solution.cpp) |
| [3346. Maximum Frequency of an Element After Performing Operations I](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/) | Medium | [C](./old-problems/3346/c/solution.c) [C++](./old-problems/3346/solution.cpp) |
| [3347. Maximum Frequency of an Element After Performing Operations II](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/) | Hard | [C](./old-problems/3347/c/solution.c) [C++](./old-problems/3347/solution.cpp) |
| [3349. Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/) | Easy | [C](./old-problems/3349/c/solution.c) [C++](./old-problems/3349/solution.cpp) |
| [3350. Adjacent Increasing Subarrays Detection II](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/) | Medium | [C](./old-problems/3350/c/solution.c) [C++](./old-problems/3350/solution.cpp) |
| [3354. Make Array Elements Equal to Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero/) | Easy | [C](./old-problems/3354/c/solution.c) [C++](./old-problems/3354/solution.cpp) |
| [3355. Zero Array Transformation I](https://leetcode.com/problems/zero-array-transformation-i/) | Medium | [C](./old-problems/3355/c/solution.c) [C++](./old-problems/3355/solution.cpp) |
| [3356. Zero Array Transformation II](https://leetcode.com/problems/zero-array-transformation-ii/) | Medium | [C](./old-problems/3356/c/solution.c) [C++](./old-problems/3356/solution.cpp) |
| [3362. Zero Array Transformation III](https://leetcode.com/problems/zero-array-transformation-iii/) | Medium | [C](./old-problems/3362/c/solution.c) [C++](./old-problems/3362/solution.cpp) |
| [3370. Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/) | Easy | [C](./old-problems/3370/c/solution.c) [C++](./old-problems/3370/solution.cpp) |
| [3375. Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/) | Easy | [C](./old-problems/3375/c/solution.c) [C++](./old-problems/3375/solution.cpp) |
| [3381. Maximum Subarray Sum With Length Divisible by K](https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/) | Medium | [C](./old-problems/3381/c/solution.c) [C++](./old-problems/3381/solution.cpp) |
| [3392. Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/) | Easy | [C](./old-problems/3392/c/solution.c) [C++](./old-problems/3392/solution.cpp) |
| [3405. Count the Number of Arrays with K Matching Adjacent Elements](https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/) | Hard | [C](./old-problems/3405/c/solution.c) [C++](./old-problems/3405/solution.cpp) |
| [3396. Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/) | Easy | [C](./old-problems/3396/c/solution.c) [C++](./old-problems/3396/solution.cpp) |
| [3397. Maximum Number of Distinct Elements After Operations](https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/) | Medium | [C](./old-problems/3397/c/solution.c) [C++](./old-problems/3397/solution.cpp) |
| [3403. Find the Lexicographically Largest String From the Box I](https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-i/) | Medium | [C](./old-problems/3403/c/solution.c) [C++](./old-problems/3403/solution.cpp) |
| [3408. Design Task Manager](https://leetcode.com/problems/design-task-manager/) | Medium | [C++](./old-problems/3408/solution.cpp) |
| [3423. Maximum Difference Between Adjacent Elements in a Circular Array](https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/) | Easy | [C](./old-problems/3423/c/solution.c) [C++](./old-problems/3423/solution.cpp) |
| [3427. Sum of Variable Length Subarrays](https://leetcode.com/problems/sum-of-variable-length-subarrays/) | Easy | [C](./old-problems/3427/c/solution.c) [C++](./old-problems/3427/solution.cpp) |
| [3432. Count Partitions with Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference/) | Easy | [C](./old-problems/3432/c/solution.c) [C++](./old-problems/3432/solution.cpp) |
| [3439. Reschedule Meetings for Maximum Free Time I](https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-i/) | Medium | [C](./old-problems/3439/c/solution.c) [C++](./old-problems/3439/solution.cpp) |
| [3440. Reschedule Meetings for Maximum Free Time II](https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-ii/) | Medium | [C](./old-problems/3440/c/solution.c) [C++](./old-problems/3440/solution.cpp) |
| [3442. Maximum Difference Between Even and Odd Frequency I](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/) | Easy | [C](./old-problems/3442/c/solution.c) [C++](./old-problems/3442/solution.cpp) |
| [3443. Maximum Manhattan Distance After K Changes](https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes/) | Medium | [C](./old-problems/3443/c/solution.c) [C++](./old-problems/3443/solution.cpp) |
| [3445. Maximum Difference Between Even and Odd Frequency II](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-ii/) | Hard | [C](./old-problems/3445/c/solution.c) [C++](./old-problems/3445/solution.cpp) |
| [3446. Sort Matrix by Diagonals](https://leetcode.com/problems/sort-matrix-by-diagonals/) | Medium | [C](./old-problems/3446/c/solution.c) [C++](./old-problems/3446/solution.cpp) |
| [3461. Check If Digits Are Equal in String After Operations I](https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/) | Easy | [C](./old-problems/3461/c/solution.c) [C++](./old-problems/3461/solution.cpp) |
| [3467. Transform Array by Parity](https://leetcode.com/problems/transform-array-by-parity/) | Easy | [C](./old-problems/3467/c/solution.c) [C++](./old-problems/3467/solution.cpp) |
| [3477. Fruits Into Baskets II](https://leetcode.com/problems/fruits-into-baskets-ii/description/) | Easy | [C](./old-problems/3477/c/solution.c) [C++](./old-problems/3477/solution.cpp) |
| [3484. Design Spreadsheet](https://leetcode.com/problems/design-spreadsheet/) | Medium | [C++](./old-problems/3484/solution.cpp) |
| [3487. Maximum Unique Subarray Sum After Deletion](https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/) | Easy | [C++](./old-problems/3487/solution.cpp) |
| [3492. Maximum Containers on a Ship](https://leetcode.com/problems/maximum-containers-on-a-ship/) | Easy | [C](./old-problems/3492/c/solution.c) [C++](./old-problems/3492/solution.cpp) |
| [3494. Find the Minimum Amount of Time to Brew Potions](https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions/) | Medium | [C](./old-problems/3494/c/solution.c) [C++](./old-problems/3494/solution.cpp) |
| [3498. Reverse Degree of a String](https://leetcode.com/problems/reverse-degree-of-a-string/) | Easy | [C](./old-problems/3498/c/solution.c) [C++](./old-problems/3498/solution.cpp) |
| [3502. Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/) | Easy | [C](./old-problems/3502/c/solution.c) [C++](./old-problems/3502/solution.cpp) |
| [3508. Implement Router](https://leetcode.com/problems/implement-router/) | Medium | [C++](./old-problems/3508/solution.cpp) |
| [3512. Minimum Operations to Make Array Sum Divisible by K](https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/) | Easy | [C](./old-problems/3512/c/solution.c) [C++](./old-problems/3512/solution.cpp) |
| [3516. Find Closest Person](https://leetcode.com/problems/find-closest-person/) | Easy | [C](./old-problems/3516/c/solution.c) [C++](./old-problems/3516/solution.cpp) |
| [3527. Find the Most Common Response](https://leetcode.com/problems/find-the-most-common-response/) | Medium | [C++](./old-problems/3527/solution.cpp) |
| [3541. Find Most Frequent Vowel and Consonant](https://leetcode.com/problems/find-most-frequent-vowel-and-consonant/) | Easy | [C](./old-problems/3541/c/solution.c) [C++](./old-problems/3541/solution.cpp) |
| [3542. Minimum Operations to Convert All Elements to Zero](https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/) | Medium | [C](./old-problems/3542/c/solution.c) [C++](./old-problems/3542/solution.cpp) |
| [3545. Minimum Deletions for At Most K Distinct Characters](https://leetcode.com/problems/minimum-deletions-for-at-most-k-distinct-characters/) | Easy | [C++](./old-problems/3545/solution.cpp) |
| [3550. Smallest Index With Digit Sum Equal to Index](https://leetcode.com/problems/smallest-index-with-digit-sum-equal-to-index/) | Easy | [C](./old-problems/3550/c/solution.c) [C++](./old-problems/3550/solution.cpp) |
| [3602. Hexadecimal and Hexatrigesimal Conversion](https://leetcode.com/problems/hexadecimal-and-hexatrigesimal-conversion/) | Easy | [C](./old-problems/3602/c/solution.c) [C++](./old-problems/3602/solution.cpp) |
| [3658. GCD of Odd and Even Sums](https://leetcode.com/problems/gcd-of-odd-and-even-sums/) | Easy | [C](./old-problems/3658/c/solution.c) [C++](./old-problems/3658/solution.cpp) |
| [3668. Restore Finishing Order](https://leetcode.com/problems/restore-finishing-order/) | Easy | [C](./old-problems/3668/c/solution.c) [C++](./old-problems/3668/solution.cpp) |
| [3683. Earliest Time to Finish One Task](https://leetcode.com/problems/earliest-time-to-finish-one-task/) | Easy | [C](./old-problems/3683/c/solution.c) [C++](./old-problems/3683/solution.cpp) |
| [3684. Maximize Sum of At Most K Distinct Elements](https://leetcode.com/problems/maximize-sum-of-at-most-k-distinct-elements/) | Easy | [C](./old-problems/3684/c/solution.c) [C++](./old-problems/3684/solution.cpp) |
| [3688. Bitwise OR of Even Numbers in an Array](https://leetcode.com/problems/bitwise-or-of-even-numbers-in-an-array/) | Easy | [C](./old-problems/3688/c/solution.c) [C++](./old-problems/3688/solution.cpp) |
| [3701. Compute Alternating Sum](https://leetcode.com/problems/compute-alternating-sum/) | Easy | [C](./old-problems/3701/c/solution.c) [C++](./old-problems/3701/solution.cpp) |
| [3712. Sum of Elements With Frequency Divisible by K](https://leetcode.com/problems/sum-of-elements-with-frequency-divisible-by-k/) | Easy | [C](./old-problems/3712/c/solution.c) [C++](./old-problems/3712/solution.cpp) |
| [3726. Remove Zeros in Decimal Representation](https://leetcode.com/problems/remove-zeros-in-decimal-representation/) | Easy | [C](./old-problems/3726/c/solution.c) [C++](./old-problems/3726/solution.cpp) |
| [3731. Find Missing Elements](https://leetcode.com/problems/find-missing-elements/) | Easy | [C](./old-problems/3731/c/solution.c) [C++](./old-problems/3731/solution.cpp) |
| [3736. Minimum Moves to Equal Array Elements III](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-iii/) | Easy | [C](./old-problems/3736/c/solution.c) [C++](./old-problems/3736/solution.cpp) |
| [3750. Minimum Number of Flips to Reverse Binary String](https://leetcode.com/problems/minimum-number-of-flips-to-reverse-binary-string/) | Easy | [C](./old-problems/3750/c/solution.c) [C++](./old-problems/3750/solution.cpp) |
## License
This project is licensed under the terms of the [MIT License](./LICENSE).
Copyright © 2023-2025 [Alfi Maulana](https://github.com/threeal)