https://github.com/the0cp/leetcode

C++/Shell/SQL source code of solved LeetCode problems.
https://github.com/the0cp/leetcode

algorithm cpp leetcode leetcode-cpp leetcode-solutions

Last synced: 2 months ago
JSON representation

C++/Shell/SQL source code of solved LeetCode problems.

• Host: GitHub
• URL: https://github.com/the0cp/leetcode
• Owner: the0cp
• License: gpl-3.0
• Created: 2024-11-18T02:51:05.000Z (7 months ago)
• Default Branch: main
• Last Pushed: 2025-03-19T04:48:59.000Z (3 months ago)
• Last Synced: 2025-03-19T05:28:13.207Z (3 months ago)
• Topics: algorithm, cpp, leetcode, leetcode-cpp, leetcode-solutions
• Language: C++
• Homepage:
• Size: 523 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Leetcode Solutions

C++/Shell/SQL source code of solved LeetCode problems.

## List

The list is sorted by problem number.

Expand Solution List

- [1. Two Sum](src/1.Two-Sum.cpp)

- [5. Longest Palindromic Substring](src/5.Longest-Palindromic-Substring.cpp)

- [8. String to Integer (atoi)](src/8.String-to-Integer-(atoi).cpp)

- [9. Palindrome Number](src/9.Palindrome-Number.cpp)

- [11. Container With Most Water](src/11.Container-With-Most-Water.cpp)

- [37. Sudoku Solver](src/37.Sudoku-Solver.cpp)

- [41. First Missing Positive](src/41.First-Missing-Positive.cpp)

- [42. Trapping Rain Water](src/42.Trapping-Rain-Water.cpp)

- [51. N Queens](src/51.N-Queens.cpp)

- [52. N Queens II](src/52.N-Queens-II.cpp)

- [62. Unique Paths](src/62.Unique-Paths.cpp)

- [63. Unique Paths II](src/63.Unique-Paths-II.cpp)

- [64. Minimum Path Sum](src/64.Minimum-Path-Sum.cpp)

- [70. Climbing Stairs](src/70.Climbing-Stairs.cpp)

- [72. Edit Distance](src/72.Edit-Distance.cpp)

- [91. Decode Ways](src/91.Decode-Ways.cpp)

- [95. Unique Binary Search Trees II](src/95.Unique-Binary-Search-Trees-II.cpp)

- [96. Unique Binary Search Trees](src/96.Unique-Binary-Search-Trees.cpp)

- [104. Maximum Depth of Binary Tree](src/104.Maximum-Depth-of-Binary-Tree.cpp)

- [115. Distinct Subsequences](src/115.Distinct-Subsequences.cpp)

- [120. Triangle](src/120.Triangle.cpp)

- [121. Buy and Sell Stock](src/121.Buy-and-Sell-Stock.cpp)

- [123. Best Time to Buy and Sell Stock 3](src/123.Best-Time-to-Buy-and-Sell-Stock-3.cpp)

- [124. Binary Tree Maximum Path Sum](src/124.Binary-Tree-Maximum-Path-Sum.cpp)

- [135. Candy](src/135.Candy.cpp)

- [139. Word Break](src/139.Word-Break.cpp)

- [144. Binary Tree Preorder Traversal](src/144.Binary-Tree-Preorder-Traversal.cpp)

- [151. Reverse Words in a String](src/151.Reverse-Words-in-a-String.cpp)

- [188. Best Time to Buy and Sell Stock IV](src/188.Best-Time-to-Buy-and-Sell-Stock-IV.cpp)

- [192. Word Frequenc](src/192.Word-Frequency.sh)

- [193. Valid Phone Number](src/193.Valid-Phone-Numbers.sh)

- [194. Transpose Fil](src/194.Transpose-File.sh)

- [195. Tenth Lin](src/195.Tenth-Line.sh)

- [197. Rising Temperature](src/197.Rising-Temperature.sql)

- [198. House Robber](src/198.House-Robber.cpp)

- [200. Number of Islands](src/200.Number-of-Islands.cpp)

- [206. Reverse Linked List](src/206.Reverse-Linked-List.cpp)

- [221. Maximal Square](src/221.Maximal-Square.cpp)

- [238. Product of Array Except Self](src/238.Product-of-Array-Except-Self.cpp)

- [279. Perfect Squares](src/279.Perfect-Squares.cpp)

- [283. Move Zeroes](src/283.Move-Zeroes.cpp)

- [300. Longest Increasing Subsequence](src/300.Longest-Increasing-Subsequence.cpp)

- [309. Best Time to Buy and Sell Stock with Cooldown](src/309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.cpp)

- [322. Coin Change](src/322.Coin-Change.cpp)

- [328. Odd Even Linked List](src/328.Odd-Even-Linked-List.cpp)

- [334. Increasing Triplet Subsequence](src/334.Increasing-Triplet-Subsequence.cpp)

- [337. House Robber III](src/337.House-Robber-III.cpp)

- [343. Integer Break](src/343.Integer-Break.cpp)

- [345. Reverse Vowels of a String](src/345.Reverse-Vowels-of-a-String.cpp)

- [354. Russian Doll Envelopes](src/354.Russian-Doll-Envelopes.cpp)

- [392. Is Subsequence](src/392.Is-Subsequence.cpp)

- [394. Decode String](src/394.Decode-String.cpp)

- [407. Trapping Rain Water II](src/407.Trapping-Rain-Water-II.cpp)

- [415. Add Strings](src/415.Add-Strings.cpp)

- [443. String Compression](src/443.String-Compression.cpp)

- [455. Assign Cookies](src/455.Assign-Cookies.cpp)

- [474. Ones and Zeroes](src/474.Ones-and-Zeroes.cpp)

- [494. Target Sum](src/494.Target-Sum.cpp)

- [509. Fibonacci Number](src/509.Fibonacci-Number.cpp)

- [515. Find Largest Value in Each Tree Row](src/515.Find-Largest-Value-in-Each-Tree-Row.cpp)

- [516. Longest Palindromic Subsequence](src/516.Longest-Palindromic-Subsequence.cpp)

- [518. Coin Change II](src/518.Coin-Change-II.cpp)

- [570. Managers with at Least 5 Direct Reports](src/570.Managers-with-at-Least-5-Direct-Reports.sql)

- [577. Employee Bonus](src/577.Employee-Bonus.sql)

- [583. Delete Operation for Two Strings](src/583.Delete-Operation-for-Two-Strings.cpp)

- [584. Find Customer Referee](src/584.Find-Customer-Referee.sql)

- [595. Big Countries](src/595.Big-Countries.sql)

- [605. Can Place Flowers](src/605.Can-Place-Flowers.cpp)

- [620. Not Boring Movies](src/620.Not-Boring-Movies.sql)

- [643. Maximum Average Subarray I](src/643.Maximum-Average-Subarray-I.cpp)

- [646. Maximum Length of Pair Chain](src/646.Maximum-Length-of-Pair-Chain.cpp)

- [649. Dota2 Senate](src/649.Dota2-Senate.cpp)

- [673. Number of Longest Increasing Subsequence](src/673.Number-of-Longest-Increasing-Subsequence.cpp)

- [684. Redundant Connection](src/684.Redundant-Connection.cpp)

- [689. Maximum Sum of 3 Non Overlapping Subarrays](src/689.Maximum-Sum-of-3-Non-Overlapping-Subarrays.cpp)

- [712. Minimum ASCII Delete Sum for Two Strings](src/712.Minimum-ASCII-Delete-Sum-for-Two-Strings.cpp)

- [714. Best Time to Buy and Sell Stock with Transaction Fee](src/714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.cpp)

- [724. Find Pivot Index](src/724.Find-Pivot-Index.cpp)

- [735. Asteroid Collision](src/735.Asteroid-Collision.cpp)

- [740. Delete and Earn](src/740.Delete-and-Earn.cpp)

- [746. Min Cost Climbing Stairs](src/746.Min-Cost-Climbing-Stairs.cpp)

- [769. Max Chunks To Make Sorted](src/769.Max-Chunks-To-Make-Sorted.cpp)

- [773. Sliding Puzzle](src/773.Sliding-Puzzle.cpp)

- [790. Domino and Tromino Tiling](src/790.Domino-and-Tromino-Tiling.cpp)

- [802. Find Eventual Safe States](src/802.Find-Eventual-Safe-States.cpp)

- [827. Making A Large Island](src/827.Making-A-Large-Island.cpp)

- [843. Guess the Word](src/843.Guess-the-Word.cpp)

- [872. Leaf Similar Trees](src/872.Leaf-Similar-Trees.cpp)

- [873. Length of Longest Fibonacci Subsequence](src/873.Length-of-Longest-Fibonacci-Subsequence.cpp)

- [889. Construct Binary Tree from Preorder and Postorder Traversal](src/889.Construct-Binary-Tree-from-Preorder-and-Postorder-Traversal.cpp)

- [916. Word Subsets](src/916.Word-Subsets.cpp)

- [931. Minimum Falling Path Sum](src/931.Minimum-Falling-Path-Sum.cpp)

- [933. Number of Recent Calls](src/933.Number-of-Recent-Calls.cpp)

- [983. Minimum Cost For Tickets](src/983.Minimum-Cost-For-Tickets.cpp)

- [1004. Max Consecutive Ones III](src/1004.Max-Consecutive-Ones-III.cpp)

- [1014. Best Sightseeing Pair](src/1014.Best-Sightseeing-Pair.cpp)

- [1027. Longest Arithmetic Subsequence](src/1027.Longest-Arithmetic-Subsequence.cpp)

- [1028. Recover a Tree From Preorder Traversal](src/1028.Recover-a-Tree-From-Preorder-Traversal.cpp)

- [1035. Uncrossed Lines](src/1035.Uncrossed-Lines.cpp)

- [1068. Product Sales Analysis I](src/1068.Product-Sales-Analysis-I.sql)

- [1070. Product Sales Analysis III](src/1070.Product-Sales-Analysis-III.sql)

- [1071. Greatest Common Divisor of Strings](src/1071.Greatest-Common-Divisor-of-Strings.cpp)

- [1072. Flip For Maximum Equal Rows](src/1072.Flip-For-Maximum-Equal-Rows.cpp)

- [1079. Letter Tile Possibilities](src/1079.Letter-Tile-Possibilities.cpp)

- [1092. Shortest Common Supersequence](src/1092.Shortest-Common-Supersequence.cpp)

- [1137. N th Tribonacci Number](src/1137.N-th-Tribonacci-Number.cpp)

- [1143. Longest Common Subsequence](src/1143.Longest-Common-Subsequence.cpp)

- [1148. Article Views I](src/1148.Article-Views-I.sql)

- [1207. Unique Number of Occurrences](src/1207.Unique-Number-of-Occurrences.cpp)

- [1218. Longest Arithmetic Subsequence of Given Difference](src/1218.Longest-Arithmetic-Subsequence-of-Given-Difference.cpp)

- [1261. Find Elements in a Contaminated Binary Tree](src/1261.Find-Elements-in-a-Contaminated-Binary-Tree.cpp)

- [1267. Count Servers that Communicate](src/1267.Count-Servers-that-Communicate.cpp)

- [1312. Minimum Insertion Steps to Make a String Palindrome](src/1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome.cpp)

- [1346. Check If N and Its Double Exist](src/1346.Check-If-N-and-Its-Double-Exist.cpp)

- [1352. Product of the Last K Numbers](src/1352.Product-of-the-Last-K-Numbers.cpp)

- [1358. Number of Substrings Containing All Three Characters](src/1358.Number-of-Substrings-Containing-All-Three-Characters.cpp)

- [1368. Minimum Cost to Make at Least One Valid Path in a Grid](src/1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid.cpp)

- [1378. Replace Employee ID With The Unique Identifier](src/1378.Replace-Employee-ID-With-The-Unique-Identifier.sql)

- [1400. Construct K Palindrome Strings](src/1400.Construct-K-Palindrome-Strings.cpp)

- [1408. String Matching in an Array](src/1408.String-Matching-in-an-Array.cpp)

- [1415. The kth Lexicographical String of All Happy Strings of Length n](src/1415.The-kth-Lexicographical-String-of-All-Happy-Strings-of-Length-n.cpp)

- [1422. Maximum Score After Splitting a String](src/1422.Maximum-Score-After-Splitting-a-String.cpp)

- [1431. Kids With the Greatest Number of Candies](src/1431.Kids-With-the-Greatest-Number-of-Candies.cpp)

- [1455. Check If a Word Occurs As a Prefix](src/1455.Check-If-a-Word-Occurs-As-a-Prefix.cpp)

- [1456. Maximum Number of Vowels in a Substring of Given Length](src/1456.Maximum-Number-of-Vowels-in-a-Substring-of-Given-Length.cpp)

- [1462. Course Schedule IV](src/1462.Course-Schedule-IV.cpp)

- [1475. Final Prices With a Special Discount in a Shop](src/1475.Final-Prices-With-a-Special-Discount-in-a-Shop.cpp)

- [1493. Longest Subarray of 1s After Deleting One Element](src/1493.Longest-Subarray-of-1s-After-Deleting-One-Element.cpp)

- [1524. Number of Sub arrays With Odd Sum](src/1524.Number-of-Sub-arrays-With-Odd-Sum.cpp)

- [1581. Customer Who Visited but Did Not Make Any Transactions](src/1581.Customer-Who-Visited-but-Did-Not-Make-Any-Transactions.sql)

- [1639. Number of Ways to Form a Target String Given a Dictionary](src/1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary.cpp)

- [1652. Defuse the Bomb](src/1652.Defuse-the-Bomb.cpp)

- [1657. Determine if Two Strings Are Close](src/1657.Determine-if-Two-Strings-Are-Close.cpp)

- [1661. Average Time of Process per Machine](src/1661.Average-Time-of-Process-per-Machine.sql)

- [1679. Max Number of K Sum Pairs](src/1679.Max-Number-of-K-Sum-Pairs.cpp)

- [1683. Invalid Tweets](src/1683.Invalid-Tweets.sql)

- [1718. Construct the Lexicographically Largest Valid Sequence](src/1718.Construct-the-Lexicographically-Largest-Valid-Sequence.cpp)

- [1726. Tuple with Same Product](src/1726.Tuple-with-Same-Product.cpp)

- [1732. Find the Highest Altitude](src/1732.Find-the-Highest-Altitude.cpp)

- [1749. Maximum Absolute Sum of Any Subarray](src/1749.Maximum-Absolute-Sum-of-Any-Subarray.cpp)

- [1752. Check if Array Is Sorted and Rotated](src/1752.Check-if-Array-Is-Sorted-and-Rotated.cpp)

- [1757. Recyclable and Low Fat Products](src/1757.Recyclable-and-Low-Fat-Products.sql)

- [1760. Minimum Limit of Balls in a Bag](src/1760.Minimum-Limit-of-Balls-in-a-Bag.cpp)

- [1765. Map of Highest Peak](src/1765.Map-of-Highest-Peak.cpp)

- [1768. Merge Strings Alternately](src/1768.Merge-Strings-Alternately.cpp)

- [1769. Minimum Number of Operations to Move All Balls to Each Box](src/1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box.cpp)

- [1780. Check if Number is a Sum of Powers of Three](src/1780.Check-if-Number-is-a-Sum-of-Powers-of-Three.cpp)

- [1790. Check if One String Swap Can Make Strings Equal](src/1790.Check-if-One-String-Swap-Can-Make-Strings-Equal.cpp)

- [1792. Maximum Average Pass Ratio](src/1792.Maximum-Average-Pass-Ratio.cpp)

- [1800. Maximum Ascending Subarray Sum](src/1800.Maximum-Ascending-Subarray-Sum.cpp)

- [1861. Rotating the Box](src/1861.Rotating-the-Box.cpp)

- [1910. Remove All Occurrences of a Substring](src/1910.Remove-All-Occurrences-of-a-Substring.cpp)

- [1930. Unique Length 3 Palindromic Subsequences](src/1930.Unique-Length-3-Palindromic-Subsequences.cpp)

- [1934. Confirmation Rate](src/1934.Confirmation-Rate.sql)

- [1964. Find the Longest Valid Obstacle Course at Each Position](src/1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position.cpp)

- [1975. Maximum Matrix Sum](src/1975.Maximum-Matrix-Sum.cpp)

- [1980. Find Unique Binary String](src/1980.Find-Unique-Binary-String.cpp)

- [2017. Grid Game](src/2017.Grid-Game.cpp)

- [2054. Two Best Non Overlapping Events](src/2054.Two-Best-Non-Overlapping-Events.cpp)

- [2095. Delete the Middle Node of a Linked List](src/2095.Delete-the-Middle-Node-of-a-Linked-List.cpp)

- [2097. Valid Arrangement of Pairs](src/2097.Valid-Arrangement-of-Pairs.cpp)

- [2109. Adding Spaces to a String](src/2109.Adding-Spaces-to-a-String.cpp)

- [2116. Check if a Parentheses String Can Be Valid](src/2116.Check-if-a-Parentheses-String-Can-Be-Valid.cpp)

- [2127. Maximum Employees to Be Invited to a Meeting](src/2127.Maximum-Employees-to-Be-Invited-to-a-Meeting.cpp)

- [2130. Maximum Twin Sum of a Linked List](src/2130.Maximum-Twin-Sum-of-a-Linked-List.cpp)

- [2140. Solving Questions With Brainpower](src/2140.Solving-Questions-With-Brainpower.cpp)

- [2161. Partition Array According to Given Pivot](src/2161.Partition-Array-According-to-Given-Pivot.cpp)

- [2182. Construct String With Repeat Limit](src/2182.Construct-String-With-Repeat-Limit.cpp)

- [2185. Counting Words With a Given Prefix](src/2185.Counting-Words-With-a-Given-Prefix.cpp)

- [2206. Divide Array Into Equal Pairs](src/2206.Divide-Array-Into-Equal-Pairs.cpp)

- [2215. Find the Difference of Two Arrays](src/2215.Find-the-Difference-of-Two-Arrays.cpp)

- [2226. Maximum Candies Allocated to K Children](src/2226.Maximum-Candies-Allocated-to-K-Children.cpp)

- [2257. Count Unguarded Cells](src/2257.Count-Unguarded-Cells.cpp)

- [2270. Number of Ways to Split Array](src/2270.Number-of-Ways-to-Split-Array.cpp)

- [2290. Minimum Obstacle Removal](src/2290.Minimum-Obstacle-Removal.cpp)

- [2337. Move Pieces to Obtain a String](src/2337.Move-Pieces-to-Obtain-a-String.cpp)

- [2342. Max Sum of a Pair With Equal Sum of Digits](src/2342.Max-Sum-of-a-Pair-With-Equal-Sum-of-Digits.cpp)

- [2349. Design a Number Container System](src/2349.Design-a-Number-Container-System.cpp)

- [2352. Equal Row and Column Pairs](src/2352.Equal-Row-and-Column-Pairs.cpp)

- [2356. Number of Unique Subjects Taught by Each Teacher](src/2356.Number-of-Unique-Subjects-Taught-by-Each-Teacher.sql)

- [2364. Count Number of Bad Pairs](src/2364.Count-Number-of-Bad-Pairs.cpp)

- [2375. Construct Smallest Number From DI String](src/2375.Construct-Smallest-Number-From-DI-String.cpp)

- [2379. Minimum Recolors to Get K Consecutive Black Blocks](src/2379.Minimum-Recolors-to-Get-K-Consecutive-Black-Blocks.cpp)

- [2381. Shifting Letters II](src/2381.Shifting-Letters-II.cpp)

- [2390. Removing Stars From a String](src/2390.Removing-Stars-From-a-String.cpp)

- [2401. Longest Nice Subarray](src/2401.Longest-Nice-Subarray.cpp)

- [2415. Reverse Odd Levels of Binary Tree](src/2415.Reverse-Odd-Levels-of-Binary-Tree.cpp)

- [2425. Bitwise XOR of All Pairings](src/2425.Bitwise-XOR-of-All-Pairings.cpp)

- [2429. Minimize XOR](src/2429.Minimize-XOR.cpp)

- [2460. Apply Operations to an Array](src/2460.Apply-Operations-to-an-Array.cpp)

- [2461. Maximum Sum of Distinct Subarrays](src/2461.Maximum-Sum-of-Distinct-Subarrays.cpp)

- [2466. Count Ways To Build Good Strings](src/2466.Count-Ways-To-Build-Good-Strings.cpp)

- [2467. Most Profitable Path in a Tree](src/2467.Most-Profitable-Path-in-a-Tree.cpp)

- [2471. Minimum Number of Operations to Sort a Binary Tree by Level](src/2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level.cpp)

- [2493. Divide Nodes Into the Maximum Number of Groups](src/2493.Divide-Nodes-Into-the-Maximum-Number-of-Groups.cpp)

- [2516. Take K of Each Character](src/2516.Take-K-of-Each-Character.cpp)

- [2523. Closest Prime Numbers in Range](src/2523.Closest-Prime-Numbers-in-Range.cpp)

- [2529. Maximum Count of Positive Integer and Negative Integer](src/2529.Maximum-Count-of-Positive-Integer-and-Negative-Integer.cpp)

- [2554. Maximum Number of Integers to Choose From a Range](src/2554.Maximum-Number-of-Integers-to-Choose-From-a-Range.cpp)

- [2558. Take Gifts From the Richest Pile](src/2558.Take-Gifts-From-the-Richest-Pile.cpp)

- [2559. Count Vowel Strings in Ranges](src/2559.Count-Vowel-Strings-in-Ranges.cpp)

- [2560. House Robber IV](src/2560.House-Robber-IV.cpp)

- [2570. Merge Two 2D Arrays by Summing Values](src/2570.Merge-Two-2D-Arrays-by-Summing-Values.cpp)

- [2577. Minimum Time to Visit a Cell](src/2577.Minimum-Time-to-Visit-a-Cell.cpp)

- [2579. Count Total Number of Colored Cells](src/2579.Count-Total-Number-of-Colored-Cells.cpp)

- [2593. Find Score of an Array After Marking All Elements](src/2593.Find-Score-of-an-Array-After-Marking-All-Elements.cpp)

- [2594. Minimum Time to Repair Cars](src/2594.Minimum-Time-to-Repair-Cars.cpp)

- [2657. Find the Prefix Common Array of Two Arrays](src/2657.Find-the-Prefix-Common-Array-of-Two-Arrays.cpp)

- [2658. Maximum Number of Fish in a Grid](src/2658.Maximum-Number-of-Fish-in-a-Grid.cpp)

- [2661. First Completely Painted Row or Column](src/2661.First-Completely-Painted-Row-or-Column.cpp)

- [2683. Neighboring Bitwise XOR](src/2683.Neighboring-Bitwise-XOR.cpp)

- [2698. Find the Punishment Number of an Integer](src/2698.Find-the-Punishment-Number-of-an-Integer.cpp)

- [2762. Continuous Subarrays](src/2762.Continuous-Subarrays.cpp)

- [2779. Maximum Beauty of an Array After Applying Operation](src/2779.Maximum-Beauty-of-an-Array-After-Applying-Operation.cpp)

- [2825. Make String a Subsequence Using Cyclic Increments](src/2825.Make-String-a-Subsequence-Using-Cyclic-Increments.cpp)

- [2872. Maximum Number of K Divisible Components](src/2872.Maximum-Number-of-K-Divisible-Components.cpp)

- [2924. Find Champion II](src/2924.Find-Champion-II.cpp)

- [2940. Find Building Where Alice and Bob Can Meet](src/2940.Find-Building-Where-Alice-and-Bob-Can-Meet.cpp)

- [2948. Make Lexicographically Smallest Array by Swapping Elements](src/2948.Make-Lexicographically-Smallest-Array-by-Swapping-Elements.cpp)

- [2965. Find Missing and Repeated Values](src/2965.Find-Missing-and-Repeated-Values.cpp)

- [2981. Find Longest Special Substring That Occurs Thrice I](src/2981.Find-Longest-Special-Substring-That-Occurs-Thrice-I.cpp)

- [3042. Count Prefix and Suffix Pairs I](src/3042.Count-Prefix-and-Suffix-Pairs-I.cpp)

- [3066. Minimum Operations to Exceed Threshold Value II](src/3066.Minimum-Operations-to-Exceed-Threshold-Value-II.cpp)

- [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](src/3105.Longest-Strictly-Increasing-or-Strictly-Decreasing-Subarray.cpp)

- [3151. Special Array I](src/3151.Special-Array-I.cpp)

- [3152. Special Array II](src/3152.Special-Array-II.cpp)

- [3160. Find the Number of Distinct Colors Among the Balls](src/3160.Find-the-Number-of-Distinct-Colors-Among-the-Balls.cpp)

- [3169. Count Days Without Meetings](src/3169.Count-Days-Without-Meetings.cpp)

- [3174. Clear Digits](src/3174.Clear-Digits.cpp)

- [3191. Minimum Operations to Make Binary Array Elements Equal to One I](src/3191.Minimum-Operations-to-Make-Binary-Array-Elements-Equal-to-One-I.cpp)

- [3203. Find Minimum Diameter After Merging Two Trees](src/3203.Find-Minimum-Diameter-After-Merging-Two-Trees.cpp)

- [3208. Alternating Groups II](src/3208.Alternating-Groups-II.cpp)

- [3223. Minimum Length of String After Operations](src/3223.Minimum-Length-of-String-After-Operations.cpp)

- [3243. Shortest Distance After Road Addition Queries I](src/3243.Shortest-Distance-After-Road-Addition-Queries-I.cpp)

- [3264. Final Array State After K Multiplication Operations I](src/3264.Final-Array-State-After-K-Multiplication-Operations-I.cpp)

- [3306. Count of Substrings Containing Every Vowel and K Consonants II](src/3306.Count-of-Substrings-Containing-Every-Vowel-and-K-Consonants-II.cpp)

- [3356. Zero Array Transformation II](src/3356.Zero-Array-Transformation-II.cpp)

- [3394. Check if Grid can be Cut into Sections](src/3394.Check-if-Grid-can-be-Cut-into-Sections.cpp)

- [3417. Zigzag Grid Traversal With Skip](src/3417.Zigzag-Grid-Traversal-With-Skip.cpp)

- [3418. Maximum Amount of Money Robot Can Earn](src/3418.Maximum-Amount-of-Money-Robot-Can-Earn.cpp)

- [3471. Find the Largest Almost Missing Integer](src/3471.Find-the-Largest-Almost-Missing-Integer.cpp)

- [3472. Longest Palindromic Subsequence After at Most K Operations](src/3472.Longest-Palindromic-Subsequence-After-at-Most-K-Operations.cpp)

- [3473. Sum of K Subarrays With Length at Least M](src/3473.Sum-of-K-Subarrays-With-Length-at-Least-M.cpp)

- [3474. Lexicographically Smallest Generated String](src/3474.Lexicographically-Smallest-Generated-String.cpp)

- [3477. Fruits Into Baskets II](src/3477.Fruits-Into-Baskets-II.cpp)

- [3487. Maximum Unique Subarray Sum After Deletion](src/3487.Maximum-Unique-Subarray-Sum-After-Deletion.cpp)

- [3488. Closest Equal Element Queries](src/3488.Closest-Equal-Element-Queries.cpp)

- [3489. Zero Array Transformation IV](src/3489.Zero-Array-Transformation-IV.cpp)