README.md

# Leetcode Top 100
[1. Two Sum](./leetcode/1-TwoSum.go)    
[2. Add Two Numbers](./leetcode/2-AddTwoNumbers.go)    
[3. Longest Substring Without Repeating Characters](./leetcode/3-LongestSubstringWithoutRepeatingCharacters.go)    
[4. Median of Two Sorted Arrays](./leetcode/4-MedianofTwoSortedArrays.go)   
[5. Longest Palindromic Substring](./leetcode/5-LongestPalindromicSubstring.go)    
[10. Regular Expression Matching](./leetcode/10-RegularExpressionMatching.go)     
[11. Container With Most Water](./leetcode/11-ContainerWithMostWater.go)   
[15. 3Sum](./leetcode/15-3Sum.go)    
[17. Letter Combinations of a Phone Number](./leetcode/17-LetterCombinationsofaPhoneNumber.go)    
[19. Remove Nth Node From End of List](./leetcode/19-RemoveNthNodeFromEndOfList.go)    
[20. Valid Parentheses](./leetcode/20-ValidParentheses.go)    
[21. Merge Two Sorted Lists](./leetcode/21-MergeTwoSortedLists.go)    
[22. Generate Parentheses](./leetcode/22-GenerateParentheses.go)    
[23. Merge k Sorted Lists](./leetcode/23-MergeKSortedLists.go)    
[31. Next Permutation](./leetcode/31-NextPermutation.go)    
[32. Longest Valid Parentheses](./leetcode/32-LongestValidParentheses.go)    
[33. Search in Rotated Sorted Array](./leetcode/33-SearchinRotatedSortedArray.go)    
[34. Find First and Last Position of Element in Sorted Array](./leetcode/34-FindFirstandLastPositionofElementinSortedArray.go)    
[39. Combination Sum](./leetcode/39-CombinationSum.go)   
[42. Trapping Rain Water](./leetcode/42-TrappingRainWater.go)   
[46. Permutations](./leetcode/46-Permutations.go)   
[48. Rotate Image](./leetcode/48-RotateImage.go)   
[49. Group Anagrams](./leetcode/49-GroupAnagrams.go)   
[51. N-Queens](./leetcode/51-N-Queens.go)   
[53. Maximum Subarray](./leetcode/53-MaximumSubarray.go)   
[55. Jump Game](./leetcode/55-JumpGame.go)   
[56. Merge Intervals](./leetcode/56-MergeIntervals.go)   
[62. Unique Paths](./leetcode/62-UniquePaths.go)   
[64. Minimum Path Sum](./leetcode/64-MinimumPathSum.go)   
[70. Climbing Stairs](./leetcode/70-ClimbingStairs.go)   
[72. Edit Distance](./leetcode/72-EditDistance.go)   
[75. Sort Colors](./leetcode/75-SortColors.go)   
[76. Minimum Window Substring](./leetcode/76-MinimumWindowSubstring.go)   
[78. Subsets](./leetcode/78-Subsets.go)   
[79. Word Search](./leetcode/79-WordSearch.go)   
[84. Largest Rectangle in Histogram](./leetcode/84-LargestRectangleinHistogram.go)   
[85. Maximal Rectangle](./leetcode/85-MaximalRectangle.go)   
[94. Binary Tree Inorder Traversal](./leetcode/94-BinaryTreeInorderTraversal.go)  
[96. Unique Binary Search Trees](./leetcode/96-UniqueBinarySearchTrees.go)   
[98. Validate Binary Search Tree](./leetcode/98-ValidateBinarySearchTree.go)   
[101. Symmetric Tree](./leetcode/101-SymmetricTree.go)   
[102. Binary Tree Level Order Traversal](./leetcode/102-BinaryTreeLevelOrderTraversal.go)   
[104. Maximum Depth of Binary Tree](./leetcode/104-MaximumDepthOfBinaryTree.go)   
[105. Construct Binary Tree from Preorder and Inorder Traversal](./leetcode/105-ConstructBinaryTreefromPreorderandInorderTraversal.go)   
[114. Flatten Binary Tree to Linked List](./leetcode/114-FlattenBinaryTreeToLinkedList.go)   
[121. Best Time to Buy and Sell Stock](./leetcode/121-BestTimetoBuyandSellStock.go)   
[124. Binary Tree Maximum Path Sum](./leetcode/124-BinaryTreeMaximumPathSum.go)   
[128. Longest Consecutive Sequence](./leetcode/128-LongestConsecutiveSequence.go)   
[131. Palindrome Partitioning](./leetcode/131-PalindromePartitioning.go)    
[136. Single Number](./leetcode/136-SingleNumber.go)   
[139. Word Break](./leetcode/139-WordBreak.go)   
[141. Linked List Cycle](./leetcode/141-LinkedListCycle.go)   
[142. Linked List Cycle II](./leetcode/142-LinkedListCycleII.go)   
[146. LRU Cache](./leetcode/146-LRUCache.go)   
[148. Sort List](./leetcode/148-SortList.go)   
[152. Maximum Product Subarray](./leetcode/152-MaximumProductSubarray.go)   
[153. Find Minimum in Rotated Sorted Array](./leetcode/153-FindMinimuminRotatedSortedArray.go)   
[155. Min Stack](./leetcode/155-MinStack.go)   
[160. Intersection of Two Linked Lists](./leetcode/160-IntersectionOfTwoLinkedLists.go)   
[169. Majority Element](./leetcode/169-MajorityElement.go)   
[198. House Robber](./leetcode/198-HouseRobber.go)   
[199. Binary Tree Right Side View](./leetcode/199-BinaryTreeRightSideView.go)   
[200. Number of Islands](./leetcode/200-NumberofIsLands.go)   
[206. Reverse Linked List](./leetcode/206-ReverseLinkedList.go)    
[207. Course Schedule](./leetcode/207-CourseSchedule.go)        
[208. Implement Trie (Prefix Tree)](./leetcode/208-ImplementTrie-PrefixTree.go)    
[215. Kth Largest Element in an Array](./leetcode/215-KthLargestElementInAnArray.go)   
[221. Maximal Square](./leetcode/221-MaximalSquare.go)   
[226. Invert Binary Tree](./leetcode/226-InvertBinaryTree.go)   
[230. Kth Smallest Element in a BST](./leetcode/230-KthSmallestElementInABST.go)   
[234. Palindrome Linked List](./leetcode/234-PalindromeLinkedList.go)    
[236. Lowest Common Ancestor of a Binary Tree](./leetcode/236-LowestCommonAncestorOfABinaryTree.go)   
[238. Product of Array Except Self](./leetcode/238-ProductOfArrayExceptSelf.go)      
[239. Sliding Window Maximum](./leetcode/239-SlidingWindowMaximum.go)   
[240. Search a 2D Matrix II](./leetcode/240-SearchA2DMatrixII.go)   
[253. Meeting Rooms II](./leetcode/253-MeetingRoomsII.go)      
[279. Perfect Squares](./leetcode/279-PerfectSquares.go)       
[283. Move Zeroes](./leetcode/283-MoveZeroes.go)     
[297. Serialize and Deserialize Binary Tree](./leetcode/297-SerializeAndDeserializeBinaryTree.go)   
[300. Longest Increasing Subsequence](./leetcode/300-LongestIncreasingSubsequence.go)   
[301. Remove Invalid Parentheses](./leetcode/301-RemoveInvalidParentheses.go)   
[309. Best Time to Buy and Sell Stock with Cooldown](./leetcode/309-BestTimeToBuyAndSellStockWithCooldown.go)   
[312. Burst Balloons](./leetcode/312-BurstBalloons.go)   
[322. Coin Change](./leetcode/322-CoinChange.go)   
[337. House Robber III](./leetcode/337-HouseRobberIII.go)   
[338. Counting Bits](./leetcode/338-CountingBits.go)   
[347. Top K Frequent Elements](./leetcode/347-TopKFrequentElements.go)   
[394. Decode String](./leetcode/394-DecodeString.go)   
[399. Evaluate Division](./leetcode/399-EvaluateDivision.go)   
[406. Queue Reconstruction by Height](./leetcode/406-QueueReconstructionByHeight.go)   
[416. Partition Equal Subset Sum](./leetcode/416-PartitionEqualSubsetSum.go)   
[437. Path Sum III](./leetcode/437-PathSumIII.go)   
[438. Find All Anagrams in a String](./leetcode/438-FindAllAnagramsInAString.go)   
[448. Find All Numbers Disappeared in an Array](./leetcode/448-FindAllNumbersDisappearedInAnArray.go)   
[461. Hamming Distance](./leetcode/461-HammingDistance.go)   
[494. Target Sum](./leetcode/494-TargetSum.go)   
[538. Convert BST to Greater Tree](./leetcode/538-ConvertBSTtoGreaterTree.go)   
[543. Diameter of Binary Tree](./leetcode/543-DiameterOfBinaryTree.go)   
[560. Subarray Sum Equals K](./leetcode/560-SubarraySumEqualsK.go)   
[567. Permutation in String](./leetcode/567-PermutationInString.go)   
[581. Shortest Unsorted Continuous Subarray](./leetcode/581-ShortestUnsortedContinuousSubarray.go)   
[617. Merge Two Binary Trees](./leetcode/617-MergeTwoBinaryTrees.go)   
[621. Task Scheduler](./leetcode/621-TaskScheduler.go)   
[647. Palindromic Substrings](./leetcode/647-PalindromicSubstrings.go)   
[739. Daily Temperatures](./leetcode/739-DailyTemperatures.go)   
[1143. Longest Common Subsequence](./leetcode/1143-LongestCommonSubsequence.go)   

# Array
[1. Two Sum](./leetcode/1-TwoSum.go)   
[4. Median of Two Sorted Arrays](./leetcode/4-MedianofTwoSortedArrays.go)   
[11. Container With Most Water](./leetcode/11-ContainerWithMostWater.go)   
[15. 3Sum](./leetcode/15-3Sum.go)   
[16. 3Sum Closest](./leetcode/16-3SumClosest.go)   
[18. 4Sum](./leetcode/18-4Sum.go)   
[26. Remove Duplicates from Sorted Array](./leetcode/26-RemoveDuplicatesfromSortedArray.go)   
[27. Remove Element](./leetcode/27-RemoveElement.go)   
[31. Next Permutation](./leetcode/31-NextPermutation.go)   
[33. Search in Rotated Sorted Array](./leetcode/33-SearchinRotatedSortedArray.go)   
[34. Find First and Last Position of Element in Sorted Array](./leetcode/34-FindFirstandLastPositionofElementinSortedArray.go)   
[35. Search Insert Position](./leetcode/35-SearchInsertPosition.go)    
[36. Valid Sudoku](./leetcode/36-ValidSudoku.go)   
[37. Sudoku Solver](./leetcode/37-SudokuSolver.go)    
[39. Combination Sum](./leetcode/39-CombinationSum.go)    
[40. Combination Sum II](./leetcode/40-CombinationSumII.go)    
[41. First Missing Positive](./leetcode/41-FirstMissingPositive.go)    
[42. Trapping Rain Water](./leetcode/42-TrappingRainWater.go)    
[45. Jump Game II](./leetcode/45-JumpGameII.go)    
[46. Permutations](./leetcode/46-Permutations.go)    
[47. Permutations II](./leetcode/47-PermutationsII.go)    
[48. Rotate Image](./leetcode/48-RotateImage.go)    
[51. N-Queens](./leetcode/51-N-Queens.go)    
[53. Maximum Subarray](./leetcode/53-MaximumSubarray.go)    
[54. Spiral Matrix](./leetcode/54-SpiralMatrix.go)    
[55. Jump Game](./leetcode/55-JumpGame.go)    
[56. Merge Intervals](./leetcode/56-MergeIntervals.go)    
[57. Insert Interval](./leetcode/57-InsertInterval.go)    
[59. Spiral Matrix II](./leetcode/59-SpiralMatrixII.go)    
[63. Unique Paths II](./leetcode/63-UniquePathsII.go)    
[64. Minimum Path Sum](./leetcode/64-MinimumPathSum.go)    
[66. Plus One](./leetcode/66-PlusOne.go)   
[68. Text Justification](./leetcode/68-TextJustification.go)   
[73. Set Matrix Zeroes](./leetcode/73-SetMatrixZeroes.go)    
[74. Search a 2D Matrix](./leetcode/74-Searcha2DMatrix.go)    
[75. Sort Colors](./leetcode/75-SortColors.go)    
[77. Combinations](./leetcode/77-Combinations.go)    
[78. Subsets](./leetcode/78-Subsets.go)    
[79. Word Search](./leetcode/79-WordSearch.go)    
[80. Remove Duplicates from Sorted Array II](./leetcode/80-RemoveDuplicatesfromSortedArrayII.go)    
[81. Search in Rotated Sorted Array II](./leetcode/81-SearchinRotatedSortedArrayII.go)   
[84. Largest Rectangle in Histogram](./leetcode/84-LargestRectangleinHistogram.go)   
[85. Maximal Rectangle](./leetcode/85-MaximalRectangle.go)       
[88. Merge Sorted Array](./leetcode/88-MergeSortedArray.go)   
[90. Subsets II](./leetcode/90-SubsetsII.go)    
[105. Construct Binary Tree from Preorder and Inorder Traversal](./leetcode/105-ConstructBinaryTreefromPreorderandInorderTraversal.go)   
[106. Construct Binary Tree from Inorder and Postorder Traversal](./leetcode/106-ConstructBinaryTreefromInorderandPostorderTraversal.go)   
[108. Convert Sorted Array to Binary Search Tree](./leetcode/108-ConvertSortedArraytoBinarySearchTree.go)   
[118. Pascal’s Triangle](./leetcode/118-PascalsTriangle.go)   
[119. Pascal’s Triangle II](./leetcode/119-PascalsTriangleII.go)   
[120. Triangle](./leetcode/120-Triangle.go)   
[121. Best Time to Buy and Sell Stock](./leetcode/121-BestTimetoBuyandSellStock.go)   
[122. Best Time to Buy and Sell Stock II](./leetcode/122-BestTimetoBuyandSellStockII.go)   
[123. Best Time to Buy and Sell Stock III](./leetcode/123-BestTimeToBuyAndSellStockIII.go)   
[128. Longest Consecutive Sequence](./leetcode/128-LongestConsecutiveSequence.go)   
[130. Surrounded Regions](./leetcode/130-SurroundedRegions.go)   
[134. Gas Station](./leetcode/134-GasStation.go)   
[135. Candy](./leetcode/135-Candy.go)   
[136. Single Number](./leetcode/136-SingleNumber.go)   
[137. Single Number II](./leetcode/137-SingleNumberII.go)   
[140. Word Break II](./leetcode/140-WordBreakII.go)   
[149. Max Points on a Line](./leetcode/149-MaxPointsOnALine.go)   
[150. Evaluate Reverse Polish Notation](./leetcode/150-EvaluateReversePolishNotation.go)   
[152. Maximum Product Subarray](./leetcode/152-MaximumProductSubarray.go)   
[153. Find Minimum in Rotated Sorted Array](./leetcode/153-FindMinimuminRotatedSortedArray.go)   
[154. Find Minimum in Rotated Sorted Array II](./leetcode/154-FindMinimuminRotatedSortedArrayII.go)   
[162. Find Peak Element](./leetcode/162-FindPeakElement.go)   
[163. Missing Ranges](./leetcode/163-MissingRanges.go)   
[164. Maximum Gap](./leetcode/164-MaximumGap.go)   
[167. Two Sum II - Input array is sorted](./leetcode/167-TwoSumII-InputArrayIsSorted.go)   
[169. Majority Element](./leetcode/169-MajorityElement.go)   
[174. Dungeon Game](./leetcode/174-DungeonGame.go)   
[188. Best Time to Buy and Sell Stock IV](./leetcode/188-BestTimeToBuyAndSellStockIV.go)   
[189. Rotate Array](./leetcode/189-RotateArray.go)   
[198. House Robber](./leetcode/198-HouseRobber.go)   
[200. Number of Islands](./leetcode/200-NumberofIsLands.go)   
[204. Count Primes](./leetcode/204-CountPrimes.go)   
[207. Course Schedule](./leetcode/207-CourseSchedule.go)    
[209. Minimum Size Subarray Sum](./leetcode/209-MinimumSizeSubarraySum.go)   
[212. Word Search II](./leetcode/212-WordSearchII.go)   
[213. House Robber II](./leetcode/213-HouseRobberII.go)   
[215. Kth Largest Element in an Array](./leetcode/215-KthLargestElementInAnArray.go)   
[216. Combination Sum III](./leetcode/216-CombinationSumIII.go)   
[217. Contains Duplicate](./leetcode/217-ContainsDuplicate.go)   
[218. The Skyline Problem](./leetcode/218-TheSkylineProblem.go)   
[219. Contains Duplicate II](./leetcode/219-ContainsDuplicateII.go)   
[220. Contains Duplicate III](./leetcode/220-ContainsDuplicateIII.go)   
[221. Maximal Square](./leetcode/221-MaximalSquare.go)   
[228. Summary Ranges](./leetcode/228-SummaryRanges.go)   
[229. Majority Element II](./leetcode/229-MajorityElementII.go)   
[238. Product of Array Except Self](./leetcode/238-ProductOfArrayExceptSelf.go)   
[239. Sliding Window Maximum](./leetcode/239-SlidingWindowMaximum.go)   
[240. Search a 2D Matrix II](./leetcode/240-SearchA2DMatrixII.go)   
[243. Shortest Word Distance](./leetcode/243-ShortestWordDistance.go)   
[244. Shortest Word Distance II](./leetcode/244-ShortestWordDistanceII.go)   
[245. Shortest Word Distance III](./leetcode/245-ShortestWordDistanceIII.go)   
[249. Group Shifted Strings](./leetcode/249-GroupShiftedStrings.go)   
[252. Meeting Rooms](./leetcode/252-MeetingRooms.go)   
[256. Paint House](./leetcode/256-PaintHouse.go)   
[259. 3Sum Smaller](./leetcode/259-3SumSmaller.go)   
[260. Single Number III](./leetcode/260-SingleNumberIII.go)   
[265. Paint House II](./leetcode/265-PaintHouseII.go)   
[268. Missing Number](./leetcode/268-MissingNumber.go)   
[269. Alien Dictionary](./leetcode/269-AlienDictionary.go)   
[274. H-Index](./leetcode/274-H-Index.go)   
[275. H-Index II](./leetcode/275-H-IndexII.go)   
[280. Wiggle Sort](./leetcode/280-WiggleSort.go)   
[283. Move Zeroes](./leetcode/283-MoveZeroes.go)   
[286. Walls and Gates](./leetcode/286-WallsAndGates.go)   
[287. Find the Duplicate Number](./leetcode/287-FindTheDuplicateNumber.go)   
[289. Game of Life](./leetcode/289-GameOfLife.go)   
[296. Best Meeting Point](./leetcode/296-BestMeetingPoint.go)   
[300. Longest Increasing Subsequence](./leetcode/300-LongestIncreasingSubsequence.go)   
[302. Smallest Rectangle Enclosing Black Pixels](./leetcode/302-SmallestRectangleEnclosingBlackPixels.go)   
[303. Range Sum Query - Immutable](./leetcode/303-RangeSumQuery-Immutable.go)   
[304. Range Sum Query 2D - Immutable](./leetcode/304-RangeSumQuery2D-Immutable.go)   
[305. Number of Islands II](./leetcode/305-NumberOfIslandsII.go)   
[307. Range Sum Query - Mutable](./leetcode/307-RangeSumQuery-Mutable.go)   
[309. Best Time to Buy and Sell Stock with Cooldown](./leetcode/309-BestTimeToBuyAndSellStockWithCooldown.go)   
[311. Sparse Matrix Multiplication](./leetcode/311-SparseMatrixMultiplication.go)   
[312. Burst Balloons](./leetcode/312-BurstBalloons.go)   
[313. Super Ugly Number](./leetcode/313-SuperUglyNumber.go)   
[317. Shortest Distance from All Buildings](./leetcode/317-ShortestDistanceFromAllBuildings.go)   
[318. Maximum Product of Word Lengths](./leetcode/318-MaximumProductOfWordLengths.go)   
[322. Coin Change](./leetcode/322-CoinChange.go)   
[324. Wiggle Sort II](./leetcode/324-WiggleSortII.go)   
[325. Maximum Size Subarray Sum Equals k](./leetcode/325-MaximumSizeSubarraySumEqualsk.go)   
[327. Count of Range Sum](./leetcode/327-CountOfRangeSum.go)   
[329. Longest Increasing Path in a Matrix](./leetcode/329-LongestIncreasingPathInAMatrix.go)   
[330. Patching Array](./leetcode/330-PatchingArray.go)   
[334. Increasing Triplet Subsequence](./leetcode/334-IncreasingTripletSubsequence.go)   
[335. Self Crossing](./leetcode/335-SelfCrossing.go)   
[336. Palindrome Pairs](./leetcode/336-PalindromePairs.go)   
[347. Top K Frequent Elements](./leetcode/347-TopKFrequentElements.go)   
[349. Intersection of Two Arrays](./leetcode/349-IntersectionOfTwoArrays.go)   
[350. Intersection of Two Arrays II](./leetcode/350-IntersectionOfTwoArraysII.go)   
[354. Russian Doll Envelopes](./leetcode/354-RussianDollEnvelopes.go)   
[356. Line Reflection](./leetcode/356-LineReflection.go)   
[360. Sort Transformed Array](./leetcode/360-SortTransformedArray.go)   
[361. Bomb Enemy](./leetcode/361-BombEnemy.go)   
[363. Max Sum of Rectangle No Larger Than K](./leetcode/363-MaxSumOfRectangleNoLargerThanK.go)   
[368. Largest Divisible Subset](./leetcode/368-LargestDivisibleSubset.go)   
[370. Range Addition](./leetcode/370-RangeAddition.go)   
[373. Find K Pairs with Smallest Sums](./leetcode/373-FindKPairsWithSmallestSums.go)   
[376. Wiggle Subsequence](./leetcode/376-WiggleSubsequence.go)   
[377. Combination Sum IV](./leetcode/377-CombinationSumIV.go)   
[378. Kth Smallest Element in a Sorted Matrix](./leetcode/378-KthSmallestElementInASortedMatrix.go)   
[391. Perfect Rectangle](./leetcode/391-PerfectRectangle.go)   
[393. UTF-8 Validation](./leetcode/393-UTF-8Validation.go)   
[396. Rotate Function](./leetcode/396-RotateFunction.go)   
[399. Evaluate Division](./leetcode/399-EvaluateDivision.go)   
[403. Frog Jump](./leetcode/403-FrogJump.go)   
[406. Queue Reconstruction by Height](./leetcode/406-QueueReconstructionByHeight.go)   
[407. Trapping Rain Water II](./leetcode/407-TrappingRainWaterII.go)   
[410. Split Array Largest Sum](./leetcode/410-SplitArrayLargestSum.go)   
[413. Arithmetic Slices](./leetcode/413-ArithmeticSlices.go)   
[414. Third Maximum Number](./leetcode/414-ThirdMaximumNumber.go)   
[416. Partition Equal Subset Sum](./leetcode/416-PartitionEqualSubsetSum.go)   
[417. Pacific Atlantic Water Flow](./leetcode/417-PacificAtlanticWaterFlow.go)   
[419. Battleships in a Board](./leetcode/419-BattleshipsInABoard.go)   
[421. Maximum XOR of Two Numbers in an Array](./leetcode/421-MaximumXOROfTwoNumbersInAnArray.go)   
[422. Valid Word Square](./leetcode/422-ValidWordSquare.go)   
[425. Word Squares](./leetcode/425-WordSquares.go)   
[435. Non-overlapping Intervals](./leetcode/435-Non-overlappingIntervals.go)   
[436. Find Right Interval](./leetcode/436-FindRightInterval.go)   
[442. Find All Duplicates in an Array](./leetcode/442-FindAllDuplicatesInAnArray.go)   
[443. String Compression](./leetcode/443-StringCompression.go)   
[444. Sequence Reconstruction](./leetcode/444-SequenceReconstruction.go)   
[446. Arithmetic Slices II - Subsequence](./leetcode/446-ArithmeticSlicesII-Subsequence.go)   
[447. Number of Boomerangs](./leetcode/447-NumberOfBoomerangs.go)   
[452. Minimum Number of Arrows to Burst Balloons](./leetcode/452-MinimumNumberOfArrowsToBurstBalloons.go)   
[453. Minimum Moves to Equal Array Elements](./leetcode/453-MinimumMovesToEqualArrayElements.go)   
[454. 4Sum II](./leetcode/454-4SumII.go)   
[455. Assign Cookies](./leetcode/455-AssignCookies.go)   
[456. 132 Pattern](./leetcode/456-132Pattern.go)   
[457. Circular Array Loop](./leetcode/457-CircularArrayLoop.go)   
[462. Minimum Moves to Equal Array Elements II](./leetcode/462-MinimumMovesToEqualArrayElementsII.go)   
[463. Island Perimeter](./leetcode/463-IslandPerimeter.go)   
[465. Optimal Account Balancing](./leetcode/465-OptimalAccountBalancing.go)   
[469. Convex Polygon](./leetcode/469-ConvexPolygon.go)   
[472. Concatenated Words](./leetcode/472-ConcatenatedWords.go)   
[473. Matchsticks to Square](./leetcode/473-MatchsticksToSquare.go)   
[474. Ones and Zeroes](./leetcode/474-OnesAndZeroes.go)   
[475. Heaters](./leetcode/475-Heaters.go)   
[477. Total Hamming Distance](./leetcode/477-TotalHammingDistance.go)   
[480. Sliding Window Median](./leetcode/480-SlidingWindowMedian.go)   
[485. Max Consecutive Ones](./leetcode/485-MaxConsecutiveOnes.go)   
[486. Predict the Winner](./leetcode/486-PredictTheWinner.go)   
[487. Max Consecutive Ones II](./leetcode/487-MaxConsecutiveOnesII.go)   
[491. Non-decreasing Subsequences](./leetcode/491-NonDecreasingSubsequences.go)   
[493. Reverse Pairs](./leetcode/493-ReversePairs.go)   
[494. Target Sum](./leetcode/494-TargetSum.go)   
[495. Teemo Attacking](./leetcode/495-TeemoAttacking.go)   
[496. Next Greater Element I](./leetcode/496-NextGreaterElementI.go)   
[498. Diagonal Traverse](./leetcode/498-DiagonalTraverse.go)   
[500. Keyboard Row](./leetcode/500-KeyboardRow.go)   
[502. IPO](./leetcode/502-IPO.go)   
[503. Next Greater Element II](./leetcode/503-NextGreaterElementII.go)   
[506. Relative Ranks](./leetcode/506-RelativeRanks.go)   
[517. Super Washing Machines](./leetcode/517-SuperWashingMachines.go)   
[518. Coin Change II](./leetcode/518-CoinChangeII.go)   
[522. Longest Uncommon Subsequence II](./leetcode/522-LongestUncommonSubsequenceII.go)   
[523. Continuous Subarray Sum](./leetcode/523-ContinuousSubarraySum.go)   
[525. Contiguous Array](./leetcode/525-ContiguousArray.go)   
[527. Word Abbreviation](./leetcode/527-WordAbbreviation.go)   
[529. Minesweeper](./leetcode/529-Minesweeper.go)   
[531. Lonely Pixel I](./leetcode/531-LonelyPixelI.go)   
[532. K-diff Pairs in an Array](./leetcode/532-K-diffPairsInAnArray.go)   
[533. Lonely Pixel II](./leetcode/533-LonelyPixelII.go)   
[539. Minimum Time Difference](./leetcode/539-MinimumTimeDifference.go)   
[540. Single Element in a Sorted Array](./leetcode/540-SingleElementInASortedArray.go)   
[542. 01 Matrix](./leetcode/542-01Matrix.go)   
[546. Remove Boxes](./leetcode/546-RemoveBoxes.go)   
[547. Number of Provinces](./leetcode/547-NumberOfProvinces.go)   
[548. Split Array with Equal Sum](./leetcode/548-SplitArrayWithEqualSum.go)   
[553. Optimal Division](./leetcode/553-OptimalDivision.go)   
[554. Brick Wall](./leetcode/554-BrickWall.go)   
[555. Split Concatenated Strings](./leetcode/555-SplitConcatenatedStrings.go)   
[560. Subarray Sum Equals K](./leetcode/560-SubarraySumEqualsK.go)   
[562. Longest Line of Consecutive One in Matrix](./leetcode/562-LongestLineOfConsecutiveOneInMatrix.go)   
[565. Array Nesting](./leetcode/565-ArrayNesting.go)   
[566. Reshape the Matrix](./leetcode/566-ReshapeTheMatrix.go)   
[568. Maximum Vacation Days](./leetcode/568-MaximumVacationDays.go)   
[573. Squirrel Simulation](./leetcode/573-SquirrelSimulation.go)   
[575. Distribute Candies](./leetcode/575-DistributeCandies.go)   
[581. Shortest Unsorted Continuous Subarray](./leetcode/581-ShortestUnsortedContinuousSubarray.go)   
[587. Erect the Fence](./leetcode/587-ErectTheFence.go)   
[594. Longest Harmonious Subsequence](./leetcode/594-LongestHarmoniousSubsequence.go)   
[598. Range Addition II](./leetcode/598-RangeAdditionII.go)   
[599. Minimum Index Sum of Two Lists](./leetcode/599-MinimumIndexSumOfTwoLists.go)   
[605. Can Place Flowers](./leetcode/605-CanPlaceFlowers.go)   
[609. Find Duplicate File in System](./leetcode/609-FindDuplicateFileInSystem.go)   
[611. Valid Triangle Number](./leetcode/611-ValidTriangleNumber.go)   
[621. Task Scheduler](./leetcode/621-TaskScheduler.go)   
[624. Maximum Distance in Arrays](./leetcode/624-MaximumDistanceInArrays.go)   
[628. Maximum Product of Three Numbers](./leetcode/628-MaximumProductOfThreeNumbers.go)   
[630. Course Schedule III](./leetcode/630-CourseScheduleIII.go)   
[632. Smallest Range Covering Elements from K Lists](./leetcode/632-SmallestRangeCoveringElementsFromKLists.go)   
[636. Exclusive Time of Functions](./leetcode/636-ExclusiveTimeOfFunctions.go)   
[638. Shopping Offers](./leetcode/638-ShoppingOffers.go)   
[643. Maximum Average Subarray I](./leetcode/643-MaximumAverageSubarrayI.go)   
[644. Maximum Average Subarray II](./leetcode/644-MaximumAverageSubarrayII.go)   
[645. Set Mismatch](./leetcode/645-SetMismatch.go)   
[646. Maximum Length of Pair Chain](./leetcode/646-MaximumLengthOfPairChain.go)   
[648. Replace Words](./leetcode/648-ReplaceWords.go)   
[656. Coin Path](./leetcode/656-CoinPath.go)   
[658. Find K Closest Elements](./leetcode/658-FindKClosestElements.go)   
[659. Split Array into Consecutive Subsequences](./leetcode/659-SplitArrayIntoConsecutiveSubsequences.go)   
[661. Image Smoother](./leetcode/661-ImageSmoother.go)   
[665. Non-decreasing Array](./leetcode/665-Non-DecreasingArray.go)   
[666. Path Sum IV](./leetcode/666-PathSumIV.go)   
[673. Number of Longest Increasing Subsequence](./leetcode/673-NumberOfLongestIncreasingSubsequence.go)   
[674. Longest Continuous Increasing Subsequence](./leetcode/674-LongestContinuousIncreasingSubsequence.go)   
[675. Cut Off Trees for Golf Event](./leetcode/675-CutOffTreesForGolfEvent.go)   
[679. 24 Game](./leetcode/679-24Game.go)   
[682. Baseball Game](./leetcode/682-BaseballGame.go)   
[683. K Empty Slots](./leetcode/683-KEmptySlots.go)   
[689. Maximum Sum of 3 Non-Overlapping Subarrays](./leetcode/689-MaximumSumOf3NonOverlappingSubarrays.go)   
[690. Employee Importance](./leetcode/690-EmployeeImportance.go)   
[691. Stickers to Spell Word](./leetcode/691-StickersToSpellWord.go)   
[692. Top K Frequent Words](./leetcode/692-TopKFrequentWords.go)   
[695. Max Area of Island](./leetcode/695-MaxAreaOfIsland.go)   
[697. Degree of an Array](./leetcode/697-DegreeOfAnArray.go)   
[698. Partition to K Equal Sum Subsets](./leetcode/698-PartitionToKEqualSumSubsets.go)   
[699. Falling Squares](./leetcode/699-FallingSquares.go)   
[702. Search in a Sorted Array of Unknown Size](./leetcode/702-SearchInASortedArrayOfUnknownSize.go)   
[704. Binary Search](./leetcode/704-BinarySearch.go)   
[713. Subarray Product Less Than K](./leetcode/713-SubarrayProductLessThanK.go)   
[714. Best Time to Buy and Sell Stock with Transaction Fee](./leetcode/714-BestTimeToBuyAndSellStockWithTransactionFee.go)   
[717. 1-bit and 2-bit Characters](./leetcode/717-1bitAnd2bitCharacters.go)   
[718. Maximum Length of Repeated Subarray](./leetcode/718-MaximumLengthOfRepeatedSubarray.go)   
[719. Find K-th Smallest Pair Distance](./leetcode/719-FindKthSmallestPairDistance.go)   
[720. Longest Word in Dictionary](./leetcode/720-LongestWordInDictionary.go)   
[721. Accounts Merge](./leetcode/721-AccountsMerge.go)   
[722. Remove Comments](./leetcode/722-RemoveComments.go)   
[723. Candy Crush](./leetcode/723-CandyCrush.go)   
[724. Find Pivot Index](./leetcode/724-FindPivotIndex.go)   
[733. Flood Fill](./leetcode/733-FloodFill.go)   
[734. Sentence Similarity](./leetcode/734-SentenceSimilarity.go)   
[735. Asteroid Collision](./leetcode/735-AsteroidCollision.go)   
[737. Sentence Similarity II](./leetcode/737-SentenceSimilarityII.go)   
[739. Daily Temperatures](./leetcode/739-DailyTemperatures.go)   
[740. Delete and Earn](./leetcode/740-DeleteAndEarn.go)   
[741. Cherry Pickup](./leetcode/741-CherryPickup.go)   
[744. Find Smallest Letter Greater Than Target](./leetcode/744-FindSmallestLetterGreaterThanTarget.go)   
[746. Min Cost Climbing Stairs](./leetcode/746-MinCostClimbingStairs.go)   
[747. Largest Number At Least Twice of Others](./leetcode/747-LargestNumberAtLeastTwiceOfOthers.go)   
[748. Shortest Completing Word](./leetcode/748-ShortestCompletingWord.go)   
[749. Contain Virus](./leetcode/749-ContainVirus.go)   
[750. Number Of Corner Rectangles](./leetcode/750-NumberOfCornerRectangles.go)   
[752. Open the Lock](./leetcode/752-OpenTheLock.go)   
[755. Pour Water](./leetcode/755-PourWater.go)   
[757. Set Intersection Size At Least Two](./leetcode/757-SetIntersectionSizeAtLeastTwo.go)   
[759. Employee Free Time](./leetcode/759-EmployeeFreeTime.go)   
[760. Find Anagram Mappings](./leetcode/760-FindAnagramMappings.go)   
[764. Largest Plus Sign](./leetcode/764-LargestPlusSign.go)   
[765. Couples Holding Hands](./leetcode/765-CouplesHoldingHands.go)   
[766. Toeplitz Matrix](./leetcode/766-ToeplitzMatrix.go)   
[768. Max Chunks To Make Sorted II](./leetcode/768-MaxChunksToMakeSortedII.go)   
[769. Max Chunks To Make Sorted](./leetcode/769-MaxChunksToMakeSorted.go)   
[773. Sliding Puzzle](./leetcode/773-SlidingPuzzle.go)   
[774. Minimize Max Distance to Gas Station](./leetcode/774-MinimizeMaxDistanceToGasStation.go)   
[775. Global and Local Inversions](./leetcode/775-GlobalAndLocalInversions.go)   
[778. Swim in Rising Water](./leetcode/778-SwimInRisingWater.go)   
[781. Rabbits in Forest](./leetcode/781-RabbitsInForest.go)   
[782. Transform to Chessboard](./leetcode/782-TransformToChessboard.go)   
[785. Is Graph Bipartite?](./leetcode/785-IsGraphBipartite.go)   
[786. K-th Smallest Prime Fraction](./leetcode/786-KthSmallestPrimeFraction.go)   
[797. All Paths From Source to Target](./leetcode/797-AllPathsFromSourceToTarget.go)   
[789. Escape The Ghosts](./leetcode/789-EscapeTheGhosts.go)   
[794. Valid Tic-Tac-Toe State](./leetcode/794-ValidTicTacToeState.go)   
[795. Number of Subarrays with Bounded Maximum](./leetcode/795-NumberOfSubarraysWithBoundedMaximum.go)   
[798. Smallest Rotation with Highest Score](./leetcode/798-SmallestRotationWithHighestScore.go)   
[801. Minimum Swaps To Make Sequences Increasing](./leetcode/801-MinimumSwapsToMakeSequencesIncreasing.go)   
[802. Find Eventual Safe States](./leetcode/802-FindEventualSafeStates.go)   
[803. Bricks Falling When Hit](./leetcode/803-BricksFallingWhenHit.go)   
[804. Unique Morse Code Words](./leetcode/804-UniqueMorseCodeWords.go)   
[805. Split Array With Same Average](./leetcode/805-SplitArrayWithSameAverage.go)   
[806. Number of Lines To Write String](./leetcode/806-NumberOfLinesToWriteString.go)   
[807. Max Increase to Keep City Skyline](./leetcode/807-MaxIncreaseToKeepCitySkyline.go)   
[810. Chalkboard XOR Game](./leetcode/810-ChalkboardXORGame.go)   
[811. Subdomain Visit Count](./leetcode/811-SubdomainVisitCount.go)   
[813. Largest Sum of Averages](./leetcode/813-LargestSumOfAverages.go)   
[815. Bus Routes](./leetcode/815-BusRoutes.go)   
[820. Short Encoding of Words](./leetcode/820-ShortEncodingOfWords.go)   
[822. Card Flipping Game](./leetcode/822-CardFlippingGame.go)   
[823. Binary Trees With Factors](./leetcode/823-BinaryTreesWithFactors.go)   
[825. Friends Of Appropriate Ages](./leetcode/825-FriendsOfAppropriateAges.go)   
[826. Most Profit Assigning Work](./leetcode/826-MostProfitAssigningWork.go)   
[827. Making A Large Island](./leetcode/827-MakingALargeIsland.go)   
[832. Flipping an Image](./leetcode/832-FlippingAnImage.go)   
[835. Image Overlap](./leetcode/835-ImageOverlap.go)   
[839. Similar String Groups](./leetcode/839-SimilarStringGroups.go)   
[840. Magic Squares In Grid](./leetcode/840-MagicSquaresInGrid.go)   
[841. Keys and Rooms](./leetcode/841-KeysAndRooms.go)   
[843. Guess the Word](./leetcode/843-GuessTheWord.go)   
[845. Longest Mountain in Array](./leetcode/845-LongestMountainInArray.go)   
[846. Hand of Straights](./leetcode/846-HandOfStraights.go)   
[849. Maximize Distance to Closest Person](./leetcode/849-MaximizeDistanceToClosestPerson.go)   
[850. Rectangle Area II](./leetcode/850-RectangleAreaII.go)   
[851. Loud and Rich](./leetcode/851-LoudAndRich.go)   
[852. Peak Index in a Mountain Array](./leetcode/852-PeakIndexInAMountainArray.go)   
[853. Car Fleet](./leetcode/853-CarFleet.go)   
[857. Minimum Cost to Hire K Workers](./leetcode/857-MinimumCostToHireKWorkers.go)   
[860. Lemonade Change](./leetcode/860-LemonadeChange.go)   
[861. Score After Flipping Matrix](./leetcode/861-ScoreAfterFlippingMatrix.go)   
[862. Shortest Subarray with Sum at Least K](./leetcode/862-ShortestSubarrayWithSumAtLeastK.go)   
[864. Shortest Path to Get All Keys](./leetcode/864-ShortestPathToGetAllKeys.go)   
[867. Transpose Matrix](./leetcode/867-TransposeMatrix.go)   
[870. Advantage Shuffle](./leetcode/870-AdvantageShuffle.go)   
[873. Length of Longest Fibonacci Subsequence](./leetcode/873-LengthOfLongestFibonacciSubsequence.go)   
[874. Walking Robot Simulation](./leetcode/874-WalkingRobotSimulation.go)   
[875. Koko Eating Bananas](./leetcode/875-KokoEatingBananas.go)   
[877. Stone Game](./leetcode/877-StoneGame.go)   
[879. Profitable Schemes](./leetcode/879-ProfitableSchemes.go)   
[881. Boats to Save People](./leetcode/881-BoatsToSavePeople.go)   
[883. Projection Area of 3D Shapes](./leetcode/883-ProjectionAreaOf3DShapes.go)   
[885. Spiral Matrix III](./leetcode/885-SpiralMatrixIII.go)   
[888. Fair Candy Swap](./leetcode/888-FairCandySwap.go)   
[891. Sum of Subsequence Widths](./leetcode/891-SumOfSubsequenceWidths.go)   
[892. Surface Area of 3D Shapes](./leetcode/892-SurfaceAreaOf3DShapes.go)   
[893. Groups of Special-Equivalent Strings](./leetcode/893-GroupsOfSpecialEquivalentStrings.go)   
[896. Monotonic Array](./leetcode/896-MonotonicArray.go)   
[898. Bitwise ORs of Subarrays](./leetcode/898-BitwiseORsOfSubarrays.go)   
[902. Numbers At Most N Given Digit Set](./leetcode/902-NumbersAtMostNGivenDigitSet.go)   
[904. Fruit Into Baskets](./leetcode/904-FruitIntoBaskets.go)   
[905. Sort Array By Parity](./leetcode/905-SortArrayByParity.go)   
[907. Sum of Subarray Minimums](./leetcode/907-SumOfSubarrayMinimums.go)   
[908. Smallest Range I](./leetcode/908-SmallestRangeI.go)   
[909. Snakes and Ladders](./leetcode/909-SnakesAndLadders.go)   
[912. Sort an Array](./leetcode/912-SortAnArray.go)   
[914. X of a Kind in a Deck of Cards](./leetcode/914-XOfAKindInADeckOfCards.go)   
[915. Partition Array into Disjoint Intervals](./leetcode/915-PartitionArrayIntoDisjointIntervals.go)   
[916. Word Subsets](./leetcode/916-WordSubsets.go)   
[918. Maximum Sum Circular Subarray](./leetcode/918-MaximumSumCircularSubarray.go)   
[922. Sort Array By Parity II](./leetcode/922-SortArrayByParityII.go)   
[923. 3Sum With Multiplicity](./leetcode/923-3SumWithMultiplicity.go)   
[927. Three Equal Parts](./leetcode/927-ThreeEqualParts.go)   
[929. Unique Email Addresses](./leetcode/929-UniqueEmailAddresses.go)   
[930. Binary Subarrays With Sum](./leetcode/930-BinarySubarraysWithSum.go)   
[931. Minimum Falling Path Sum](./leetcode/931-MinimumFallingPathSum.go)   
[932. Beautiful Array](./leetcode/932-BeautifulArray.go)   
[934. Shortest Bridge](./leetcode/934-ShortestBridge.go)   
[937. Reorder Data in Log Files](./leetcode/937-ReorderDataInLogFiles.go)   
[939. Minimum Area Rectangle](./leetcode/939-MinimumAreaRectangle.go)   
[941. Valid Mountain Array](./leetcode/941-ValidMountainArray.go)   
[943. Find the Shortest Superstring](./leetcode/943-FindTheShortestSuperstring.go)   
[944. Delete Columns to Make Sorted](./leetcode/944-DeleteColumnsToMakeSorted.go)   
[945. Minimum Increment to Make Array Unique](./leetcode/945-MinimumIncrementToMakeArrayUnique.go)   
[946. Validate Stack Sequences](./leetcode/946-ValidateStackSequences.go)   
[947. Most Stones Removed with Same Row or Column](./leetcode/947-MostStonesRemovedWithSameRowOrColumn.go)   
[948. Bag of Tokens](./leetcode/948-BagOfTokens.go)   
[949. Largest Time for Given Digits](./leetcode/949-LargestTimeForGivenDigits.go)   
[950. Reveal Cards In Increasing Order](./leetcode/950-RevealCardsInIncreasingOrder.go)   
[952. Largest Component Size by Common Factor](./leetcode/952-LargestComponentSizeByCommonFactor.go)   
[953. Verifying an Alien Dictionary](./leetcode/953-VerifyingAnAlienDictionary.go)   
[954. Array of Doubled Pairs](./leetcode/954-ArrayOfDoubledPairs.go)   
[955. Delete Columns to Make Sorted II](./leetcode/955-DeleteColumnsToMakeSortedII.go)   
[956. Tallest Billboard](./leetcode/956-TallestBillboard.go)   
[957. Prison Cells After N Days](./leetcode/957-PrisonCellsAfterNDays.go)   
[959. Regions Cut By Slashes](./leetcode/959-RegionsCutBySlashes.go)   
[960. Delete Columns to Make Sorted III](./leetcode/960-DeleteColumnsToMakeSortedIII.go)   
[961. N-Repeated Element in Size 2N Array](./leetcode/961-NRepeatedElementInSize2NArray.go)   
[962. Maximum Width Ramp](./leetcode/962-MaximumWidthRamp.go)   
[963. Minimum Area Rectangle II](./leetcode/963-MinimumAreaRectangleII.go)   
[966. Vowel Spellchecker](./leetcode/966-VowelSpellchecker.go)   
[969. Pancake Sorting](./leetcode/969-PancakeSorting.go)   
[973. K Closest Points to Origin](./leetcode/973-KClosestPointsToOrigin.go)   
[974. Subarray Sums Divisible by K](./leetcode/974-SubarraySumsDivisibleByK.go)   
[975. Odd Even Jump](./leetcode/975-OddEvenJump.go)   
[976. Largest Perimeter Triangle](./leetcode/976-LargestPerimeterTriangle.go)   
[977. Squares of a Sorted Array](./leetcode/977-SquaresOfASortedArray.go)   
[978. Longest Turbulent Subarray](./leetcode/978-LongestTurbulentSubarray.go)   
[980. Unique Paths III](./leetcode/980-UniquePathsIII.go)   
[982. Triples with Bitwise AND Equal To Zero](./leetcode/982-TriplesWithBitwiseANDEqualToZero.go)   
[983. Minimum Cost For Tickets](./leetcode/983-MinimumCostForTickets.go)   
[985. Sum of Even Numbers After Queries](./leetcode/985-SumOfEvenNumbersAfterQueries.go)   
[986. Interval List Intersections](./leetcode/986-IntervalListIntersections.go)   
[989. Add to Array-Form of Integer](./leetcode/989-AddToArrayFormOfInteger.go)   
[990. Satisfiability of Equality Equations](./leetcode/990-SatisfiabilityOfEqualityEquations.go)   
[992. Subarrays with K Different Integers](./leetcode/992-SubarraysWithKDifferentIntegers.go)   
[994. Rotting Oranges](./leetcode/994-RottingOranges.go)   
[995. Minimum Number of K Consecutive Bit Flips](./leetcode/995-MinimumNumberOfKConsecutiveBitFlips.go)   
[996. Number of Squareful Arrays](./leetcode/996-NumberOfSquarefulArrays.go)   
[997. Find the Town Judge](./leetcode/997-FindTheTownJudge.go)   
[999. Available Captures for Rook](./leetcode/999-AvailableCapturesForRook.go)   
[1000. Minimum Cost to Merge Stones](./leetcode/1000-MinimumCostToMergeStones.go)   
[1001. Grid Illumination](./leetcode/1001-GridIllumination.go)   
[1002. Find Common Characters](./leetcode/1002-FindCommonCharacters.go)   
[1004. Max Consecutive Ones III](./leetcode/1004-MaxConsecutiveOnesIII.go)   
[1005. Maximize Sum Of Array After K Negations](./leetcode/1005-MaximizeSumOfArrayAfterKNegations.go)   
[1007. Minimum Domino Rotations For Equal Row](./leetcode/1007-MinimumDominoRotationsForEqualRow.go)   
[1010. Pairs of Songs With Total Durations Divisible by 60](./leetcode/1010-PairsOfSongsWithTotalDurationsDivisibleBy60.go)   
[1011. Capacity To Ship Packages Within D Days](./leetcode/1011-CapacityToShipPackagesWithinDDays.go)   
[1013. Partition Array Into Three Parts With Equal Sum](./leetcode/1013-PartitionArrayIntoThreePartsWithEqualSum.go)   
[1014. Best Sightseeing Pair](./leetcode/1014-BestSightseeingPair.go)   
[1018. Binary Prefix Divisible By 5](./leetcode/1018-BinaryPrefixDivisibleByFive.go)   
[1020. Number of Enclaves](./leetcode/1020-NumberOfEnclaves.go)   
[1024. Video Stitching](./leetcode/1024-VideoStitching.go)   
[1027. Longest Arithmetic Subsequence](./leetcode/1027-LongestArithmeticSubsequence.go)   
[1029. Two City Scheduling](./leetcode/1029-TwoCityScheduling.go)   
[1030. Matrix Cells in Distance Order](./leetcode/1030-MatrixCellsInDistanceOrder.go)   
[1031. Maximum Sum of Two Non-Overlapping Subarrays](./leetcode/1031-MaximumSumOfTwoNonOverlappingSubarrays.go)   
[1034. Coloring A Border](./leetcode/1034-ColoringABorder.go)   
[1035. Uncrossed Lines](./leetcode/1035-UncrossedLines.go)   
[1036. Escape a Large Maze](./leetcode/1036-EscapeALargeMaze.go)   
[1037. Valid Boomerang](./leetcode/1037-ValidBoomerang.go)   
[1039. Minimum Score Triangulation of Polygon](./leetcode/1039-MinimumScoreTriangulationOfPolygon.go)   
[1040. Moving Stones Until Consecutive II](./leetcode/1040-MovingStonesUntilConsecutiveII.go)   
[1043. Partition Array for Maximum Sum](./leetcode/1043-PartitionArrayForMaximumSum.go)   
[1046. Last Stone Weight](./leetcode/1046-LastStoneWeight.go)   
[1048. Longest String Chain](./leetcode/1048-LongestStringChain.go)   
[1049. Last Stone Weight II](./leetcode/1049-LastStoneWeightII.go)   
[1051. Height Checker](./leetcode/1051-HeightChecker.go)   
[1052. Grumpy Bookstore Owner](./leetcode/1052-GrumpyBookstoreOwner.go)   
[1053. Previous Permutation With One Swap](./leetcode/1053-PreviousPermutationWithOneSwap.go)   
[1054. Distant Barcodes](./leetcode/1054-DistantBarcodes.go)   
[1057. Campus Bikes](./leetcode/1057-CampusBikes.go)   
[1058. Minimize Rounding Error to Meet Target](./leetcode/1058-MinimizeRoundingErrorToMeetTarget.go)   
[1060. Missing Element in Sorted Array](./leetcode/1060-MissingElementInSortedArray.go)   
[1063. Number of Valid Subarrays](./leetcode/1063-NumberOfValidSubarrays.go)   
[1064. Fixed Point](./leetcode/1064-FixedPoint.go)   
[1065. Index Pairs of a String](./leetcode/1065-IndexPairsOfAString.go)   
[1066. Campus Bikes II](./leetcode/1066-CampusBikesII.go)   
[1072. Flip Columns For Maximum Number of Equal Rows](./leetcode/1072-FlipColumnsForMaximumNumberOfEqualRows.go)   
[1073. Adding Two Negabinary Numbers](./leetcode/1073-AddingTwoNegabinaryNumbers.go)   
[1074. Number of Submatrices That Sum to Target](./leetcode/1074-NumberOfSubmatricesThatSumToTarget.go)   
[1085. Sum of Digits in the Minimum Number](./leetcode/1085-SumOfDigitsInTheMinimumNumber.go)   
[1086. High Five](./leetcode/1086-HighFive.go)   
[1089. Duplicate Zeros](./leetcode/1089-DuplicateZeros.go)   
[1090. Largest Values From Labels](./leetcode/1090-LargestValuesFromLabels.go)   
[1091. Shortest Path in Binary Matrix](./leetcode/1091-ShortestPathInBinaryMatrix.go)   
[1093. Statistics from a Large Sample](./leetcode/1093-StatisticsFromALargeSample.go)   
[1094. Car Pooling](./leetcode/1094-CarPooling.go)   
[1095. Find in Mountain Array](./leetcode/1095-FindInMountainArray.go)   
[1099. Two Sum Less Than K](./leetcode/1099-TwoSumLessThanK.go)   
[1101. The Earliest Moment When Everyone Become Friends](./leetcode/1101-TheEarliestMomentWhenEveryoneBecomeFriends.go)   
[1102. Path With Maximum Minimum Value](./leetcode/1102-PathWithMaximumMinimumValue.go)   
[1105. Filling Bookcase Shelves](./leetcode/1105-FillingBookcaseShelves.go)   
[1109. Corporate Flight Bookings](./leetcode/1109-CorporateFlightBookings.go)   
[1121. Divide Array Into Increasing Sequences](./leetcode/1121-DivideArrayIntoIncreasingSequences.go)   
[1122. Relative Sort Array](./leetcode/1122-RelativeSortArray.go)   
[1124. Longest Well-Performing Interval](./leetcode/1124-LongestWellPerformingInterval.go)   
[1125. Smallest Sufficient Team](./leetcode/1125-SmallestSufficientTeam.go)   
[1128. Number of Equivalent Domino Pairs](./leetcode/1128-NumberOfEquivalentDominoPairs.go)   
[1130. Minimum Cost Tree From Leaf Values](./leetcode/1130-MinimumCostTreeFromLeafValues.go)   
[1131. Maximum of Absolute Value Expression](./leetcode/1131-MaximumOfAbsoluteValueExpression.go)   
[1133. Largest Unique Number](./leetcode/1133-LargestUniqueNumber.go)   
[1139. Largest 1-Bordered Square](./leetcode/1139-LargestOneBorderedSquare.go)   
[1140. Stone Game II](./leetcode/1140-StoneGameII.go)   
[1144. Decrease Elements To Make Array Zigzag](./leetcode/1144-DecreaseElementsToMakeArrayZigzag.go)   
[1150. Check If a Number Is Majority Element in a Sorted Array](./leetcode/1150-CheckIfANumberIsMajorityElementInASortedArray.go)   
[1151. Minimum Swaps to Group All 1's Together](./leetcode/1151-MinimumSwapsToGroupAllOnesTogether.go)   
[1152. Analyze User Website Visit Pattern](./leetcode/1152-AnalyzeUserWebsiteVisitPattern.go)   
[1160. Find Words That Can Be Formed by Characters](./leetcode/1160-FindWordsThatCanBeFormedByCharacters.go)   
[1162. As Far from Land as Possible](./leetcode/1162-AsFarFromLandAsPossible.go)   
[1167. Minimum Cost to Connect Sticks](./leetcode/1167-MinimumCostToConnectSticks.go)   
[1169. Invalid Transactions](./leetcode/1169-InvalidTransactions.go)   
[1170. Compare Strings by Frequency of the Smallest Character](./leetcode/1170-CompareStringsByFrequencyOfTheSmallestCharacter.go)   
[1708. Largest Subarray Length K](./leetcode/1708-LargestSubarrayLengthK.go)   
[1176. Diet Plan Performance](./leetcode/1176-DietPlanPerformance.go)   
[1178. Number of Valid Words for Each Puzzle](./leetcode/1178-NumberOfValidWordsForEachPuzzle.go)   
[1181. Before and After Puzzle](./leetcode/1181-BeforeAndAfterPuzzle.go)   
[1182. Shortest Distance to Target Color](./leetcode/1182-ShortestDistanceToTargetColor.go)   
[1184. Distance Between Bus Stops](./leetcode/1184-DistanceBetweenBusStops.go)   
[1186. Maximum Subarray Sum with One Deletion](./leetcode/1186-MaximumSubarraySumWithOneDeletion.go)   
[1187. Make Array Strictly Increasing](./leetcode/1187-MakeArrayStrictlyIncreasing.go)   
[1191. K-Concatenation Maximum Sum](./leetcode/1191-KConcatenationMaximumSum.go)   
[1196. How Many Apples Can You Put into the Basket](./leetcode/1196-HowManyApplesCanYouPutIntoTheBasket.go)   
[1198. Find Smallest Common Element in All Rows](./leetcode/1198-FindSmallestCommonElementInAllRows.go)   
[1199. Minimum Time to Build Blocks](./leetcode/1199-MinimumTimeToBuildBlocks.go)   
[1200. Minimum Absolute Difference](./leetcode/1200-MinimumAbsoluteDifference.go)   
[1207. Unique Number of Occurrences](./leetcode/1207-UniqueNumberOfOccurrences.go)   
[1210. Minimum Moves to Reach Target with Rotations](./leetcode/1210-MinimumMovesToReachTargetWithRotations.go)   
[1213. Intersection of Three Sorted Arrays](./leetcode/1213-IntersectionOfThreeSortedArrays.go)   
[1217. Minimum Cost to Move Chips to The Same Position](./leetcode/1217-MinimumCostToMoveChipsToTheSamePosition.go)   
[1218. Longest Arithmetic Subsequence of Given Difference](./leetcode/1218-LongestArithmeticSubsequenceOfGivenDifference.go)   
[1219. Path with Maximum Gold](./leetcode/1219-PathWithMaximumGold.go)   
[1222. Queens That Can Attack the King](./leetcode/1222-QueensThatCanAttackTheKing.go)   
[1223. Dice Roll Simulation](./leetcode/1223-DiceRollSimulation.go)   
[1224. Maximum Equal Frequency](./leetcode/1224-MaximumEqualFrequency.go)   
[1228. Missing Number In Arithmetic Progression](./leetcode/1228-MissingNumberInArithmeticProgression.go)   
[1229. Meeting Scheduler](./leetcode/1229-MeetingScheduler.go)   
[1230. Toss Strange Coins](./leetcode/1230-TossStrangeCoins.go)   
[1231. Divide Chocolate](./leetcode/1231-DivideChocolate.go)   
[1232. Check If It Is a Straight Line](./leetcode/1232-CheckIfItIsAStraightLine.go)   
[1233. Remove Sub-Folders from the Filesystem](./leetcode/1233-RemoveSubFoldersFromTheFilesystem.go)   
[1235. Maximum Profit in Job Scheduling](./leetcode/1235-MaximumProfitInJobScheduling.go)   
[1243. Array Transformation](./leetcode/1243-ArrayTransformation.go)   
[1246. Palindrome Removal](./leetcode/1246-PalindromeRemoval.go)   
[1248. Count Number of Nice Subarrays](./leetcode/1248-CountNumberOfNiceSubarrays.go)   
[1250. Check If It Is a Good Array](./leetcode/1250-CheckIfItIsAGoodArray.go)   
[1252. Cells with Odd Values in a Matrix](./leetcode/1252-CellsWithOddValuesInAMatrix.go)   
[1253. Reconstruct a 2-Row Binary Matrix](./leetcode/1253-ReconstructATwoRowBinaryMatrix.go)   
[1254. Number of Closed Islands](./leetcode/1254-NumberOfClosedIslands.go)   
[1255. Maximum Score Words Formed by Letters](./leetcode/1255-MaximumScoreWordsFormedByLetters.go)   
[1260. Shift 2D Grid](./leetcode/1260-Shift2DGrid.go)   
[1262. Greatest Sum Divisible by Three](./leetcode/1262-GreatestSumDivisibleByThree.go)   
[1263. Minimum Moves to Move a Box to Their Target Location](./leetcode/1263-MinimumMovesToMoveABoxToTheirTargetLocation.go)   
[1266. Minimum Time Visiting All Points](./leetcode/1266-MinimumTimeVisitingAllPoints.go)   
[1267. Count Servers that Communicate](./leetcode/1267-CountServersThatCommunicate.go)   
[1268. Search Suggestions System](./leetcode/1268-SearchSuggestionsSystem.go)   
[1272. Remove Interval](./leetcode/1272-RemoveInterval.go)   
[1273. Delete Tree Nodes](./leetcode/1273-DeleteTreeNodes.go)   
[1274. Number of Ships in a Rectangle](./leetcode/1274-NumberOfShipsInARectangle.go)   
[1275. Find Winner on a Tic Tac Toe Game](./leetcode/1275-FindWinnerOnATicTacToeGame.go)   
[1277. Count Square Submatrices with All Ones](./leetcode/1277-CountSquareSubmatricesWithAllOnes.go)   
[1282. Group the People Given the Group Size They Belong To](./leetcode/1282-GroupThePeopleGivenTheGroupSizeTheyBelongTo.go)   
[1283. Find the Smallest Divisor Given a Threshold](./leetcode/1283-FindTheSmallestDivisorGivenAThreshold.go)   
[1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](./leetcode/1284-MinimumNumberOfFlipsToConvertBinaryMatrixToZeroMatrix.go)   
[1287. Element Appearing More Than 25% In Sorted Array](./leetcode/1287-ElementAppearingMoreThan25PercentInSortedArray.go)   
[1288. Remove Covered Intervals](./leetcode/1288-RemoveCoveredIntervals.go)   
[1289. Minimum Falling Path Sum II](./leetcode/1289-MinimumFallingPathSumII.go)   
[1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](./leetcode/1292-MaximumSideLengthOfASquareWithSumLessThanOrEqualToThreshold.go)   
[1293. Shortest Path in a Grid with Obstacles Elimination](./leetcode/1293-ShortestPathInAGridWithObstaclesElimination.go)   
[1295. Find Numbers with Even Number of Digits](./leetcode/1295-FindNumbersWithEvenNumberOfDigits.go)   
[1296. Divide Array in Sets of K Consecutive Numbers](./leetcode/1296-DivideArrayInSetsOfKConsecutiveNumbers.go)   
[1298. Maximum Candies You Can Get from Boxes](./leetcode/1298-MaximumCandiesYouCanGetFromBoxes.go)   
[1299. Replace Elements with Greatest Element on Right Side](./leetcode/1299-ReplaceElementsWithGreatestElementOnRightSide.go)   
[1300. Sum of Mutated Array Closest to Target](./leetcode/1300-SumOfMutatedArrayClosestToTarget.go)   
[1301. Number of Paths with Max Score](./leetcode/1301-NumberOfPathsWithMaxScore.go)   
[1306. Jump Game III](./leetcode/1306-JumpGameIII.go)   
[1307. Verbal Arithmetic Puzzle](./leetcode/1307-VerbalArithmeticPuzzle.go)   
[1310. XOR Queries of a Subarray](./leetcode/1310-XORQueriesOfASubarray.go)   
[1311. Get Watched Videos by Your Friends](./leetcode/1311-GetWatchedVideosByYourFriends.go)   
[1313. Decompress Run-Length Encoded List](./leetcode/1313-DecompressRunLengthEncodedList.go)   
[1314. Matrix Block Sum](./leetcode/1314-MatrixBlockSum.go)   
[1326. Minimum Number of Taps to Open to Water a Garden](./leetcode/1326-MinimumNumberOfTapsToOpenToWaterAGarden.go)   
[1329. Sort the Matrix Diagonally](./leetcode/1329-SortTheMatrixDiagonally.go)   
[1330. Reverse Subarray To Maximize Array Value](./leetcode/1330-ReverseSubarrayToMaximizeArrayValue.go)   
[1331. Rank Transform of an Array](./leetcode/1331-RankTransformOfAnArray.go)   
[1333. Filter Restaurants by Vegan-Friendly, Price and Distance](./leetcode/1333-FilterRestaurantsByVeganFriendlyPriceAndDistance.go)   
[1335. Minimum Difficulty of a Job Schedule](./leetcode/1335-MinimumDifficultyOfAJobSchedule.go)   
[1337. The K Weakest Rows in a Matrix](./leetcode/1337-TheKWeakestRowsInAMatrix.go)   
[1338. Reduce Array Size to The Half](./leetcode/1338-ReduceArraySizeToTheHalf.go)   
[1340. Jump Game V](./leetcode/1340-JumpGameV.go)   
[1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](./leetcode/1343-NumberOfSubArraysOfSizeKAndAverageGreaterThanOrEqualToThreshold.go)   
[1345. Jump Game IV](./leetcode/1345-JumpGameIV.go)   
[1346. Check If N and Its Double Exist](./leetcode/1346-CheckIfNAndItsDoubleExist.go)   
[1349. Maximum Students Taking Exam](./leetcode/1349-MaximumStudentsTakingExam.go)   
[1351. Count Negative Numbers in a Sorted Matrix](./leetcode/1351-CountNegativeNumbersInASortedMatrix.go)   
[1354. Construct Target Array With Multiple Sums](./leetcode/1354-ConstructTargetArrayWithMultipleSums.go)   
[1353. Maximum Number of Events That Can Be Attended](./leetcode/1353-MaximumNumberOfEventsThatCanBeAttended.go)   
[1356. Sort Integers by The Number of 1 Bits](./leetcode/1356-SortIntegersByTheNumberOfOneBits.go)   
[1363. Largest Multiple of Three](./leetcode/1363-LargestMultipleOfThree.go)   
[1365. How Many Numbers Are Smaller Than the Current Number](./leetcode/1365-HowManyNumbersAreSmallerThanTheCurrentNumber.go)   
[1366. Rank Teams by Votes](./leetcode/1366-RankTeamsByVotes.go)   
[1368. Minimum Cost to Make at Least One Valid Path in a Grid](./leetcode/1368-MinimumCostToMakeAtLeastOneValidPathInAGrid.go)   
[1375. Number of Times Binary String Is Prefix-Aligned](./leetcode/1375-NumberOfTimesBinaryStringIsPrefixAligned.go)   
[1380. Lucky Numbers in a Matrix](./leetcode/1380-LuckyNumbersInAMatrix.go)   
[1383. Maximum Performance of a Team](./leetcode/1383-MaximumPerformanceOfATeam.go)   
[1385. Find the Distance Value Between Two Arrays](./leetcode/1385-FindTheDistanceValueBetweenTwoArrays.go)   
[1386. Cinema Seat Allocation](./leetcode/1386-CinemaSeatAllocation.go)   
[1388. Pizza With 3n Slices](./leetcode/1388-PizzaWith3nSlices.go)   
[1389. Create Target Array in the Given Order](./leetcode/1389-CreateTargetArrayInTheGivenOrder.go)   
[1390. Four Divisors](./leetcode/1390-FourDivisors.go)   
[1391. Check if There is a Valid Path in a Grid](./leetcode/1391-CheckIfThereIsAValidPathInAGrid.go)   
[1394. Find Lucky Integer in an Array](./leetcode/1394-FindLuckyIntegerInAnArray.go)   
[1395. Count Number of Teams](./leetcode/1395-CountNumberOfTeams.go)   
[1402. Reducing Dishes](./leetcode/1402-ReducingDishes.go)   
[1403. Minimum Subsequence in Non-Increasing Order](./leetcode/1403-MinimumSubsequenceInNonIncreasingOrder.go)   
[1406. Stone Game III](./leetcode/1406-StoneGameIII.go)   
[1408. String Matching in an Array](./leetcode/1408-StringMatchingInAnArray.go)   
[1409. Queries on a Permutation With Key](./leetcode/1409-QueriesOnAPermutationWithKey.go)   
[1413. Minimum Value to Get Positive Step by Step Sum](./leetcode/1413-MinimumValueToGetPositiveStepByStepSum.go)   
[1418. Display Table of Food Orders in a Restaurant](./leetcode/1418-DisplayTableOfFoodOrdersInARestaurant.go)   
[1423. Maximum Points You Can Obtain from Cards](./leetcode/1423-MaximumPointsYouCanObtainFromCards.go)   
[1424. Diagonal Traverse II](./leetcode/1424-DiagonalTraverseII.go)   
[1425. Constrained Subsequence Sum](./leetcode/1425-ConstrainedSubsequenceSum.go)   
[1426. Counting Elements](./leetcode/1426-CountingElements.go)   
[1428. Leftmost Column with at Least a One](./leetcode/1428-LeftmostColumnWithAtLeastAOne.go)   
[1431. Kids With the Greatest Number of Candies](./leetcode/1431-KidsWithTheGreatestNumberOfCandies.go)   
[1434. Number of Ways to Wear Different Hats to Each Other](./leetcode/1434-NumberOfWaysToWearDifferentHatsToEachOther.go)   
[1436. Destination City](./leetcode/1436-DestinationCity.go)   
[1437. Check If All 1's Are at Least Length K Places Away](./leetcode/1437-CheckIfAllOnesAreAtLeastLengthKPlacesAway.go)   
[1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](./leetcode/1438-LongestContinuousSubarrayWithAbsoluteDiffLessThanOrEqualToLimit.go)   
[1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](./leetcode/1439-FindTheKthSmallestSumOfAMatrixWithSortedRows.go)   
[1441. Build an Array With Stack Operations](./leetcode/1441-BuildAnArrayWithStackOperations.go)   
[1442. Count Triplets That Can Form Two Arrays of Equal XOR](./leetcode/1442-CountTripletsThatCanFormTwoArraysOfEqualXOR.go)   
[1444. Number of Ways of Cutting a Pizza](./leetcode/1444-NumberOfWaysOfCuttingAPizza.go)   
[1449. Form Largest Integer With Digits That Add up to Target](./leetcode/1449-FormLargestIntegerWithDigitsThatAddUpToTarget.go)   
[1450. Number of Students Doing Homework at a Given Time](./leetcode/1450-NumberOfStudentsDoingHomeworkAtAGivenTime.go)   
[1452. People Whose List of Favorite Companies Is Not a Subset of Another List](./leetcode/1452-PeopleWhoseListOfFavoriteCompaniesIsNotASubsetOfAnotherList.go)   
[1453. Maximum Number of Darts Inside of a Circular Dartboard](./leetcode/1453-MaximumNumberOfDartsInsideOfACircularDartboard.go)   
[1458. Max Dot Product of Two Subsequences](./leetcode/1458-MaxDotProductOfTwoSubsequences.go)   
[1460. Make Two Arrays Equal by Reversing Subarrays](./leetcode/1460-MakeTwoArraysEqualByReversingSubarrays.go)   
[1463. Cherry Pickup II](./leetcode/1463-CherryPickupII.go)   
[1464. Maximum Product of Two Elements in an Array](./leetcode/1464-MaximumProductOfTwoElementsInAnArray.go)   
[1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](./leetcode/1465-MaximumAreaOfAPieceOfCakeAfterHorizontalAndVerticalCuts.go)   
[1470. Shuffle the Array](./leetcode/1470-ShuffleTheArray.go)   
[1471. The k Strongest Values in an Array](./leetcode/1471-TheKStrongestValuesInAnArray.go)   
[1473. Paint House III](./leetcode/1473-PaintHouseIII.go)   
[1475. Final Prices With a Special Discount in a Shop](./leetcode/1475-FinalPricesWithASpecialDiscountInAShop.go)   
[1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](./leetcode/1477-FindTwoNonOverlappingSubArraysEachWithTargetSum.go)   

[1478. Allocate Mailboxes](./leetcode/1478-AllocateMailboxes.go)   
[1480. Running Sum of 1d Array](./leetcode/1480-RunningSumOf1dArray.go)   
[1481. Least Number of Unique Integers after K Removals](./leetcode/1481-LeastNumberOfUniqueIntegersAfterKRemovals.go)   
[1482. Minimum Number of Days to Make m Bouquets](./leetcode/1482-MinimumNumberOfDaysToMakeMBouquets.go)   
[1487. Making File Names Unique](./leetcode/1487-MakingFileNamesUnique.go)   
[1488. Avoid Flood in The City](./leetcode/1488-AvoidFloodInTheCity.go)   
[1491. Average Salary Excluding the Minimum and Maximum Salary](./leetcode/1491-AverageSalaryExcludingTheMinimumAndMaximumSalary.go)   
[1493. Longest Subarray of 1's After Deleting One Element](./leetcode/1493-LongestSubarrayOf1sAfterDeletingOneElement.go)   
[1497. Check If Array Pairs Are Divisible by k](./leetcode/1497-CheckIfArrayPairsAreDivisibleByk.go)   
[1498. Number of Subsequences That Satisfy the Given Sum Condition](./leetcode/1498-NumberOfSubsequencesThatSatisfyTheGivenSumCondition.go)   
[1499. Max Value of Equation](./leetcode/1499-MaxValueOfEquation.go)   
[1502. Can Make Arithmetic Progression From Sequence](./leetcode/1502-CanMakeArithmeticProgressionFromSequence.go)   
[1503. Last Moment Before All Ants Fall Out of a Plank](./leetcode/1503-LastMomentBeforeAllAntsFallOutOfAPlank.go)   
[1504. Count Submatrices With All Ones](./leetcode/1504-CountSubmatricesWithAllOnes.go)   
[1508. Range Sum of Sorted Subarray Sums](./leetcode/1508-RangeSumOfSortedSubarraySums.go)   
[1509. Minimum Difference Between Largest and Smallest Value in Three Moves](./leetcode/1509-MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves.go)   
[1512. Number of Good Pairs](./leetcode/1512-NumberOfGoodPairs.go)   
[1515. Best Position for a Service Centre](./leetcode/1515-BestPositionForAServiceCentre.go)   
[1521. Find a Value of a Mysterious Function Closest to Target](./leetcode/1521-FindAValueOfAMysteriousFunctionClosestToTarget.go)   
[1524. Number of Sub-arrays With Odd Sum](./leetcode/1524-NumberOfSubArraysWithOddSum.go)   
[1526. Minimum Number of Increments on Subarrays to Form a Target Array](./leetcode/1526-MinimumNumberOfIncrementsOnSubarraysToFormATargetArray.go)   
[1533. Find the Index of the Large Integer](./leetcode/1533-FindTheIndexOfTheLargeInteger.go)   
[1534. Count Good Triplets](./leetcode/1534-CountGoodTriplets.go)   
[1535. Find the Winner of an Array Game](./leetcode/1535-FindTheWinnerOfAnArrayGame.go)   
[1536. Minimum Swaps to Arrange a Binary Grid](./leetcode/1536-MinimumSwapsToArrangeABinaryGrid.go)   
[1537. Get the Maximum Score](./leetcode/1537-GetTheMaximumScore.go)   
[1538. Guess the Majority in a Hidden Array](./leetcode/1538-GuessTheMajorityInAHiddenArray.go)   
[1539. Kth Missing Positive Number](./leetcode/1539-KthMissingPositiveNumber.go)   
[1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](./leetcode/1546-MaximumNumberOfNonOverlappingSubarraysWithSumEqualsTarget.go)   
[1547. Minimum Cost to Cut a Stick](./leetcode/1547-MinimumCostToCutAStick.go)   
[1550. Three Consecutive Odds](./leetcode/1550-ThreeConsecutiveOdds.go)   
[1552. Magnetic Force Between Two Balls](./leetcode/1552-MagneticForceBetweenTwoBalls.go)   
[1554. Strings Differ by One Character](./leetcode/1554-StringsDifferByOneCharacter.go)   
[1558. Minimum Numbers of Function Calls to Make Target Array](./leetcode/1558-MinimumNumbersOfFunctionCallsToMakeTargetArray.go)   
[1559. Detect Cycles in 2D Grid](./leetcode/1559-DetectCyclesIn2DGrid.go)   
[1560. Most Visited Sector in a Circular Track](./leetcode/1560-MostVisitedSectorInACircularTrack.go)   
[1561. Maximum Number of Coins You Can Get](./leetcode/1561-MaximumNumberOfCoinsYouCanGet.go)   
[1562. Find Latest Group of Size M](./leetcode/1562-FindLatestGroupOfSizeM.go)   
[1563. Stone Game V](./leetcode/1563-StoneGameV.go)   
[1564. Put Boxes Into the Warehouse I](./leetcode/1564-PutBoxesIntoTheWarehouseI.go)   
[1566. Detect Pattern of Length M Repeated K or More Times](./leetcode/1566-DetectPatternOfLengthMRepeatedKOrMoreTimes.go)   
[1567. Maximum Length of Subarray With Positive Product](./leetcode/1567-MaximumLengthOfSubarrayWithPositiveProduct.go)   
[1568. Minimum Number of Days to Disconnect Island](./leetcode/1568-MinimumNumberOfDaysToDisconnectIsland.go)   
[1572. Matrix Diagonal Sum](./leetcode/1572-MatrixDiagonalSum.go)   
[1574. Shortest Subarray to be Removed to Make Array Sorted](./leetcode/1574-ShortestSubarrayToBeRemovedToMakeArraySorted.go)   
[1575. Count All Possible Routes](./leetcode/1575-CountAllPossibleRoutes.go)   
[1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers](./leetcode/1577-NumberOfWaysWhereSquareOfNumberIsEqualToProductOfTwoNumbers.go)   
[1578. Minimum Time to Make Rope Colorful](./leetcode/1578-MinimumTimeToMakeRopeColorful.go)   
[1580. Put Boxes Into the Warehouse II](./leetcode/1580-PutBoxesIntoTheWarehouseII.go)   
[1582. Special Positions in a Binary Matrix](./leetcode/1582-SpecialPositionsInABinaryMatrix.go)   
[1583. Count Unhappy Friends](./leetcode/1583-CountUnhappyFriends.go)   
[1588. Sum of All Odd Length Subarrays](./leetcode/1588-SumOfAllOddLengthSubarrays.go)   
[1589. Maximum Sum Obtained of Any Permutation](./leetcode/1589-MaximumSumObtainedOfAnyPermutation.go)   
[1590. Make Sum Divisible by P](./leetcode/1590-MakeSumDivisibleByP.go)   
[1591. Strange Printer II](./leetcode/1591-StrangePrinterII.go)   
[1594. Maximum Non Negative Product in a Matrix](./leetcode/1594-MaximumNonNegativeProductInAMatrix.go)   
[1595. Minimum Cost to Connect Two Groups of Points](./leetcode/1595-MinimumCostToConnectTwoGroupsOfPoints.go)   
[1599. Maximum Profit of Operating a Centennial Wheel](./leetcode/1599-MaximumProfitOfOperatingACentennialWheel.go)   
[1601. Maximum Number of Achievable Transfer Requests](./leetcode/1601-MaximumNumberOfAchievableTransferRequests.go)   
[1604. Alert Using Same Key-Card Three or More Times in a One Hour Period](./leetcode/1604-AlertUsingSameKeyCardThreeOrMoreTimesInAOneHourPeriod.go)   
[1605. Find Valid Matrix Given Row and Column Sums](./leetcode/1605-FindValidMatrixGivenRowAndColumnSums.go)   
[1606. Find Servers That Handled Most Number of Requests](./leetcode/1606-FindServersThatHandledMostNumberOfRequests.go)   
[1608. Special Array With X Elements Greater Than or Equal X](./leetcode/1608-SpecialArrayWithXElementsGreaterThanOrEqualX.go)   
[1610. Maximum Number of Visible Points](./leetcode/1610-MaximumNumberOfVisiblePoints.go)   
[1619. Mean of Array After Removing Some Elements](./leetcode/1619-MeanOfArrayAfterRemovingSomeElements.go)   
[1620. Coordinate With Maximum Network Quality](./leetcode/1620-CoordinateWithMaximumNetworkQuality.go)   
[1626. Best Team With No Conflicts](./leetcode/1626-BestTeamWithNoConflicts.go)   
[1627. Graph Connectivity With Threshold](./leetcode/1627-GraphConnectivityWithThreshold.go)   
[1629. Slowest Key](./leetcode/1629-SlowestKey.go)   
[1630. Arithmetic Subarrays](./leetcode/1630-ArithmeticSubarrays.go)   
[1631. Path With Minimum Effort](./leetcode/1631-PathWithMinimumEffort.go)   
[1632. Rank Transform of a Matrix](./leetcode/1632-RankTransformOfAMatrix.go)   
[1636. Sort Array by Increasing Frequency](./leetcode/1636-SortArrayByIncreasingFrequency.go)   
[1637. Widest Vertical Area Between Two Points Containing No Points](./leetcode/1637-WidestVerticalAreaBetweenTwoPointsContainingNoPoints.go)   
[1639. Number of Ways to Form a Target String Given a Dictionary](./leetcode/1639-NumberOfWaysToFormATargetStringGivenADictionary.go)   
[1640. Check Array Formation Through Concatenation](./leetcode/1640-CheckArrayFormationThroughConcatenation.go)   
[1642. Furthest Building You Can Reach](./leetcode/1642-FurthestBuildingYouCanReach.go)   
[1643. Kth Smallest Instructions](./leetcode/1643-KthSmallestInstructions.go)   
[1646. Get Maximum in Generated Array](./leetcode/1646-GetMaximumInGeneratedArray.go)   
[1648. Sell Diminishing-Valued Colored Balls](./leetcode/1648-SellDiminishingValuedColoredBalls.go)   
[1649. Create Sorted Array through Instructions](./leetcode/1649-CreateSortedArrayThroughInstructions.go)   
[1652. Defuse the Bomb](./leetcode/1652-DefuseTheBomb.go)   
[1654. Minimum Jumps to Reach Home](./leetcode/1654-MinimumJumpsToReachHome.go)   
[1655. Distribute Repeating Integers](./leetcode/1655-DistributeRepeatingIntegers.go)   
[1658. Minimum Operations to Reduce X to Zero](./leetcode/1658-MinimumOperationsToReduceXToZero.go)   
[1662. Check If Two String Arrays are Equivalent](./leetcode/1662-CheckIfTwoStringArraysAreEquivalent.go)   
[1664. Ways to Make a Fair Array](./leetcode/1664-WaysToMakeAFairArray.go)   
[1665. Minimum Initial Energy to Finish Tasks](./leetcode/1665-MinimumInitialEnergyToFinishTasks.go)   
[1671. Minimum Number of Removals to Make Mountain Array](./leetcode/1671-MinimumNumberOfRemovalsToMakeMountainArray.go)   
[1672. Richest Customer Wealth](./leetcode/1672-RichestCustomerWealth.go)   
[1673. Find the Most Competitive Subsequence](./leetcode/1673-FindTheMostCompetitiveSubsequence.go)   
[1674. Minimum Moves to Make Array Complementary](./leetcode/1674-MinimumMovesToMakeArrayComplementary.go)   
[1675. Minimize Deviation in Array](./leetcode/1675-MinimizeDeviationInArray.go)   
[1679. Max Number of K-Sum Pairs](./leetcode/1679-MaxNumberOfKSumPairs.go)   
[1681. Minimum Incompatibility](./leetcode/1681-MinimumIncompatibility.go)   
[1685. Sum of Absolute Differences in a Sorted Array](./leetcode/1685-SumOfAbsoluteDifferencesInASortedArray.go)   
[1686. Stone Game VI](./leetcode/1686-StoneGameVI.go)   
[1687. Delivering Boxes from Storage to Ports](./leetcode/1687-DeliveringBoxesFromStorageToPorts.go)   
[1690. Stone Game VII](./leetcode/1690-StoneGameVII.go)   
[1691. Maximum Height by Stacking Cuboids](./leetcode/1691-MaximumHeightByStackingCuboids.go)   
[1695. Maximum Erasure Value](./leetcode/1695-MaximumErasureValue.go)   
[1696. Jump Game VI](./leetcode/1696-JumpGameVI.go)   
[1700. Number of Students Unable to Eat Lunch](./leetcode/1700-NumberOfStudentsUnableToEatLunch.go)   
[1703. Minimum Adjacent Swaps for K Consecutive Ones](./leetcode/1703-MinimumAdjacentSwapsForKConsecutiveOnes.go)   
[1705. Maximum Number of Eaten Apples](./leetcode/1705-MaximumNumberOfEatenApples.go)   
[1706. Where Will the Ball Fall](./leetcode/1706-WhereWillTheBallFall.go)   
[1707. Maximum XOR With an Element From Array](./leetcode/1707-MaximumXORWithAnElementFromArray.go)   
[1710. Maximum Units on a Truck](./leetcode/1710-MaximumUnitsOnATruck.go)   
[1711. Count Good Meals](./leetcode/1711-CountGoodMeals.go)   
[1712. Ways to Split Array Into Three Subarrays](./leetcode/1712-WaysToSplitArrayIntoThreeSubarrays.go)   
[1713. Minimum Operations to Make a Subsequence](./leetcode/1713-MinimumOperationsToMakeASubsequence.go)   
[1714. Sum Of Special Evenly-Spaced Elements In Array](./leetcode/1714-SumOfSpecialEvenlySpacedElementsInArray.go)   
[1718. Construct the Lexicographically Largest Valid Sequence](./leetcode/1718-ConstructTheLexicographicallyLargestValidSequence.go)   
[1720. Decode XORed Array](./leetcode/1720-DecodeXORedArray.go)   
[1722. Minimize Hamming Distance After Swap Operations](./leetcode/1722-MinimizeHammingDistanceAfterSwapOperations.go)   
[1723. Find Minimum Time to Finish All Jobs](./leetcode/1723-FindMinimumTimeToFinishAllJobs.go)   
[1725. Number Of Rectangles That Can Form The Largest Square](./leetcode/1725-NumberOfRectanglesThatCanFormTheLargestSquare.go)   
[1726. Tuple with Same Product](./leetcode/1726-TupleWithSameProduct.go)   
[1727. Largest Submatrix With Rearrangements](./leetcode/1727-LargestSubmatrixWithRearrangements.go)   
[1728. Cat and Mouse II](./leetcode/1728-CatAndMouseII.go)   
[1730. Shortest Path to Get Food](./leetcode/1730-ShortestPathToGetFood.go)   
[1732. Find the Highest Altitude](./leetcode/1732-FindTheHighestAltitude.go)   
[1733. Minimum Number of People to Teach](./leetcode/1733-MinimumNumberOfPeopleToTeach.go)   
[1734. Decode XORed Permutation](./leetcode/1734-DecodeXORedPermutation.go)   
[1735. Count Ways to Make Array With Product](./leetcode/1735-CountWaysToMakeArrayWithProduct.go)   
[1738. Find Kth Largest XOR Coordinate Value](./leetcode/1738-FindKthLargestXORCoordinateValue.go)   
[1743. Restore the Array From Adjacent Pairs](./leetcode/1743-RestoreTheArrayFromAdjacentPairs.go)   
[1744. Can You Eat Your Favorite Candy on Your Favorite Day?](./leetcode/1744-CanYouEatYourFavoriteCandyOnYourFavoriteDay.go)   
[1746. Maximum Subarray Sum After One Operation](./leetcode/1746-MaximumSubarraySumAfterOneOperation.go)   
[1748. Sum of Unique Elements](./leetcode/1748-SumOfUniqueElements.go)   
[1749. Maximum Absolute Sum of Any Subarray](./leetcode/1749-MaximumAbsoluteSumOfAnySubarray.go)   
[1751. Maximum Number of Events That Can Be Attended II](./leetcode/1751-MaximumNumberOfEventsThatCanBeAttendedII.go)   
[1752. Check if Array Is Sorted and Rotated](./leetcode/1752-CheckIfArrayIsSortedAndRotated.go)   
[1755. Closest Subsequence Sum](./leetcode/1755-ClosestSubsequenceSum.go)   
[1760. Minimum Limit of Balls in a Bag](./leetcode/1760-MinimumLimitOfBallsInABag.go)   
[1762. Buildings With an Ocean View](./leetcode/1762-BuildingsWithAnOceanView.go)   
[1764. Form Array by Concatenating Subarrays of Another Array](./leetcode/1764-FormArrayByConcatenatingSubarraysOfAnotherArray.go)   
[1765. Map of Highest Peak](./leetcode/1765-MapOfHighestPeak.go)   
[1766. Tree of Coprimes](./leetcode/1766-TreeOfCoprimes.go)   
[1770. Maximum Score from Performing Multiplication Operations](./leetcode/1770-MaximumScoreFromPerformingMultiplicationOperations.go)   
[1772. Sort Features by Popularity](./leetcode/1772-SortFeaturesByPopularity.go)   
[1773. Count Items Matching a Rule](./leetcode/1773-CountItemsMatchingARule.go)   
[1774. Closest Dessert Cost](./leetcode/1774-ClosestDessertCost.go)   
[1775. Equal Sum Arrays With Minimum Number of Operations](./leetcode/1775-EqualSumArraysWithMinimumNumberOfOperations.go)   
[1776. Car Fleet II](./leetcode/1776-CarFleetII.go)   
[1778. Shortest Path in a Hidden Grid](./leetcode/1778-ShortestPathInAHiddenGrid.go)   
[1779. Find Nearest Point That Has the Same X or Y Coordinate](./leetcode/1779-FindNearestPointThatHasTheSameXOrYCoordinate.go)   
[1782. Count Pairs Of Nodes](./leetcode/1782-CountPairsOfNodes.go)   
[1785. Minimum Elements to Add to Form a Given Sum](./leetcode/1785-MinimumElementsToAddToFormAGivenSum.go)   
[1787. Make the XOR of All Segments Equal to Zero](./leetcode/1787-MakeTheXOROfAllSegmentsEqualToZero.go)   
[1788. Maximize the Beauty of the Garden](./leetcode/1788-MaximizeTheBeautyOfTheGarden.go)   
[1792. Maximum Average Pass Ratio](./leetcode/1792-MaximumAveragePassRatio.go)   
[1793. Maximum Score of a Good Subarray](./leetcode/1793-MaximumScoreOfAGoodSubarray.go)   
[1798. Maximum Number of Consecutive Values You Can Make](./leetcode/1798-MaximumNumberOfConsecutiveValuesYouCanMake.go)   
[1799. Maximize Score After N Operations](./leetcode/1799-MaximizeScoreAfterNOperations.go)   
[1800. Maximum Ascending Subarray Sum](./leetcode/1800-MaximumAscendingSubarraySum.go)   
[1801. Number of Orders in the Backlog](./leetcode/1801-NumberOfOrdersInTheBacklog.go)   
[1803. Count Pairs With XOR in a Range](./leetcode/1803-CountPairsWithXORInARange.go)   
[1810. Minimum Path Cost in a Hidden Grid](./leetcode/1810-MinimumPathCostInAHiddenGrid.go)   
[1812. Determine Color of a Chessboard Square](./leetcode/1812-DetermineColorOfAChessboardSquare.go)   
[1814. Count Nice Pairs in an Array](./leetcode/1814-CountNicePairsInAnArray.go)   
[1815. Maximum Number of Groups Getting Fresh Donuts](./leetcode/1815-MaximumNumberOfGroupsGettingFreshDonuts.go)   
[1817. Finding the Users Active Minutes](./leetcode/1817-FindingTheUsersActiveMinutes.go)   
[1818. Minimum Absolute Sum Difference](./leetcode/1818-MinimumAbsoluteSumDifference.go)   
[1819. Number of Different Subsequences GCDs](./leetcode/1819-NumberOfDifferentSubsequencesGCDs.go)   
[1820. Maximum Number of Accepted Invitations](./leetcode/1820-MaximumNumberOfAcceptedInvitations.go)   
[1822. Sign of the Product of an Array](./leetcode/1822-SignOfTheProductOfAnArray.go)   
[1824. Minimum Sideway Jumps](./leetcode/1824-MinimumSidewayJumps.go)   
[1826. Faulty Sensor](./leetcode/1826-FaultySensor.go)   
[1827. Minimum Operations to Make the Array Increasing](./leetcode/1827-MinimumOperationsToMakeTheArrayIncreasing.go)   
[1828. Queries on Number of Points Inside a Circle](./leetcode/1828-QueriesOnNumberOfPointsInsideACircle.go)   
[1829. Maximum XOR for Each Query](./leetcode/1829-MaximumXORForEachQuery.go)   
[1833. Maximum Ice Cream Bars](./leetcode/1833-MaximumIceCreamBars.go)   
[1834. Single-Threaded CPU](./leetcode/1834-SingleThreadedCPU.go)   
[1835. Find XOR Sum of All Pairs Bitwise AND](./leetcode/1835-FindXORSumOfAllPairsBitwiseAND.go)   
[1838. Frequency of the Most Frequent Element](./leetcode/1838-FrequencyOfTheMostFrequentElement.go)   
[1840. Maximum Building Height](./leetcode/1840-MaximumBuildingHeight.go)   
[1846. Maximum Element After Decreasing and Rearranging](./leetcode/1846-MaximumElementAfterDecreasingAndRearranging.go)   
[1847. Closest Room](./leetcode/1847-ClosestRoom.go)   
[1848. Minimum Distance to the Target Element](./leetcode/1848-MinimumDistanceToTheTargetElement.go)   
[1851. Minimum Interval to Include Eac](./leetcode/1851-MinimumIntervalToIncludeEac.go)   
[1852. Distinct Numbers in Each Subarray](./leetcode/1852-DistinctNumbersInEachSubarray.go)   
[1854. Maximum Population Year](./leetcode/1854-MaximumPopulationYear.go)   
[1855. Maximum Distance Between a Pair of Values](./leetcode/1855-MaximumDistanceBetweenAPairOfValues.go)   
[1856. Maximum Subarray Min-Product](./leetcode/1856-MaximumSubarrayMinProduct.go)   
[1858. Longest Word With All Prefixes](./leetcode/1858-LongestWordWithAllPrefixes.go)   
[1861. Rotating the Box](./leetcode/1861-RotatingTheBox.go)   
[1862. Sum of Floored Pairs](./leetcode/1862-SumOfFlooredPairs.go)   
[1863. Sum of All Subset XOR Totals](./leetcode/1863-SumOfAllSubsetXORTotals.go)   
[1868. Product of Two Run-Length Encoded Arrays](./leetcode/1868-ProductOfTwoRunLengthEncodedArrays.go)   
[1870. Minimum Speed to Arrive on Time](./leetcode/1870-MinimumSpeedToArriveOnTime.go)   
[1872. Stone Game VIII](./leetcode/1872-StoneGameVIII.go)   
[1874. Minimize Product Sum of Two Arrays](./leetcode/1874-MinimizeProductSumOfTwoArrays.go)   
[1877. Minimize Maximum Pair Sum in Array](./leetcode/1877-MinimizeMaximumPairSumInArray.go)   
[1878. Get Biggest Three Rhombus Sums in a Grid](./leetcode/1878-GetBiggestThreeRhombusSumsInAGrid.go)   
[1879. Minimum XOR Sum of Two Arrays](./leetcode/1879-MinimumXORSumOfTwoArrays.go)   
[1882. Process Tasks Using Servers](./leetcode/1882-ProcessTasksUsingServers.go)   
[1883. Minimum Skips to Arrive at Meeting On Time](./leetcode/1883-MinimumSkipsToArriveAtMeetingOnTime.go)   
[1885. Count Pairs in Two Arrays](./leetcode/1885-CountPairsInTwoArrays.go)   
[1886. Determine Whether Matrix Can Be Obtained By Rotation](./leetcode/1886-DetermineWhetherMatrixCanBeObtainedByRotation.go)   
[1887. Reduction Operations to Make the Array Elements Equal](./leetcode/1887-ReductionOperationsToMakeTheArrayElementsEqual.go)   
[1889. Minimum Space Wasted From Packaging](./leetcode/1889-MinimumSpaceWastedFromPackaging.go)   
[1891. Cutting Ribbons](./leetcode/1891-CuttingRibbons.go)   
[1893. Check if All the Integers in a Range Are Covered](./leetcode/1893-CheckIfAllTheIntegersInARangeAreCovered.go)   
[1894. Find the Student that Will Replace the Chalk](./leetcode/1894-FindTheStudentThatWillReplaceTheChalk.go)   
[1895. Largest Magic Square](./leetcode/1895-LargestMagicSquare.go)   
[1897. Redistribute Characters to Make All Strings Equal](./leetcode/1897-RedistributeCharactersToMakeAllStringsEqual.go)   
[1899. Merge Triplets to Form Target Triplet](./leetcode/1899-MergeTripletsToFormTargetTriplet.go)   
[1901. Find a Peak Element II](./leetcode/1901-FindAPeakElementII.go)   
[1902. Depth of BST Given Insertion Order](./leetcode/1902-DepthOfBSTGivenInsertionOrder.go)   
[1905. Count Sub Islands](./leetcode/1905-CountSubIslands.go)   
[1906. Minimum Absolute Difference Queries](./leetcode/1906-MinimumAbsoluteDifferenceQueries.go)   
[1908. Game of Nim](./leetcode/1908-GameOfNim.go)   
[1909. Remove One Element to Make the Array Strictly Increasing](./leetcode/1909-RemoveOneElementToMakeTheArrayStrictlyIncreasing.go)   
[1911. Maximum Alternating Subsequence Sum](./leetcode/1911-MaximumAlternatingSubsequenceSum.go)   
[1913. Maximum Product Difference Between Two Pairs](./leetcode/1913-MaximumProductDifferenceBetweenTwoPairs.go)   
[1914. Cyclically Rotating a Grid](./leetcode/1914-CyclicallyRotatingAGrid.go)   
[1918. Kth Smallest Subarray Sum](./leetcode/1918-KthSmallestSubarraySum.go)   
[1920. Build Array from Permutation](./leetcode/1920-BuildArrayFromPermutation.go)   
[1921. Eliminate Maximum Number of Monsters](./leetcode/1921-EliminateMaximumNumberOfMonsters.go)   
[1923. Longest Common Subpath](./leetcode/1923-LongestCommonSubpath.go)   
[1924. Erect the Fence II](./leetcode/1924-ErectTheFenceII.go)   
[1926. Nearest Exit from Entrance in Maze](./leetcode/1926-NearestExitFromEntranceInMaze.go)   
[1929. Concatenation of Array](./leetcode/1929-ConcatenationOfArray.go)   
[1936. Add Minimum Number of Rungs](./leetcode/1936-AddMinimumNumberOfRungs.go)   
[1937. Maximum Number of Points with Cost](./leetcode/1937-MaximumNumberOfPointsWithCost.go)   
[1938. Maximum Genetic Difference Query](./leetcode/1938-MaximumGeneticDifferenceQuery.go)   
[1940. Longest Common Subsequence Between Sorted Arrays](./leetcode/1940-LongestCommonSubsequenceBetweenSortedArrays.go)   
[1942. The Number of the Smallest Unoccupied Chair](./leetcode/1942-TheNumberOfTheSmallestUnoccupiedChair.go)   
[1943. Describe the Painting](./leetcode/1943-DescribeThePainting.go)   
[1944. Number of Visible People in a Queue](./leetcode/1944-NumberOfVisiblePeopleInAQueue.go)   
[1947. Maximum Compatibility Score Sum](./leetcode/1947-MaximumCompatibilityScoreSum.go)   
[1950. Maximum of Minimum Values in All Subarrays](./leetcode/1950-MaximumOfMinimumValuesInAllSubarrays.go)   
[1953. Maximum Number of Weeks for Which You Can Work](./leetcode/1953-MaximumNumberOfWeeksForWhichYouCanWork.go)   
[1955. Count Number of Special Subsequences](./leetcode/1955-CountNumberOfSpecialSubsequences.go)   
[1956. Minimum Time For K Virus Variants to Spread](./leetcode/1956-MinimumTimeForKVirusVariantsToSpread.go)   
[1958. Check if Move is Legal](./leetcode/1958-CheckIfMoveIsLegal.go)   
[1959. Minimum Total Space Wasted With K Resizing Operations](./leetcode/1959-MinimumTotalSpaceWastedWithKResizingOperations.go)   
[1962. Remove Stones to Minimize the Total](./leetcode/1962-RemoveStonesToMinimizeTheTotal.go)   
[1964. Find the Longest Valid Obstacle Course at Each Position](./leetcode/1964-FindTheLongestValidObstacleCourseAtEachPosition.go)   
[1966. Binary Searchable Numbers in an Unsorted Array](./leetcode/1966-BinarySearchableNumbersInAnUnsortedArray.go)   
[1968. Array With Elements Not Equal to Average of Neighbors](./leetcode/1968-ArrayWithElementsNotEqualToAverageOfNeighbors.go)   
[1969. Minimum Non-Zero Product of the Array Elements](./leetcode/1969-MinimumNonZeroProductOfTheArrayElements.go)   
[1970. Last Day Where You Can Still Cross](./leetcode/1970-LastDayWhereYouCanStillCross.go)   
[1975. Maximum Matrix Sum](./leetcode/1975-MaximumMatrixSum.go)   
[1979. Find Greatest Common Divisor of Array](./leetcode/1979-FindGreatestCommonDivisorOfArray.go)   
[1980. Find Unique Binary String](./leetcode/1980-FindUniqueBinaryString.go)   
[1981. Minimize the Difference Between Target and Chosen Elements](./leetcode/1981-MinimizeTheDifferenceBetweenTargetAndChosenElements.go)   
[1982. Find Array Given Subset Sums](./leetcode/1982-FindArrayGivenSubsetSums.go)   
[1983. Widest Pair of Indices With Equal Range Sum](./leetcode/1983-WidestPairOfIndicesWithEqualRangeSum.go)   
[1984. Minimum Difference Between Highest and Lowest of K Scores](./leetcode/1984-MinimumDifferenceBetweenHighestAndLowestOfKScores.go)   
[1985. Find the Kth Largest Integer in the Array](./leetcode/1985-FindTheKthLargestIntegerInTheArray.go)   
[1986. Minimum Number of Work Sessions to Finish the Tasks](./leetcode/1986-MinimumNumberOfWorkSessionsToFinishTheTasks.go)   
[1989. Maximum Number of People That Can Be Caught in Tag](./leetcode/1989-MaximumNumberOfPeopleThatCanBeCaughtInTag.go)   
[1991. Find the Middle Index in Array](./leetcode/1991-FindTheMiddleIndexInArray.go)   
[1992. Find All Groups of Farmland](./leetcode/1992-FindAllGroupsOfFarmland.go)   
[1994. The Number of Good Subsets](./leetcode/1994-TheNumberOfGoodSubsets.go)   
[1995. Count Special Quadruplets](./leetcode/1995-CountSpecialQuadruplets.go)   
[1996. The Number of Weak Characters in the Game](./leetcode/1996-TheNumberOfWeakCharactersInTheGame.go)   
[1997. First Day Where You Have Been in All the Rooms](./leetcode/1997-FirstDayWhereYouHaveBeenInAllTheRooms.go)   
[1998. GCD Sort of an Array](./leetcode/1998-GCDSortOfAnArray.go)   
[2001. Number of Pairs of Interchangeable Rectangles](./leetcode/2001-NumberOfPairsOfInterchangeableRectangles.go)   
[2006. Count Number of Pairs With Absolute Difference K](./leetcode/2006-CountNumberOfPairsWithAbsoluteDifferenceK.go)   
[2007. Find Original Array From Doubled Array](./leetcode/2007-FindOriginalArrayFromDoubledArray.go)   
[2008. Maximum Earnings From Taxi](./leetcode/2008-MaximumEarningsFromTaxi.go)   
[2009. Minimum Number of Operations to Make Array Continuous](./leetcode/2009-MinimumNumberOfOperationsToMakeArrayContinuous.go)   
[2011. Final Value of Variable After Performing Operations](./leetcode/2011-FinalValueOfVariableAfterPerformingOperations.go)   
[2012. Sum of Beauty in the Array](./leetcode/2012-SumOfBeautyInTheArray.go)   
[2015. Average Height of Buildings in Each Segment](./leetcode/2015-AverageHeightOfBuildingsInEachSegment.go)   
[2016. Maximum Difference Between Increasing Elements](./leetcode/2016-MaximumDifferenceBetweenIncreasingElements.go)   
[2017. Grid Game](./leetcode/2017-GridGame.go)   
[2018. Check if Word Can Be Placed In Crossword](./leetcode/2018-CheckIfWordCanBePlacedInCrossword.go)   
[2021. Brightest Position on Street](./leetcode/2021-BrightestPositionOnStreet.go)   
[2022. Convert 1D Array Into 2D Array](./leetcode/2022-Convert1DArrayInto2DArray.go)   
[2023. Number of Pairs of Strings With Concatenation Equal to Target](./leetcode/2023-NumberOfPairsOfStringsWithConcatenationEqualToTarget.go)   
[2025. Maximum Number of Ways to Partition an Array](./leetcode/2025-MaximumNumberOfWaysToPartitionAnArray.go)   
[2028. Find Missing Observations](./leetcode/2028-FindMissingObservations.go)   
[2029. Stone Game IX](./leetcode/2029-StoneGameIX.go)   
[2031. Count Subarrays With More Ones Than Zeros](./leetcode/2031-CountSubarraysWithMoreOnesThanZeros.go)   
[2032. Two Out of Three](./leetcode/2032-TwoOutOfThree.go)   
[2033. Minimum Operations to Make a Uni-Value Grid](./leetcode/2033-MinimumOperationsToMakeAUniValueGrid.go)   
[2035. Partition Array Into Two Arrays to Minimize Sum Difference](./leetcode/2035-PartitionArrayIntoTwoArraysToMinimizeSumDifference.go)   
[2036. Maximum Alternating Subarray Sum](./leetcode/2036-MaximumAlternatingSubarraySum.go)   
[2037. Minimum Number of Moves to Seat Everyone](./leetcode/2037-MinimumNumberOfMovesToSeatEveryone.go)   
[2039. The Time When the Network Becomes Idle](./leetcode/2039-TheTimeWhenTheNetworkBecomesIdle.go)   
[2040. Kth Smallest Product of Two Sorted Arrays](./leetcode/2040-KthSmallestProductOfTwoSortedArrays.go)   
[2044. Count Number of Maximum Bitwise-OR Subsets](./leetcode/2044-CountNumberOfMaximumBitwiseORSubsets.go)   
[2049. Count Nodes With the Highest Score](./leetcode/2049-CountNodesWithTheHighestScore.go)   
[2053. Kth Distinct String in an Array](./leetcode/2053-KthDistinctStringInAnArray.go)   
[2054. Two Best Non-Overlapping Events](./leetcode/2054-TwoBestNonOverlappingEvents.go)   
[2056. Number of Valid Move Combinations On Chessboard](./leetcode/2056-NumberOfValidMoveCombinationsOnChessboard.go)   
[2057. Smallest Index With Equal Value](./leetcode/2057-SmallestIndexWithEqualValue.go)   
[2059. Minimum Operations to Convert Number](./leetcode/2059-MinimumOperationsToConvertNumber.go)   
[2061. Number of Spaces Cleaning Robot Cleaned](./leetcode/2061-NumberOfSpacesCleaningRobotCleaned.go)   
[2064. Minimized Maximum of Products Distributed to Any Store](./leetcode/2064-MinimizedMaximumOfProductsDistributedToAnyStore.go)   
[2070. Most Beautiful Item for Each Query](./leetcode/2070-MostBeautifulItemForEachQuery.go)   
[2071. Maximum Number of Tasks You Can Assign](./leetcode/2071-MaximumNumberOfTasksYouCanAssign.go)   
[2073. Time Needed to Buy Tickets](./leetcode/2073-TimeNeededToBuyTickets.go)   
[2078. Two Furthest Houses With Different Colors](./leetcode/2078-TwoFurthestHousesWithDifferentColors.go)   
[2079. Watering Plants](./leetcode/2079-WateringPlants.go)   
[2085. Count Common Words With One Occurrence](./leetcode/2085-CountCommonWordsWithOneOccurrence.go)   
[2087. Minimum Cost Homecoming of a Robot in a Grid](./leetcode/2087-MinimumCostHomecomingOfARobotInAGrid.go)   
[2088. Count Fertile Pyramids in a Land](./leetcode/2088-CountFertilePyramidsInALand.go)   
[2089. Find Target Indices After Sorting Array](./leetcode/2089-FindTargetIndicesAfterSortingArray.go)   
[2090. K Radius Subarray Averages](./leetcode/2090-KRadiusSubarrayAverages.go)   
[2091. Removing Minimum and Maximum From Array](./leetcode/2091-RemovingMinimumAndMaximumFromArray.go)   
[2093. Minimum Cost to Reach City With Discounts](./leetcode/2093-MinimumCostToReachCityWithDiscounts.go)   
[2094. Finding 3-Digit Even Numbers](./leetcode/2094-Finding3DigitEvenNumbers.go)   
[2098. Subsequence of Size K With the Largest Even Sum](./leetcode/2098-SubsequenceOfSizeKWithTheLargestEvenSum.go)   
[2099. Find Subsequence of Length K With the Largest Sum](./leetcode/2099-FindSubsequenceOfLengthKWithTheLargestSum.go)   
[2100. Find Good Days to Rob the Bank](./leetcode/2100-FindGoodDaysToRobTheBank.go)   
[2101. Detonate the Maximum Bombs](./leetcode/2101-DetonateTheMaximumBombs.go)   
[2104. Sum of Subarray Ranges](./leetcode/2104-SumOfSubarrayRanges.go)   
[2105. Watering Plants II](./leetcode/2105-WateringPlantsII.go)   
[2106. Maximum Fruits Harvested After at Most K Steps](./leetcode/2106-MaximumFruitsHarvestedAfterAtMostKSteps.go)   
[2107. Number of Unique Flavors After Sharing K Candies](./leetcode/2107-NumberOfUniqueFlavorsAfterSharingKCandies.go)   
[2108. Find First Palindromic String in the Array](./leetcode/2108-FindFirstPalindromicStringInTheArray.go)   
[2110. Number of Smooth Descent Periods of a Stock](./leetcode/2110-NumberOfSmoothDescentPeriodsOfAStock.go)   
[2111. Minimum Operations to Make the Array K-Increasing](./leetcode/2111-MinimumOperationsToMakeTheArrayKIncreasing.go)   
[2113. Elements in Array After Removing and Replacing Elements](./leetcode/2113-ElementsInArrayAfterRemovingAndReplacingElements.go)   
[2114. Maximum Number of Words Found in Sentences](./leetcode/2114-MaximumNumberOfWordsFoundInSentences.go)   
[2115. Find All Possible Recipes from Given Supplies](./leetcode/2115-FindAllPossibleRecipesFromGivenSupplies.go)   
[2120. Execution of All Suffix Instructions Staying in a Grid](./leetcode/2120-ExecutionOfAllSuffixInstructionsStayingInAGrid.go)   
[2121. Intervals Between Identical Elements](./leetcode/2121-IntervalsBetweenIdenticalElements.go)   
[2122. Recover the Original Array](./leetcode/2122-RecoverTheOriginalArray.go)   
[2123. Minimum Operations to Remove Adjacent Ones in Matrix](./leetcode/2123-MinimumOperationsToRemoveAdjacentOnesInMatrix.go)   
[2125. Number of Laser Beams in a Bank](./leetcode/2125-NumberOfLaserBeamsInABank.go)   
[2126. Destroying Asteroids](./leetcode/2126-DestroyingAsteroids.go)   
[2127. Maximum Employees to Be Invited to a Meeting](./leetcode/2127-MaximumEmployeesToBeInvitedToAMeeting.go)   
[2131. Longest Palindrome by Concatenating Two Letter Words](./leetcode/2131-LongestPalindromeByConcatenatingTwoLetterWords.go)   
[2132. Stamping the Grid](./leetcode/2132-StampingTheGrid.go)   
[2133. Check if Every Row and Column Contains All Numbers](./leetcode/2133-CheckIfEveryRowAndColumnContainsAllNumbers.go)   
[2134. Minimum Swaps to Group All 1's Together II](./leetcode/2134-MinimumSwapsToGroupAllOneTogetherII.go)   
[2135. Count Words Obtained After Adding a Letter](./leetcode/2135-CountWordsObtainedAfterAddingALetter.go)   
[2136. Earliest Possible Day of Full Bloom](./leetcode/2136-EarliestPossibleDayOfFullBloom.go)   
[2137. Pour Water Between Buckets to Make Water Levels Equal](./leetcode/2137-PourWaterBetweenBucketsToMakeWaterLevelsEqual.go)   
[2140. Solving Questions With Brainpower](./leetcode/2140-SolvingQuestionsWithBrainpower.go)   
[2141. Maximum Running Time of N Computers](./leetcode/2141-MaximumRunningTimeOfNComputers.go)   
[2143. Choose Numbers From Two Arrays in Range](./leetcode/2143-ChooseNumbersFromTwoArraysInRange.go)   
[2144. Minimum Cost of Buying Candies With Discount](./leetcode/2144-MinimumCostOfBuyingCandiesWithDiscount.go)   
[2145. Count the Hidden Sequences](./leetcode/2145-CountTheHiddenSequences.go)   
[2146. K Highest Ranked Items Within a Price Range](./leetcode/2146-KHighestRankedItemsWithinAPriceRange.go)   
[2148. Count Elements With Strictly Smaller and Greater Elements](./leetcode/2148-CountElementsWithStrictlySmallerAndGreaterElements.go)   
[2149. Rearrange Array Elements by Sign](./leetcode/2149-RearrangeArrayElementsBySign.go)   
[2150. Find All Lonely Numbers in the Array](./leetcode/2150-FindAllLonelyNumbersInTheArray.go)   
[2151. Maximum Good People Based on Statements](./leetcode/2151-MaximumGoodPeopleBasedOnStatements.go)   
[2152. Minimum Number of Lines to Cover Points](./leetcode/2152-MinimumNumberOfLinesToCoverPoints.go)   
[2154. Keep Multiplying Found Values by Two](./leetcode/2154-KeepMultiplyingFoundValuesByTwo.go)   
[2155. All Divisions With the Highest Score of a Binary Array](./leetcode/2155-AllDivisionsWithTheHighestScoreOfABinaryArray.go)   
[2157. Groups of Strings](./leetcode/2157-GroupsOfStrings.go)   
[2158. Amount of New Area Painted Each Day](./leetcode/2158-AmountOfNewAreaPaintedEachDay.go)   
[2161. Partition Array According to Given Pivot](./leetcode/2161-PartitionArrayAccordingToGivenPivot.go)   
[2163. Minimum Difference in Sums After Removal of Elements](./leetcode/2163-MinimumDifferenceInSumsAfterRemovalOfElements.go)   
[2164. Sort Even and Odd Indices Independently](./leetcode/2164-SortEvenAndOddIndicesIndependently.go)   
[2170. Minimum Operations to Make the Array Alternating](./leetcode/2170-MinimumOperationsToMakeTheArrayAlternating.go)   
[2171. Removing Minimum Number of Magic Beans](./leetcode/2171-RemovingMinimumNumberOfMagicBeans.go)   
[2172. Maximum AND Sum of Array](./leetcode/2172-MaximumANDSumOfArray.go)   
[2174. Remove All Ones With Row and Column Flips II](./leetcode/2174-RemoveAllOnesWithRowAndColumnFlipsII.go)   
[2176. Count Equal and Divisible Pairs in an Array](./leetcode/2176-CountEqualAndDivisiblePairsInAnArray.go)   
[2179. Count Good Triplets in an Array](./leetcode/2179-CountGoodTripletsInAnArray.go)   
[2183. Count Array Pairs Divisible by K](./leetcode/2183-CountArrayPairsDivisibleByK.go)   
[2184. Number of Ways to Build Sturdy Brick Wall](./leetcode/2184-NumberOfWaysToBuildSturdyBrickWall.go)   
[2187. Minimum Time to Complete Trips](./leetcode/2187-MinimumTimeToCompleteTrips.go)   
[2188. Minimum Time to Finish the Race](./leetcode/2188-MinimumTimeToFinishTheRace.go)   
[2190. Most Frequent Number Following Key In an Array](./leetcode/2190-MostFrequentNumberFollowingKeyInAnArray.go)   
[2191. Sort the Jumbled Numbers](./leetcode/2191-SortTheJumbledNumbers.go)   
[2195. Append K Integers With Minimal Sum](./leetcode/2195-AppendKIntegersWithMinimalSum.go)   
[2197. Replace Non-Coprime Numbers in Array](./leetcode/2197-ReplaceNonCoprimeNumbersInArray.go)   
[2198. Number of Single Divisor Triplets](./leetcode/2198-NumberOfSingleDivisorTriplets.go)   
[2200. Find All K-Distant Indices in an Array](./leetcode/2200-FindAllKDistantIndicesInAnArray.go)   
[2201. Count Artifacts That Can Be Extracted](./leetcode/2201-CountArtifactsThatCanBeExtracted.go)   
[2202. Maximize the Topmost Element After K Moves](./leetcode/2202-MaximizeTheTopmostElementAfterKMoves.go)   
[2206. Divide Array Into Equal Pairs](./leetcode/2206-DivideArrayIntoEqualPairs.go)   
[2208. Minimum Operations to Halve Array Sum](./leetcode/2208-MinimumOperationsToHalveArraySum.go)   
[2210. Count Hills and Valleys in an Array](./leetcode/2210-CountHillsAndValleysInAnArray.go)   
[2212. Maximum Points in an Archery Competition](./leetcode/2212-MaximumPointsInAnArcheryCompetition.go)   
[2214. Minimum Health to Beat Game](./leetcode/2214-MinimumHealthToBeatGame.go)   
[2215. Find the Difference of Two Arrays](./leetcode/2215-FindTheDifferenceOfTwoArrays.go)   
[2216. Minimum Deletions to Make Array Beautiful](./leetcode/2216-MinimumDeletionsToMakeArrayBeautiful.go)   
[2217. Find Palindrome With Fixed Length](./leetcode/2217-FindPalindromeWithFixedLength.go)   
[2218. Maximum Value of K Coins From Piles](./leetcode/2218-MaximumValueOfKCoinsFromPiles.go)    
[2219. Maximum Sum Score of Array](./leetcode/2219-MaximumSumScoreOfArray.go)   
[2221. Find Triangular Sum of an Array](./leetcode/2221-FindTriangularSumOfAnArray.go)   
[2225. Find Players With Zero or One Losses](./leetcode/2225-FindPlayersWithZeroOrOneLosses.go)   
[2226. Maximum Candies Allocated to K Children](./leetcode/2226-MaximumCandiesAllocatedToKChildren.go)   
[2229. Check if an Array Is Consecutive](./leetcode/2229-CheckIfAnArrayIsConsecutive.go)   
[2233. Maximum Product After K Increments](./leetcode/2233-MaximumProductAfterKIncrements.go)   
[2234. Maximum Total Beauty of the Gardens](./leetcode/2234-MaximumTotalBeautyOfTheGardens.go)   
[2237. Count Positions on Street With Required Brightness](./leetcode/2237-CountPositionsOnStreetWithRequiredBrightness.go)   
[2239. Find Closest Number to Zero](./leetcode/2239-FindClosestNumberToZero.go)   
[2244. Minimum Rounds to Complete All Tasks](./leetcode/2244-MinimumRoundsToCompleteAllTasks.go)   
[2245. Maximum Trailing Zeros in a Cornered Path](./leetcode/2245-MaximumTrailingZerosInACorneredPath.go)   
[2248. Intersection of Multiple Arrays](./leetcode/2248-IntersectionOfMultipleArrays.go)   
[2249. Count Lattice Points Inside a Circle](./leetcode/2249-CountLatticePointsInsideACircle.go)   
[2250. Count Number of Rectangles Containing Each Point](./leetcode/2250-CountNumberOfRectanglesContainingEachPoint.go)   
[2251. Number of Flowers in Full Bloom](./leetcode/2251-NumberOfFlowersInFullBloom.go)   
[2255. Count Prefixes of a Given String](./leetcode/2255-CountPrefixesOfAGivenString.go)   
[2256. Minimum Average Difference](./leetcode/2256-MinimumAverageDifference.go)   
[2257. Count Unguarded Cells in the Grid](./leetcode/2257-CountUnguardedCellsInTheGrid.go)   
[2258. Escape the Spreading Fire](./leetcode/2258-EscapeTheSpreadingFire.go)   
[2260. Minimum Consecutive Cards to Pick Up](./leetcode/2260-MinimumConsecutiveCardsToPickUp.go)   
[2261. K Divisible Elements Subarrays](./leetcode/2261-KDivisibleElementsSubarrays.go)   
[2263. Make Array Non-decreasing or Non-increasing](./leetcode/2263-MakeArrayNonDecreasingOrNonIncreasing.go)   
[2266. Count Number of Texts](./leetcode/2266-CountNumberOfTexts.go)   
[2267. Check if There Is a Valid Parentheses String Path](./leetcode/2267-CheckIfThereIsAValidParenthesesStringPath.go)   
[2270. Number of Ways to Split Array](./leetcode/2270-NumberOfWaysToSplitArray.go)   
[2271. Maximum White Tiles Covered by a Carpet](./leetcode/2271-MaximumWhiteTilesCoveredByACarpet.go)   
[2273. Find Resultant Array After Removing Anagrams](./leetcode/2273-FindResultantArrayAfterRemovingAnagrams.go)   
[2274. Maximum Consecutive Floors Without Special Floors](./leetcode/2274-MaximumConsecutiveFloorsWithoutSpecialFloors.go)   
[2275. Largest Combination With Bitwise AND Greater Than Zero](./leetcode/2275-LargestCombinationWithBitwiseANDGreaterThanZero.go)   
[2279. Maximum Bags With Full Capacity of Rocks](./leetcode/2279-MaximumBagsWithFullCapacityOfRocks.go)   
[2280. Minimum Lines to Represent a Line Chart](./leetcode/2280-MinimumLinesToRepresentALineChart.go)   
[2281. Sum of Total Strength of Wizards](./leetcode/2281-SumOfTotalStrengthOfWizards.go)   
[2282. Number of People That Can Be Seen in a Grid](./leetcode/2282-NumberOfPeopleThatCanBeSeenInAGrid.go)   
[2284. Sender With Largest Word Count](./leetcode/2284-SenderWithLargestWordCount.go)   
[2289. Steps to Make Array Non-decreasing](./leetcode/2289-StepsToMakeArrayNonDecreasing.go)   
[2290. Minimum Obstacle Removal to Reach Corner](./leetcode/2290-MinimumObstacleRemovalToReachCorner.go)   
[2291. Maximum Profit From Trading Stocks](./leetcode/2291-MaximumProfitFromTradingStocks.go)   
[2293. Min Max Game](./leetcode/2293-MinMaxGame.go)   
[2294. Partition Array Such That Maximum Difference Is K](./leetcode/2294-PartitionArraySuchThatMaximumDifferenceIsK.go)   
[2295. Replace Elements in an Array](./leetcode/2295-ReplaceElementsInAnArray.go)   
[2297. Jump Game VIII](./leetcode/2297-JumpGameVIII.go)   
[2300. Successful Pairs of Spells and Potions](./leetcode/2300-SuccessfulPairsOfSpellsAndPotions.go)   
[2302. Count Subarrays With Score Less Than K](./leetcode/2302-CountSubarraysWithScoreLessThanK.go)   
[2303. Calculate Amount Paid in Taxes](./leetcode/2303-CalculateAmountPaidInTaxes.go)   
[2304. Minimum Path Cost in a Grid](./leetcode/2304-MinimumPathCostInAGrid.go)   
[2305. Fair Distribution of Cookies](./leetcode/2305-FairDistributionOfCookies.go)   
[2306. Naming a Company](./leetcode/2306-NamingACompany.go)   
[2307. Check for Contradictions in Equations](./leetcode/2307-CheckForContradictionsInEquations.go)   
[2312. Selling Pieces of Wood](./leetcode/2312-SellingPiecesOfWood.go)   
[2317. Maximum XOR After Operations](./leetcode/2317-MaximumXORAfterOperations.go)   
[2319. Check if Matrix Is X-Matrix](./leetcode/2319-CheckIfMatrixIsXMatrix.go)   
[2321. Maximum Score Of Spliced Array](./leetcode/2321-MaximumScoreOfSplicedArray.go)   
[2323. Find Minimum Time to Finish All Jobs II](./leetcode/2323-FindMinimumTimeToFinishAllJobsII.go)   
[2332. The Latest Time to Catch a Bus](./leetcode/2332-TheLatestTimeToCatchABus.go)   
[2333. Minimum Sum of Squared Difference](./leetcode/2333-MinimumSumOfSquaredDifference.go)   
[2334. Subarray With Elements Greater Than Varying Threshold](./leetcode/2334-SubarrayWithElementsGreaterThanVaryingThreshold.go)   
[2335. Minimum Amount of Time to Fill Cups](./leetcode/2335-MinimumAmountOfTimeToFillCups.go)   
[2358. Maximum Number of Groups Entering a Competition](./leetcode/2358-MaximumNumberOfGroupsEnteringACompetition.go)   
[2340. Minimum Adjacent Swaps to Make a Valid Array](./leetcode/2340-MinimumAdjacentSwapsToMakeAValidArray.go)   
[2341. Maximum Number of Pairs in Array](./leetcode/2341-MaximumNumberOfPairsInArray.go)   
[2342. Max Sum of a Pair With Equal Sum of Digits](./leetcode/2342-MaxSumOfAPairWithEqualSumOfDigits.go)   
[2343. Query Kth Smallest Trimmed Number](./leetcode/2343-QueryKthSmallestTrimmedNumber.go)   
[2344. Minimum Deletions to Make Array Divisible](./leetcode/2344-MinimumDeletionsToMakeArrayDivisible.go)   
[2345. Finding the Number of Visible Mountains](./leetcode/2345-FindingTheNumberOfVisibleMountains.go)   
[2347. Best Poker Hand](./leetcode/2347-BestPokerHand.go)   
[2348. Number of Zero-Filled Subarrays](./leetcode/2348-NumberOfZeroFilledSubarrays.go)   
[2350. Shortest Impossible Sequence of Rolls](./leetcode/2350-ShortestImpossibleSequenceOfRolls.go)   
[2352. Equal Row and Column Pairs](./leetcode/2352-EqualRowAndColumnPairs.go)   
[2354. Number of Excellent Pairs](./leetcode/2354-NumberOfExcellentPairs.go)   
[2355. Maximum Number of Books You Can Take](./leetcode/2355-MaximumNumberOfBooksYouCanTake.go)   
[2357. Make Array Zero by Subtracting Equal Amounts](./leetcode/2357-MakeArrayZeroBySubtractingEqualAmounts.go)   
[2361. Minimum Costs Using the Train Line](./leetcode/2361-MinimumCostsUsingTheTrainLine.go)   
[2363. Merge Similar Items](./leetcode/2363-MergeSimilarItems.go)   
[2364. Count Number of Bad Pairs](./leetcode/2364-CountNumberOfBadPairs.go)   
[2365. Task Scheduler II](./leetcode/2365-TaskSchedulerII.go)   
[2366. Minimum Replacements to Sort the Array](./leetcode/2366-MinimumReplacementsToSortTheArray.go)   
[2367. Number of Arithmetic Triplets](./leetcode/2367-NumberOfArithmeticTriplets.go)   
[2368. Reachable Nodes With Restrictions](./leetcode/2368-ReachableNodesWithRestrictions.go)   
[2369. Check if There is a Valid Partition For The Array](./leetcode/2369-CheckIfThereIsAValidPartitionForTheArray.go)   
[2371. Minimize Maximum Value in a Grid](./leetcode/2371-MinimizeMaximumValueInAGrid.go)   
[2373. Largest Local Values in a Matrix](./leetcode/2373-LargestLocalValuesInAMatrix.go)   
[2382. Maximum Segment Sum After Removals](./leetcode/2382-MaximumSegmentSumAfterRemovals.go)   
[2383. Minimum Hours of Training to Win a Competition](./leetcode/2383-MinimumHoursOfTrainingToWinACompetition.go)   
[2386. Find the K-Sum of an Array](./leetcode/2386-FindTheK-SumOfAnArray.go)   
[2387. Median of a Row Wise Sorted Matrix](./leetcode/2387-MedianOfARowWiseSortedMatrix.go)   
[2389. Longest Subsequence With Limited Sum](./leetcode/2389-LongestSubsequenceWithLimitedSum.go)   
[2391. Minimum Amount of Time to Collect Garbage](./leetcode/2391-MinimumAmountOfTimeToCollectGarbage.go)   
[2392. Build a Matrix With Conditions](./leetcode/2392-BuildAMatrixWithConditions.go)   
[2393. Count Strictly Increasing Subarrays](./leetcode/2393-CountStrictlyIncreasingSubarrays.go)   
[2395. Find Subarrays With Equal Sum](./leetcode/2395-FindSubarraysWithEqualSum.go)   
[2397. Maximum Rows Covered by Columns](./leetcode/2397-MaximumRowsCoveredByColumns.go)   
[2398. Maximum Number of Robots Within Budget](./leetcode/2398-MaximumNumberOfRobotsWithinBudget.go)   
[2401. Longest Nice Subarray](./leetcode/2401-LongestNiceSubarray.go)   
[2402. Meeting Rooms III](./leetcode/2402-MeetingRoomsIII.go)   
[2403. Minimum Time to Kill All Monsters](./leetcode/2403-MinimumTimeToKillAllMonsters.go)   
[2404. Most Frequent Even Element](./leetcode/2404-MostFrequentEvenElement.go)   
[2406. Divide Intervals Into Minimum Number of Groups](./leetcode/2406-DivideIntervalsIntoMinimumNumberOfGroups.go)   
[2407. Longest Increasing Subsequence II](./leetcode/2407-LongestIncreasingSubsequenceII.go)   
[2410. Maximum Matching of Players With Trainers](./leetcode/2410-MaximumMatchingOfPlayersWithTrainers.go)   
[2411. Smallest Subarrays With Maximum Bitwise OR](./leetcode/2411-SmallestSubarraysWithMaximumBitwiseOR.go)   
[2412. Minimum Money Required Before Transactions](./leetcode/2412-MinimumMoneyRequiredBeforeTransactions.go)   
[2416. Sum of Prefix Scores of Strings](./leetcode/2416-SumOfPrefixScoresOfStrings.go)   
[2418. Sort the People](./leetcode/2418-SortThePeople.go)   
[2419. Longest Subarray With Maximum Bitwise AND](./leetcode/2419-LongestSubarrayWithMaximumBitwiseAND.go)   
[2420. Find All Good Indices](./leetcode/2420-FindAllGoodIndices.go)   
[2422. Merge Operations to Turn Array Into a Palindrome](./leetcode/2422-MergeOperationsToTurnArrayIntoAPalindrome.go)   
[2425. Bitwise XOR of All Pairings](./leetcode/2425-BitwiseXOROfAllPairings.go)   
[2426. Number of Pairs Satisfying Inequality](./leetcode/2426-NumberOfPairsSatisfyingInequality.go)   
[2428. Maximum Sum of an Hourglass](./leetcode/2428-MaximumSumOfAnHourglass.go)   
[2431. Maximize Total Tastiness of Purchased Fruits](./leetcode/2431-MaximizeTotalTastinessOfPurchasedFruits.go)   
[2432. The Employee That Worked on the Longest Task](./leetcode/2432-TheEmployeeThatWorkedOnTheLongestTask.go)   
[2433. Find The Original Array of Prefix Xor](./leetcode/2433-FindTheOriginalArrayOfPrefixXor.go)   
[2435. Paths in Matrix Whose Sum Is Divisible by K](./leetcode/2435-PathsInMatrixWhoseSumIsDivisibleByK.go)   
[2436. Minimum Split Into Subarrays With GCD Greater Than One](./leetcode/2436-MinimumSplitIntoSubarraysWithGCDGreaterThanOne.go)   
[2438. Range Product Queries of Powers](./leetcode/2438-RangeProductQueriesOfPowers.go)   
[2439. Minimize Maximum of Array](./leetcode/2439-MinimizeMaximumOfArray.go)   
[2440. Create Components With Same Value](./leetcode/2440-CreateComponentsWithSameValue.go)   
[2441. Largest Positive Integer That Exists With Its Negative](./leetcode/2441-LargestPositiveIntegerThatExistsWithItsNegative.go)   
[2442. Count Number of Distinct Integers After Reverse Operations](./leetcode/2442-CountNumberOfDistinctIntegersAfterReverseOperations.go)   
[2444. Count Subarrays With Fixed Bounds](./leetcode/2444-CountSubarraysWithFixedBounds.go)   
[2446. Determine if Two Events Have Conflict](./leetcode/2446-DetermineIfTwoEventsHaveConflict.go)   
[2447. Number of Subarrays With GCD Equal to K](./leetcode/2447-NumberOfSubarraysWithGCDEqualToK.go)   
[2448. Minimum Cost to Make Array Equal](./leetcode/2448-MinimumCostToMakeArrayEqual.go)   
[2449. Minimum Number of Operations to Make Arrays Similar](./leetcode/2449-MinimumNumberOfOperationsToMakeArraysSimilar.go)   
[2451. Odd String Difference](./leetcode/2451-OddStringDifference.go)   
[2452. Words Within Two Edits of Dictionary](./leetcode/2452-WordsWithinTwoEditsOfDictionary.go)   
[2453. Destroy Sequential Targets](./leetcode/2453-DestroySequentialTargets.go)   
[2454. Next Greater Element IV](./leetcode/2454-NextGreaterElementIV.go)   
[2455. Average Value of Even Numbers That Are Divisible by Three](./leetcode/2455-AverageValueOfEvenNumbersThatAreDivisibleByThree.go)   
[2456. Most Popular Video Creator](./leetcode/2456-MostPopularVideoCreator.go)   
[2459. Sort Array by Moving Items to Empty Space](./leetcode/2459-SortArrayByMovingItemsToEmptySpace.go)   
[2460. Apply Operations to an Array](./leetcode/2460-ApplyOperationsToAnArray.go)   
[2461. Maximum Sum of Distinct Subarrays With Length K](./leetcode/2461-MaximumSumOfDistinctSubarraysWithLengthK.go)   
[2462. Total Cost to Hire K Workers](./leetcode/2462-TotalCostToHireKWorkers.go)   
[2463. Minimum Total Distance Traveled](./leetcode/2463-MinimumTotalDistanceTraveled.go)   
[2464. Minimum Subarrays in a Valid Split](./leetcode/2464-MinimumSubarraysInAValidSplit.go)   
[2465. Number of Distinct Averages](./leetcode/2465-NumberOfDistinctAverages.go)   
[2470. Number of Subarrays With LCM Equal to K](./leetcode/2470-NumberOfSubarraysWithLCMEqualToK.go)   
[2475. Number of Unequal Triplets in Array](./leetcode/2475-NumberOfUnequalTripletsInArray.go)   
[2482. Difference Between Ones and Zeros in Row and Column](./leetcode/2482-DifferenceBetweenOnesAndZerosInRowAndColumn.go)   
[2488. Count Subarrays With Median K](./leetcode/2488-CountSubarraysWithMedianK.go)   
[2495. Number of Subarrays Having Even Product](./leetcode/2495-NumberOfSubarraysHavingEvenProduct.go)   
[2496. Maximum Value of a String in an Array](./leetcode/2496-MaximumValueOfAStringInAnArray.go)   
[2498. Frog Jump II](./leetcode/2498-FrogJumpII.go)   
[2499. Minimum Total Cost to Make Arrays Unequal](./leetcode/2499-MinimumTotalCostToMakeArraysUnequal.go)   
[2500. Delete Greatest Value in Each Row](./leetcode/2500-DeleteGreatestValueInEachRow.go)   
[2501. Longest Square Streak in an Array](./leetcode/2501-LongestSquareStreakInAnArray.go)   
[2503. Maximum Number of Points From Grid Queries](./leetcode/2503-MaximumNumberOfPointsFromGridQueries.go)   
[2505. Bitwise OR of All Subsequence Sums](./leetcode/2505-BitwiseOROfAllSubsequenceSums.go)   
[2506. Count Pairs Of Similar Strings](./leetcode/2506-CountPairsOfSimilarStrings.go)   
[2509. Cycle Length Queries in a Tree](./leetcode/2509-CycleLengthQueriesInATree.go)   
[2510. Check if There is a Path With Equal Number of 0's And 1's](./leetcode/2510-CheckIfThereIsAPathWithEqualNumberOfZerosAndOnes.go)   
[2511. Maximum Enemy Forts That Can Be Captured](./leetcode/2511-MaximumEnemyFortsThatCanBeCaptured.go)   
[2512. Reward Top K Students](./leetcode/2512-RewardTopKStudents.go)   
[2515. Shortest Distance to Target String in a Circular Array](./leetcode/2515-ShortestDistanceToTargetStringInACircularArray.go)   
[2517. Maximum Tastiness of Candy Basket](./leetcode/2517-MaximumTastinessOfCandyBasket.go)   
[2518. Number of Great Partitions](./leetcode/2518-NumberOfGreatPartitions.go)   
[2519. Count the Number of K-Big Indices](./leetcode/2519-CountTheNumberOfKBigIndices.go)   
[2521. Distinct Prime Factors of Product of Array](./leetcode/2521-DistinctPrimeFactorsOfProductOfArray.go)   
[2524. Maximum Frequency Score of a Subarray](./leetcode/2524-MaximumFrequencyScoreOfASubarray.go)   
[2527. Find Xor-Beauty of Array](./leetcode/2527-FindXorBeautyOfArray.go)   
[2528. Maximize the Minimum Powered City](./leetcode/2528-MaximizeTheMinimumPoweredCity.go)   
[2529. Maximum Count of Positive Integer and Negative Integer](./leetcode/2529-MaximumCountOfPositiveIntegerAndNegativeInteger.go)   
[2530. Maximal Score After Applying K Operations](./leetcode/2530-MaximalScoreAfterApplyingKOperations.go)   
[2532. Time to Cross a Bridge](./leetcode/2532-TimeToCrossABridge.go)   
[2534. Time Taken to Cross the Door](./leetcode/2534-TimeTakenToCrossTheDoor.go)   
[2535. Difference Between Element Sum and Digit Sum of an Array](./leetcode/2535-DifferenceBetweenElementSumAndDigitSumOfAnArray.go)   
[2536. Increment Submatrices by One](./leetcode/2536-IncrementSubmatricesByOne.go)   
[2537. Count the Number of Good Subarrays](./leetcode/2537-CountTheNumberOfGoodSubarrays.go)   
[2538. Difference Between Maximum and Minimum Price Sum](./leetcode/2538-DifferenceBetweenMaximumAndMinimumPriceSum.go)   
[2540. Minimum Common Value](./leetcode/2540-MinimumCommonValue.go)   
[2541. Minimum Operations to Make Array Equal II](./leetcode/2541-MinimumOperationsToMakeArrayEqualII.go)   
[2542. Maximum Subsequence Score](./leetcode/2542-MaximumSubsequenceScore.go)   
[2545. Sort the Students by Their Kth Score](./leetcode/2545-SortTheStudentsByTheirKthScore.go)   
[2547. Minimum Cost to Split an Array](./leetcode/2547-MinimumCostToSplitAnArray.go)   
[2548. Maximum Price to Fill a Bag](./leetcode/2548-MaximumPriceToFillABag.go)   
[2549. Count Distinct Numbers on Board](./leetcode/2549-CountDistinctNumbersOnBoard.go)   
[2551. Put Marbles in Bags](./leetcode/2551-PutMarblesInBags.go)   
[2552. Count Increasing Quadruplets](./leetcode/2552-CountIncreasingQuadruplets.go)   
[2553. Separate the Digits in an Array](./leetcode/2553-SeparateTheDigitsInAnArray.go)   
[2554. Maximum Number of Integers to Choose From a Range I](./leetcode/2554-MaximumNumberOfIntegersToChooseFromARangeI.go)   
[2555. Maximize Win From Two Segments](./leetcode/2555-MaximizeWinFromTwoSegments.go)   
[2556. Disconnect Path in a Binary Matrix by at Most One Flip](./leetcode/2556-DisconnectPathInABinaryMatrixByAtMostOneFlip.go)   
[2557. Maximum Number of Integers to Choose From a Range II](./leetcode/2557-MaximumNumberOfIntegersToChooseFromARangeII.go)   
[2558. Take Gifts From the Richest Pile](./leetcode/2558-TakeGiftsFromTheRichestPile.go)   
[2559. Count Vowel Strings in Ranges](./leetcode/2559-CountVowelStringsInRanges.go)   
[2560. House Robber IV](./leetcode/2560-HouseRobberIV.go)   
[2561. Rearranging Fruits](./leetcode/2561-RearrangingFruits.go)   
[2562. Find the Array Concatenation Value](./leetcode/2562-FindTheArrayConcatenationValue.go)   
[2563. Count the Number of Fair Pairs](./leetcode/2563-CountTheNumberOfFairPairs.go)   
[2567. Minimum Score by Changing Two Elements](./leetcode/2567-MinimumScoreByChangingTwoElements.go)   
[2568. Minimum Impossible OR](./leetcode/2568-MinimumImpossibleOR.go)   
[2569. Handling Sum Queries After Update](./leetcode/2569-HandlingSumQueriesAfterUpdate.go)   
[2570. Merge Two 2D Arrays by Summing Values](./leetcode/2570-MergeTwo2DArraysBySummingValues.go)   
[2572. Count the Number of Square-Free Subsets](./leetcode/2572-CountTheNumberOfSquareFreeSubsets.go)   
[2573. Find the String with LCP](./leetcode/2573-FindTheStringWithLCP.go)   
[2574. Left and Right Sum Differences](./leetcode/2574-LeftAndRightSumDifferences.go)   
[2575. Find the Divisibility Array of a String](./leetcode/2575-FindTheDivisibilityArrayOfAString.go)   
[2576. Find the Maximum Number of Marked Indices](./leetcode/2576-FindTheMaximumNumberOfMarkedIndices.go)   
[2577. Minimum Time to Visit a Cell In a Grid](./leetcode/2577-MinimumTimeToVisitACellInAGrid.go)   
[2580. Count Ways to Group Overlapping Ranges](./leetcode/2580-CountWaysToGroupOverlappingRanges.go)   
[2584. Split the Array to Make Coprime Products](./leetcode/2584-SplitTheArrayToMakeCoprimeProducts.go)   
[2585. Number of Ways to Earn Points](./leetcode/2585-NumberOfWaysToEarnPoints.go)   
[2587. Rearrange Array to Maximize Prefix Score](./leetcode/2587-RearrangeArrayToMaximizePrefixScore.go)   
[2588. Count the Number of Beautiful Subarrays](./leetcode/2588-CountTheNumberOfBeautifulSubarrays.go)   
[2589. Minimum Time to Complete All Tasks](./leetcode/2589-MinimumTimeToCompleteAllTasks.go)   
[2592. Maximize Greatness of an Array](./leetcode/2592-MaximizeGreatnessOfAnArray.go)   
[2593. Find Score of an Array After Marking All Elements](./leetcode/2593-FindScoreOfAnArrayAfterMarkingAllElements.go)   
[2594. Minimum Time to Repair Cars](./leetcode/2594-MinimumTimeToRepairCars.go)   
[2596. Check Knight Tour Configuration](./leetcode/2596-CheckKnightTourConfiguration.go)   
[2597. The Number of Beautiful Subsets](./leetcode/2597-TheNumberOfBeautifulSubsets.go)   
[2598. Smallest Missing Non-negative Integer After Operations](./leetcode/2598-SmallestMissingNonNegativeIntegerAfterOperations.go)   
[2599. Make the Prefix Sum Non-negative](./leetcode/2599-MakeThePrefixSumNonNegative.go)   
[2601. Prime Subtraction Operation](./leetcode/2601-PrimeSubtractionOperation.go)   
[2602. Minimum Operations to Make All Array Elements Equal](./leetcode/2602-MinimumOperationsToMakeAllArrayElementsEqual.go)   
[2604. Minimum Time to Eat All Grains](./leetcode/2604-MinimumTimeToEatAllGrains.go)   
[2605. Form Smallest Number From Two Digit Arrays](./leetcode/2605-FormSmallestNumberFromTwoDigitArrays.go)   
[2607. Make K-Subarray Sums Equal](./leetcode/2607-MakeKSubarraySumsEqual.go)   
[2610. Convert an Array Into a 2D Array With Conditions](./leetcode/2610-ConvertAnArrayIntoA2DArrayWithConditions.go)   
[2611. Mice and Cheese](./leetcode/2611-MiceAndCheese.go)   
[2612. Minimum Reverse Operations](./leetcode/2612-MinimumReverseOperations.go)   
[2613. Beautiful Pairs](./leetcode/2613-BeautifulPairs.go)   
[2614. Prime In Diagonal](./leetcode/2614-PrimeInDiagonal.go)   
[2615. Sum of Distances](./leetcode/2615-SumOfDistances.go)   
[2616. Minimize the Maximum Difference of Pairs](./leetcode/2616-MinimizeTheMaximumDifferenceOfPairs.go)   
[2617. Minimum Number of Visited Cells in a Grid](./leetcode/2617-MinimumNumberOfVisitedCellsInAGrid.go)   
[2638. Count the Number of K-Free Subsets](./leetcode/2638-CountTheNumberOfKFreeSubsets.go)   
[2640. Find the Score of All Prefixes of an Array](./leetcode/2640-FindTheScoreOfAllPrefixesOfAnArray.go)   
[2643. Row With Maximum Ones](./leetcode/2643-RowWithMaximumOnes.go)   
[2653. Sliding Subarray Beauty](./leetcode/2653-SlidingSubarrayBeauty.go)   
[2654. Minimum Number of Operations to Make All Array Elements Equal to 1](./leetcode/2654-MinimumNumberOfOperationsToMakeAllArrayElementsEqualToOne.go)   
[2655. Find Maximal Uncovered Ranges](./leetcode/2655-FindMaximalUncoveredRanges.go)   
[2656. Maximum Sum With Exactly K Elements](./leetcode/2656-MaximumSumWithExactlyKElements.go)   
[2657. Find the Prefix Common Array of Two Arrays](./leetcode/2657-FindThePrefixCommonArrayOfTwoArrays.go)   
[2658. Maximum Number of Fish in a Grid](./leetcode/2658-MaximumNumberOfFishInAGrid.go)   
[2659. Make Array Empty](./leetcode/2659-MakeArrayEmpty.go)   
[2660. Determine the Winner of a Bowling Game](./leetcode/2660-DetermineTheWinnerOfABowlingGame.go)   
[2661. First Completely Painted Row or Column](./leetcode/2661-FirstCompletelyPaintedRowOrColumn.go)   
[2662. Minimum Cost of a Path With Special Roads](./leetcode/2662-MinimumCostOfAPathWithSpecialRoads.go)   
[2664. The Knight’s Tour](./leetcode/2664-TheKnightsTour.go)   
[2670. Find the Distinct Difference Array](./leetcode/2670-FindTheDistinctDifferenceArray.go)   
[2672. Number of Adjacent Elements With the Same Color](./leetcode/2672-NumberOfAdjacentElementsWithTheSameColor.go)   
[2678. Number of Senior Citizens](./leetcode/2678-NumberOfSeniorCitizens.go)   
[2679. Sum in a Matrix](./leetcode/2679-SumInAMatrix.go)   
[2680. Maximum OR](./leetcode/2680-MaximumOR.go)   
[2681. Power of Heroes](./leetcode/2681-PowerOfHeroes.go)   
[2683. Neighboring Bitwise XOR](./leetcode/2683-NeighboringBitwiseXOR.go)   
[2684. Maximum Number of Moves in a Grid](./leetcode/2684-MaximumNumberOfMovesInAGrid.go)   
[2702. Minimum Operations to Make Numbers Non-positive](./leetcode/2702-MinimumOperationsToMakeNumbersNonPositive.go)   
[2706. Buy Two Chocolates](./leetcode/2706-BuyTwoChocolates.go)   
[2708. Maximum Strength of a Group](./leetcode/2708-MaximumStrengthOfAGroup.go)   
[2711. Difference of Number of Distinct Values on Diagonals](./leetcode/2711-DifferenceOfNumberOfDistinctValuesOnDiagonals.go)   
[2713. Maximum Strictly Increasing Cells in a Matrix](./leetcode/2713-MaximumStrictlyIncreasingCellsInAMatrix.go)   
[2717. Semi-Ordered Permutation](./leetcode/2717-SemiOrderedPermutation.go)   
[2718. Sum of Matrix After Queries](./leetcode/2718-SumOfMatrixAfterQueries.go)   
[2728. Count Houses in a Circular Street](./leetcode/2728-CountHousesInACircularStreet.go)   
[2731. Movement of Robots](./leetcode/2731-MovementOfRobots.go)   
[2732. Find a Good Subset of the Matrix](./leetcode/2732-FindAGoodSubsetOfTheMatrix.go)   
[2733. Neither Minimum nor Maximum](./leetcode/2733-NeitherMinimumNorMaximum.go)   
[2735. Collecting Chocolates](./leetcode/2735-CollectingChocolates.go)   
[2736. Maximum Sum Queries](./leetcode/2736-MaximumSumQueries.go)   
[2740. Find the Value of the Partition](./leetcode/2740-FindTheValueOfThePartition.go)   
[2741. Special Permutations](./leetcode/2741-SpecialPermutations.go)   
[2742. Painting the Walls](./leetcode/2742-PaintingTheWalls.go)   
[2744. Find Maximum Number of String Pairs](./leetcode/2744-FindMaximumNumberOfStringPairs.go)   
[2746. Decremental String Concatenation](./leetcode/2746-DecrementalStringConcatenation.go)   
[2747. Count Zero Request Servers](./leetcode/2747-CountZeroRequestServers.go)   
[2748. Number of Beautiful Pairs](./leetcode/2748-NumberOfBeautifulPairs.go)   
[2750. Ways to Split Array Into Good Subarrays](./leetcode/2750-WaysToSplitArrayIntoGoodSubarrays.go)   
[2751. Robot Collisions](./leetcode/2751-RobotCollisions.go)   
[2753. Count Houses in a Circular Street II](./leetcode/2753-CountHousesInACircularStreetII.go)   
[2760. Longest Even Odd Subarray With Threshold](./leetcode/2760-LongestEvenOddSubarrayWithThreshold.go)   
[2762. Continuous Subarrays](./leetcode/2762-ContinuousSubarrays.go)   
[2763. Sum of Imbalance Numbers of All Subarrays](./leetcode/2763-SumOfImbalanceNumbersOfAllSubarrays.go)   
[2765. Longest Alternating Subarray](./leetcode/2765-LongestAlternatingSubarray.go)   
[2766. Relocate Marbles](./leetcode/2766-RelocateMarbles.go)   
[2768. Number of Black Blocks](./leetcode/2768-NumberOfBlackBlocks.go)   
[2770. Maximum Number of Jumps to Reach the Last Index](./leetcode/2770-MaximumNumberOfJumpsToReachTheLastIndex.go)   
[2771. Longest Non-decreasing Subarray From Two Arrays](./leetcode/2771-LongestNon-DecreasingSubarrayFromTwoArrays.go)   
[2772. Apply Operations to Make All Array Elements Equal to Zero](./leetcode/2772-ApplyOperationsToMakeAllArrayElementsEqualToZero.go)   
[2778. Sum of Squares of Special Elements](./leetcode/2778-SumOfSquaresOfSpecialElements.go)   
[2779. Maximum Beauty of an Array After Applying Operation](./leetcode/2779-MaximumBeautyOfAnArrayAfterApplyingOperation.go)   
[2780. Minimum Index of a Valid Split](./leetcode/2780-MinimumIndexOfAValidSplit.go)   
[2784. Check if Array is Good](./leetcode/2784-CheckIfArrayIsGood.go)   
[2786. Visit Array Positions to Maximize Score](./leetcode/2786-VisitArrayPositionsToMaximizeScore.go)   
[2788. Split Strings by Separator](./leetcode/2788-SplitStringsBySeparator.go)   
[2789. Largest Element in an Array after Merge Operations](./leetcode/2789-LargestElementInAnArrayAfterMergeOperations.go)    
[2790. Maximum Number of Groups With Increasing Length](./leetcode/2790-MaximumNumberOfGroupsWithIncreasingLength.go)   
[2798. Number of Employees Who Met the Target](./leetcode/2798-NumberOfEmployeesWhoMetTheTarget.go)   
[2799. Count Complete Subarrays in an Array](./leetcode/2799-CountCompleteSubarraysInAnArray.go)   
[2808. Minimum Seconds to Equalize a Circular Array](./leetcode/2808-MinimumSecondsToEqualizeACircularArray.go)   
[2809. Minimum Time to Make Array Sum At Most x](./leetcode/2809-MinimumTimeToMakeArraySumAtMostX.go)   
[2811. Check if it is Possible to Split Array](./leetcode/2811-CheckIfItIsPossibleToSplitArray.go)   
[2812. Find the Safest Path in a Grid](./leetcode/2812-FindTheSafestPathInAGrid.go)   
[2813. Maximum Elegance of a K-Length Subsequence](./leetcode/2813-MaximumEleganceOfAK-LengthSubsequence.go)   
[2814. Minimum Time Takes to Reach Destination Without Drowning](./leetcode/2814-MinimumTimeTakesToReachDestinationWithoutDrowning.go)   
[2815. Max Pair Sum in an Array](./leetcode/2815-MaxPairSumInAnArray.go)   
[2817. Minimum Absolute Difference Between Elements With Constraint](./leetcode/2817-MinimumAbsoluteDifferenceBetweenElementsWithConstraint.go)   
[2818. Apply Operations to Maximize Score](./leetcode/2818-ApplyOperationsToMaximizeScore.go)   
[2819. Minimum Relative Loss After Buying Chocolates](./leetcode/2819-MinimumRelativeLossAfterBuyingChocolates.go)   
[2824. Count Pairs Whose Sum is Less than Target](./leetcode/2824-CountPairsWhoseSumIsLessThanTarget.go)   
[2826. Sorting Three Groups](./leetcode/2826-SortingThreeGroups.go)   
[2830. Maximize the Profit as the Salesman](./leetcode/2830-MaximizeTheProfitAsTheSalesman.go)   
[2831. Find the Longest Equal Subarray](./leetcode/2831-FindTheLongestEqualSubarray.go)   
[2832. Maximal Range That Each Element Is Maximum in It](./leetcode/2832-MaximalRangeThatEachElementIsMaximumInIt.go)   
[2835. Minimum Operations to Form Subsequence With Target Sum](./leetcode/2835-MinimumOperationsToFormSubsequenceWithTargetSum.go)   
[2836. Maximize Value of Function in a Ball Passing Game](./leetcode/2836-MaximizeValueOfFunctionInABallPassingGame.go)   
[2838. Maximum Coins Heroes Can Collect](./leetcode/2838-MaximumCoinsHeroesCanCollect.go)   
[2841. Maximum Sum of Almost Unique Subarray](./leetcode/2841-MaximumSumOfAlmostUniqueSubarray.go)   
[2845. Count of Interesting Subarrays](./leetcode/2845-CountOfInterestingSubarrays.go)   
[2848. Points That Intersect With Cars](./leetcode/2848-PointsThatIntersectWithCars.go)   
[2850. Minimum Moves to Spread Stones Over Grid](./leetcode/2850-MinimumMovesToSpreadStonesOverGrid.go)   
[2852. Sum of Remoteness of All Cells](./leetcode/2852-SumOfRemotenessOfAllCells.go)   
[2855. Minimum Right Shifts to Sort the Array](./leetcode/2855-MinimumRightShiftsToSortTheArray.go)   
[2856. Minimum Array Length After Pair Removals](./leetcode/2856-MinimumArrayLengthAfterPairRemovals.go)   
[2857. Count Pairs of Points With Distance k](./leetcode/2857-CountPairsOfPointsWithDistanceK.go)   
[2859. Sum of Values at Indices With K Set Bits](./leetcode/2859-SumOfValuesAtIndicesWithKSetBits.go)   
[2860. Happy Students](./leetcode/2860-HappyStudents.go)   
[2861. Maximum Number of Alloys](./leetcode/2861-MaximumNumberOfAlloys.go)   
[2862. Maximum Element-Sum of a Complete Subset of Indices](./leetcode/2862-MaximumElementSumOfACompleteSubsetOfIndices.go)   
[2863. Maximum Length of Semi-Decreasing Subarrays](./leetcode/2863-MaximumLengthOfSemiDecreasingSubarrays.go)   
[2865. Beautiful Towers I](./leetcode/2865-BeautifulTowersI.go)   
[2866. Beautiful Towers II](./leetcode/2866-BeautifulTowersII.go)   
[2868. The Wording Game](./leetcode/2868-TheWordingGame.go)   
[2869. Minimum Operations to Collect Elements](./leetcode/2869-MinimumOperationsToCollectElements.go)   
[2870. Minimum Number of Operations to Make Array Empty](./leetcode/2870-MinimumNumberOfOperationsToMakeArrayEmpty.go)   
[2871. Split Array Into Maximum Number of Subarrays](./leetcode/2871-SplitArrayIntoMaximumNumberOfSubarrays.go)   
[2873. Maximum Value of an Ordered Triplet I](./leetcode/2873-MaximumValueOfAnOrderedTripletI.go)   
[2874. Maximum Value of an Ordered Triplet II](./leetcode/2874-MaximumValueOfAnOrderedTripletII.go)   
[2875. Minimum Size Subarray in Infinite Array](./leetcode/2875-MinimumSizeSubarrayInInfiniteArray.go)   
[2892. Minimizing Array After Replacing Pairs With Their Product](./leetcode/2892-MinimizingArrayAfterReplacingPairsWithTheirProduct.go)   
[2895. Minimum Processing Time](./leetcode/2895-MinimumProcessingTime.go)   
[2897. Apply Operations on Array to Maximize Sum of Squares](./leetcode/2897-ApplyOperationsOnArrayToMaximizeSumOfSquares.go)   
[2898. Maximum Linear Stock Score](./leetcode/2898-MaximumLinearStockScore.go)   
[2899. Last Visited Integers](./leetcode/2899-LastVisitedIntegers.go)   
[2900. Longest Unequal Adjacent Groups Subsequence I](./leetcode/2900-LongestUnequalAdjacentGroupsSubsequenceI.go)   
[2901. Longest Unequal Adjacent Groups Subsequence II](./leetcode/2901-LongestUnequalAdjacentGroupsSubsequenceII.go)   
[2902. Count of Sub-Multisets With Bounded Sum](./leetcode/2902-CountOfSubMultisetsWithBoundedSum.go)   
[2903. Find Indices With Index and Value Difference I](./leetcode/2903-FindIndicesWithIndexAndValueDifferenceI.go)   
[2905. Find Indices With Index and Value Difference II](./leetcode/2905-FindIndicesWithIndexAndValueDifferenceII.go)   
[2906. Construct Product Matrix](./leetcode/2906-ConstructProductMatrix.go)   
[2907. Maximum Profitable Triplets With Increasing Prices I](./leetcode/2907-MaximumProfitableTripletsWithIncreasingPricesI.go)   
[2908. Minimum Sum of Mountain Triplets I](./leetcode/2908-MinimumSumOfMountainTripletsI.go)   
[2909. Minimum Sum of Mountain Triplets II](./leetcode/2909-MinimumSumOfMountainTripletsII.go)   
[2910. Minimum Number of Groups to Create a Valid Assignment](./leetcode/2910-MinimumNumberOfGroupsToCreateAValidAssignment.go)   
[2912. Number of Ways to Reach Destination in the Grid](./leetcode/2912-NumberOfWaysToReachDestinationInTheGrid.go)   
[2913. Subarrays Distinct Element Sum of Squares I](./leetcode/2913-SubarraysDistinctElementSumOfSquaresI.go)   
[2915. Length of the Longest Subsequence That Sums to Target](./leetcode/2915-LengthOfTheLongestSubsequenceThatSumsToTarget.go)   
[2916. Subarrays Distinct Element Sum of Squares II](./leetcode/2916-SubarraysDistinctElementSumOfSquaresII.go)   
[2917. Find the K-or of an Array](./leetcode/2917-FindTheKOrOfAnArray.go)   
[2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](./leetcode/2918-MinimumEqualSumOfTwoArraysAfterReplacingZeros.go)   
[2919. Minimum Increment Operations to Make Array Beautiful](./leetcode/2919-MinimumIncrementOperationsToMakeArrayBeautiful.go)   
[2920. Maximum Points After Collecting Coins From All Nodes](./leetcode/2920-MaximumPointsAfterCollectingCoinsFromAllNodes.go)   
[2921. Maximum Profitable Triplets With Increasing Prices II](./leetcode/2921-MaximumProfitableTripletsWithIncreasingPricesII.go)   
[2923. Find Champion I](./leetcode/2923-FindChampionI.go)   
[2924. Find Champion II](./leetcode/2924-FindChampionII.go)   
[2926. Maximum Balanced Subsequence Sum](./leetcode/2926-MaximumBalancedSubsequenceSum.go)   
[2931. Maximum Spending After Buying Items](./leetcode/2931-MaximumSpendingAfterBuyingItems.go)   
[2932. Maximum Strong Pair XOR I](./leetcode/2932-MaximumStrongPairXORI.go)   
[2933. High-Access Employees](./leetcode/2933-HighAccessEmployees.go)   
[2934. Minimum Operations to Maximize Last Elements in Arrays](./leetcode/2934-MinimumOperationsToMaximizeLastElementsInArrays.go)   
[2935. Maximum Strong Pair XOR II](./leetcode/2935-MaximumStrongPairXORII.go)   
[2936. Number of Equal Numbers Blocks](./leetcode/2936-NumberOfEqualNumbersBlocks.go)   
[2940. Find Building Where Alice and Bob Can Meet](./leetcode/2940-FindBuildingWhereAliceAndBobCanMeet.go)   
[2941. Maximum GCD-Sum of a Subarray](./leetcode/2941-MaximumGCDSumOfASubarray.go)   
[2943. Maximize Area of Square Hole in Grid](./leetcode/2943-MaximizeAreaOfSquareHoleInGrid.go)   
[2944. Minimum Number of Coins for Fruits](./leetcode/2944-MinimumNumberOfCoinsForFruits.go)   
[2945. Find Maximum Non-decreasing Array Length](./leetcode/2945-FindMaximumNonDecreasingArrayLength.go)   
[2946. Matrix Similarity After Cyclic Shifts](./leetcode/2946-MatrixSimilarityAfterCyclicShifts.go)   
[2948. Make Lexicographically Smallest Array by Swapping Elements](./leetcode/2948-MakeLexicographicallySmallestArrayBySwappingElements.go)   
[2951. Find the Peaks](./leetcode/2951-FindThePeaks.go)   
[2952. Minimum Number of Coins to be Added](./leetcode/2952-MinimumNumberOfCoinsToBeAdded.go)   
[2954. Count the Number of Infection Sequences](./leetcode/2954-CountTheNumberOfInfectionSequences.go)   
[2956. Find Common Elements Between Two Arrays](./leetcode/2956-FindCommonElementsBetweenTwoArrays.go)   
[2958. Length of Longest Subarray With at Most K Frequency](./leetcode/2958-LengthOfLongestSubarrayWithAtMostKFrequency.go)   
[2960. Count Tested Devices After Test Operations](./leetcode/2960-CountTestedDevicesAfterTestOperations.go)   
[2961. Double Modular Exponentiation](./leetcode/2961-DoubleModularExponentiation.go)   
[2962. Count Subarrays Where Max Element Appears at Least K Times](./leetcode/2962-CountSubarraysWhereMaxElementAppearsAtLeastKTimes.go)   
[2963. Count the Number of Good Partitions](./leetcode/2963-CountTheNumberOfGoodPartitions.go)   
[2964. Number of Divisible Triplet Sums](./leetcode/2964-NumberOfDivisibleTripletSums.go)   
[2965. Find Missing and Repeated Values](./leetcode/2965-FindMissingAndRepeatedValues.go)   
[2966. Divide Array Into Arrays With Max Difference](./leetcode/2966-DivideArrayIntoArraysWithMaxDifference.go)   
[2967. Minimum Cost to Make Array Equalindromic](./leetcode/2967-MinimumCostToMakeArrayEqualindromic.go)   
[2968. Apply Operations to Maximize Frequency Score](./leetcode/2968-ApplyOperationsToMaximizeFrequencyScore.go)   
[2969. Minimum Number of Coins for Fruits II](./leetcode/2969-MinimumNumberOfCoinsForFruitsII.go)   
[2970. Count the Number of Incremovable Subarrays I](./leetcode/2970-CountTheNumberOfIncremovableSubarraysI.go)   
[2971. Find Polygon With the Largest Perimeter](./leetcode/2971-FindPolygonWithTheLargestPerimeter.go)   
[2972. Count the Number of Incremovable Subarrays II](./leetcode/2972-CountTheNumberOfIncremovableSubarraysII.go)   
[2974. Minimum Number Game](./leetcode/2974-MinimumNumberGame.go)   
[2975. Maximum Square Area by Removing Fences From a Field](./leetcode/2975-MaximumSquareAreaByRemovingFencesFromAField.go)   
[2980. Check if Bitwise OR Has Trailing Zeros](./leetcode/2980-CheckIfBitwiseORHasTrailingZeros.go)   
[2996. Smallest Missing Integer Greater Than Sequential Prefix Sum](./leetcode/2996-SmallestMissingIntegerGreaterThanSequentialPrefixSum.go)   
[2997. Minimum Number of Operations to Make Array XOR Equal to K](./leetcode/2997-MinimumNumberOfOperationsToMakeArrayXOREqualToK.go)   
[3000. Maximum Area of Longest Diagonal Rectangle](./leetcode/3000-MaximumAreaOfLongestDiagonalRectangle.go)   
[3002. Maximum Size of a Set After Removals](./leetcode/3002-MaximumSizeOfASetAfterRemovals.go)   
[3004. Maximum Subtree of the Same Color](./leetcode/3004-MaximumSubtreeOfTheSameColor.go)   
[3005. Count Elements With Maximum Frequency](./leetcode/3005-CountElementsWithMaximumFrequency.go)   
[3009. Maximum Number of Intersections on the Chart](./leetcode/3009-MaximumNumberOfIntersectionsOnTheChart.go)   
[3011. Find if Array Can Be Sorted](./leetcode/3011-FindIfArrayCanBeSorted.go)   
[3018. Maximum Number of Removal Queries That Can Be Processed I](./leetcode/3018-MaximumNumberOfRemovalQueriesThatCanBeProcessedI.go)   
[3109. Find the Index of Permutation](./leetcode/3109-FindTheIndexOfPermutation.go)   
[3010. Divide an Array Into Subarrays With Minimum Cost I](./leetcode/3010-DivideAnArrayIntoSubarraysWithMinimumCostI.go)   
[3012. Minimize Length of Array Using Operations](./leetcode/3012-MinimizeLengthOfArrayUsingOperations.go)   
[3013. Divide an Array Into Subarrays With Minimum Cost II](./leetcode/3013-DivideAnArrayIntoSubarraysWithMinimumCostII.go)   
[3020. Find the Maximum Number of Elements in Subset](./leetcode/3020-FindTheMaximumNumberOfElementsInSubset.go)   
[3022. Minimize OR of Remaining Elements Using Operations](./leetcode/3022-MinimizeOROfRemainingElementsUsingOperations.go)   
[3023. Find Pattern in Infinite Stream I](./leetcode/3023-FindPatternInInfiniteStreamI.go)   
[3024. Type of Triangle](./leetcode/3024-TypeOfTriangle.go)   
[3025. Find the Number of Ways to Place People I](./leetcode/3025-FindTheNumberOfWaysToPlacePeopleI.go)   
[3026. Maximum Good Subarray Sum](./leetcode/3026-MaximumGoodSubarraySum.go)   
[3027. Find the Number of Ways to Place People II](./leetcode/3027-FindTheNumberOfWaysToPlacePeopleII.go)   
[3028. Ant on the Boundary](./leetcode/3028-AntOnTheBoundary.go)   
[3030. Find the Grid of Region Average](./leetcode/3030-FindTheGridOfRegionAverage.go)   
[3033. Modify the Matrix](./leetcode/3033-ModifyTheMatrix.go)   
[3034. Number of Subarrays That Match a Pattern I](./leetcode/3034-NumberOfSubarraysThatMatchAPatternI.go)   
[3035. Maximum Palindromes After Operations](./leetcode/3035-MaximumPalindromesAfterOperations.go)   
[3036. Number of Subarrays That Match a Pattern II](./leetcode/3036-NumberOfSubarraysThatMatchAPatternII.go)   
[3037. Find Pattern in Infinite Stream II](./leetcode/3037-FindPatternInInfiniteStreamII.go)   
[3038. Maximum Number of Operations With the Same Score I](./leetcode/3038-MaximumNumberOfOperationsWithTheSameScoreI.go)   
[3040. Maximum Number of Operations With the Same Score II](./leetcode/3040-MaximumNumberOfOperationsWithTheSameScoreII.go)   
[3041. Maximize Consecutive Elements in an Array After Modification](./leetcode/3041-MaximizeConsecutiveElementsInAnArrayAfterModification.go)   
[3042. Count Prefix and Suffix Pairs I](./leetcode/3042-CountPrefixAndSuffixPairsI.go)   
[3043. Find the Length of the Longest Common Prefix](./leetcode/3043-FindTheLengthOfTheLongestCommonPrefix.go)   
[3044. Most Frequent Prime](./leetcode/3044-MostFrequentPrime.go)   
[3045. Count Prefix and Suffix Pairs II](./leetcode/3045-CountPrefixAndSuffixPairsII.go)   
[3046. Split the Array](./leetcode/3046-SplitTheArray.go)   
[3047. Find the Largest Area of Square Inside Two Rectangles](./leetcode/3047-FindTheLargestAreaOfSquareInsideTwoRectangles.go)   
[3048. Earliest Second to Mark Indices I](./leetcode/3048-EarliestSecondToMarkIndicesI.go)   
[3049. Earliest Second to Mark Indices II](./leetcode/3049-EarliestSecondToMarkIndicesII.go)   
[3065. Minimum Operations to Exceed Threshold Value I](./leetcode/3065-MinimumOperationsToExceedThresholdValueI.go)   
[3066. Minimum Operations to Exceed Threshold Value II](./leetcode/3066-MinimumOperationsToExceedThresholdValueII.go)   
[3067. Count Pairs of Connectable Servers in a Weighted Tree Network](./leetcode/3067-CountPairsOfConnectableServersInAWeightedTreeNetwork.go)   
[3068. Find the Maximum Sum of Node Values](./leetcode/3068-FindTheMaximumSumOfNodeValues.go)   
[3069. Distribute Elements Into Two Arrays I](./leetcode/3069-DistributeElementsIntoTwoArraysI.go)   
[3070. Count Submatrices with Top-Left Element and Sum Less Than k](./leetcode/3070-CountSubmatricesWithTopLeftElementAndSumLessThanK.go)   
[3071. Minimum Operations to Write the Letter Y on a Grid](./leetcode/3071-MinimumOperationsToWriteTheLetterYOnAGrid.go)   
[3072. Distribute Elements Into Two Arrays II](./leetcode/3072-DistributeElementsIntoTwoArraysII.go)   
[3073. Maximum Increasing Triplet Value](./leetcode/3073-MaximumIncreasingTripletValue.go)   
[3074. Apple Redistribution into Boxes](./leetcode/3074-AppleRedistributionIntoBoxes.go)   
[3075. Maximize Happiness of Selected Children](./leetcode/3075-MaximizeHappinessOfSelectedChildren.go)   
[3076. Shortest Uncommon Substring in an Array](./leetcode/3076-ShortestUncommonSubstringInAnArray.go)   
[3077. Maximum Strength of K Disjoint Subarrays](./leetcode/3077-MaximumStrengthOfKDisjointSubarrays.go)   
[3078. Match Alphanumerical Pattern in Matrix I](./leetcode/3078-MatchAlphanumericalPatternInMatrixI.go)   
[3079. Find the Sum of Encrypted Integers](./leetcode/3079-FindTheSumOfEncryptedIntegers.go)   
[3080. Mark Elements on Array by Performing Queries](./leetcode/3080-MarkElementsOnArrayByPerformingQueries.go)   
[3082. Find the Sum of the Power of All Subsequences](./leetcode/3082-FindTheSumOfThePowerOfAllSubsequences.go)   
[3092. Most Frequent IDs](./leetcode/3092-MostFrequentIDs.go)   
[3086. Minimum Moves to Pick K Ones](./leetcode/3086-MinimumMovesToPickKOnes.go)   
[3093. Longest Common Suffix Queries](./leetcode/3093-LongestCommonSuffixQueries.go)   
[3095. Shortest Subarray With OR at Least K I](./leetcode/3095-ShortestSubarrayWithORAtLeastKI.go)   
[3097. Shortest Subarray With OR at Least K II](./leetcode/3097-ShortestSubarrayWithORAtLeastKII.go)   
[3096. Minimum Levels to Gain More Points](./leetcode/3096-MinimumLevelsToGainMorePoints.go)   
[3098. Find the Sum of Subsequence Powers](./leetcode/3098-FindTheSumOfSubsequencePowers.go)   
[3101. Count Alternating Subarrays](./leetcode/3101-CountAlternatingSubarrays.go)   
[3102. Minimize Manhattan Distances](./leetcode/3102-MinimizeManhattanDistances.go)   
[3105. Longest Strictly Increasing or Strictly Decreasing Subarray](./leetcode/3105-LongestStrictlyIncreasingOrStrictlyDecreasingSubarray.go)   
[3107. Minimum Operations to Make Median of Array Equal to K](./leetcode/3107-MinimumOperationsToMakeMedianOfArrayEqualToK.go)   
[3111. Minimum Rectangles to Cover Points](./leetcode/3111-MinimumRectanglesToCoverPoints.go)   
[3113. Find the Number of Subarrays Where Boundary Elements Are Maximum](./leetcode/3113-FindTheNumberOfSubarraysWhereBoundaryElementsAreMaximum.go)   
[3115. Maximum Prime Difference](./leetcode/3115-MaximumPrimeDifference.go)   
[3116. Kth Smallest Amount With Single Denomination Combination](./leetcode/3116-KthSmallestAmountWithSingleDenominationCombination.go)   
[3117. Minimum Sum of Values by Dividing Array](./leetcode/3117-MinimumSumOfValuesByDividingArray.go)   
[3122. Minimum Number of Operations to Satisfy Conditions](./leetcode/3122-MinimumNumberOfOperationsToSatisfyConditions.go)   
[3127. Make a Square with the Same Color](./leetcode/3127-MakeASquareWithTheSameColor.go)   
[3131. Find the Integer Added to Array I](./leetcode/3131-FindTheIntegerAddedToArrayI.go)   
[3132. Find the Integer Added to Array II](./leetcode/3132-FindTheIntegerAddedToArrayII.go)   
[3134. Find the Median of the Uniqueness Array](./leetcode/3134-FindTheMedianOfTheUniquenessArray.go)   
[3139. Minimum Cost to Equalize Array](./leetcode/3139-MinimumCostToEqualizeArray.go)   
[3142. Check if Grid Satisfies Conditions](./leetcode/3142-CheckIfGridSatisfiesConditions.go)   
[3143. Maximum Points Inside the Square](./leetcode/3143-MaximumPointsInsideTheSquare.go)   
[3145. Find Products of Elements of Big Array](./leetcode/3145-FindProductsOfElementsOfBigArray.go)   
[3147. Taking Maximum Energy From the Mystic Dungeon](./leetcode/3147-TakingMaximumEnergyFromTheMysticDungeon.go)   
[3148. Maximum Difference Score in a Grid](./leetcode/3148-MaximumDifferenceScoreInAGrid.go)   
[3149. Find the Minimum Cost Array Permutation](./leetcode/3149-FindTheMinimumCostArrayPermutation.go)   
[3151. Special Array I](./leetcode/3151-SpecialArrayI.go)   
[3152. Special Array II](./leetcode/3152-SpecialArrayII.go)   
[3153. Sum of Digit Differences of All Pairs](./leetcode/3153-SumOfDigitDifferencesOfAllPairs.go)   
[3155. Maximum Number of Upgradable Servers](./leetcode/3155-MaximumNumberOfUpgradableServers.go)   
[3158. Find the XOR of Numbers Which Appear Twice](./leetcode/3158-FindTheXOROfNumbersWhichAppearTwice.go)   
[3159. Find Occurrences of an Element in an Array](./leetcode/3159-FindOccurrencesOfAnElementInAnArray.go)   
[3160. Find the Number of Distinct Colors Among the Balls](./leetcode/3160-FindTheNumberOfDistinctColorsAmongTheBalls.go)   
[3161. Block Placement Queries](./leetcode/3161-BlockPlacementQueries.go)   
[3165. Maximum Sum of Subsequence With Non-adjacent Elements](./leetcode/3165-MaximumSumOfSubsequenceWithNonAdjacentElements.go)   
[3169. Count Days Without Meetings](./leetcode/3169-CountDaysWithoutMeetings.go)   
[3171. Find Subarray With Bitwise OR Closest to K](./leetcode/3171-FindSubarrayWithBitwiseORClosestToK.go)   
[3173. Bitwise OR of Adjacent Elements](./leetcode/3173-BitwiseOROfAdjacentElements.go)   
[3175. Find The First Player to win K Games in a Row](./leetcode/3175-FindTheFirstPlayerToWinKGamesInARow.go)   
[3176. Find the Maximum Length of a Good Subsequence I](./leetcode/3176-FindTheMaximumLengthOfAGoodSubsequenceI.go)   
[3177. Find the Maximum Length of a Good Subsequence II](./leetcode/3177-FindTheMaximumLengthOfAGoodSubsequenceII.go)   
[3180. Maximum Total Reward Using Operations I](./leetcode/3180-MaximumTotalRewardUsingOperationsI.go)   
[3181. Maximum Total Reward Using Operations II](./leetcode/3181-MaximumTotalRewardUsingOperationsII.go)   
[3183. The Number of Ways to Make the Sum](./leetcode/3183-TheNumberOfWaysToMakeTheSum.go)   
[3184. Count Pairs That Form a Complete Day I](./leetcode/3184-CountPairsThatFormACompleteDayI.go)   
[3185. Count Pairs That Form a Complete Day II](./leetcode/3185-CountPairsThatFormACompleteDayII.go)   
[3186. Maximum Total Damage With Spell Casting](./leetcode/3186-MaximumTotalDamageWithSpellCasting.go)   
[3187. Peaks in Array](./leetcode/3187-PeaksInArray.go)   
[3189. Minimum Moves to Get a Peaceful Board](./leetcode/3189-MinimumMovesToGetAPeacefulBoard.go)   
[3190. Find Minimum Operations to Make All Elements Divisible by Three](./leetcode/3190-FindMinimumOperationsToMakeAllElementsDivisibleByThree.go)   
[3191. Minimum Operations to Make Binary Array Elements Equal to One I](./leetcode/3191-MinimumOperationsToMakeBinaryArrayElementsEqualToOneI.go)   
[3192. Minimum Operations to Make Binary Array Elements Equal to One II](./leetcode/3192-MinimumOperationsToMakeBinaryArrayElementsEqualToOneII.go)   
[3193. Count the Number of Inversions](./leetcode/3193-CountTheNumberOfInversions.go)   
[3194. Minimum Average of Smallest and Largest Elements](./leetcode/3194-MinimumAverageOfSmallestAndLargestElements.go)   
[3195. Find the Minimum Area to Cover All Ones I](./leetcode/3195-FindTheMinimumAreaToCoverAllOnesI.go)   
[3196. Maximize Total Cost of Alternating Subarrays](./leetcode/3196-MaximizeTotalCostOfAlternatingSubarrays.go)   
[3197. Find the Minimum Area to Cover All Ones II](./leetcode/3197-FindTheMinimumAreaToCoverAllOnesII.go)   
[3201. Find the Maximum Length of Valid Subsequence I](./leetcode/3201-FindTheMaximumLengthOfValidSubsequenceI.go)   
[3202. Find the Maximum Length of Valid Subsequence II](./leetcode/3202-FindTheMaximumLengthOfValidSubsequenceII.go)   
[3205. Maximum Array Hopping Score I](./leetcode/3205-MaximumArrayHoppingScoreI.go)   
[3206. Alternating Groups I](./leetcode/3206-AlternatingGroupsI.go)   
[3207. Maximum Points After Enemy Battles](./leetcode/3207-MaximumPointsAfterEnemyBattles.go)   
[3208. Alternating Groups II](./leetcode/3208-AlternatingGroupsII.go)   
[3209. Number of Subarrays With AND Value of K](./leetcode/3209-NumberOfSubarraysWithANDValueOfK.go)   
[3212. Count Submatrices With Equal Frequency of X and Y](./leetcode/3212-CountSubmatricesWithEqualFrequencyOfXAndY.go)   
[3215. Count Triplets with Even XOR Set Bits II](./leetcode/3215-CountTripletsWithEvenXORSetBitsII.go)   
[3218. Minimum Cost for Cutting Cake I](./leetcode/3218-MinimumCostForCuttingCakeI.go)   
[3219. Minimum Cost for Cutting Cake II](./leetcode/3219-MinimumCostForCuttingCakeII.go)   
[3221. Maximum Array Hopping Score II](./leetcode/3221-MaximumArrayHoppingScoreII.go)   
[3224. Minimum Array Changes to Make Differences Equal](./leetcode/3224-MinimumArrayChangesToMakeDifferencesEqual.go)   
[3225. Maximum Score From Grid Operations](./leetcode/3225-MaximumScoreFromGridOperations.go)   
[3327. Check if DFS Strings Are Palindromes](./leetcode/3327-CheckIfDFSStringsArePalindromes.go)   
[3229. Minimum Operations to Make Array Equal to Target](./leetcode/3229-MinimumOperationsToMakeArrayEqualToTarget.go)   
[3231. Minimum Number of Increasing Subsequence to Be Removed](./leetcode/3231-MinimumNumberOfIncreasingSubsequenceToBeRemoved.go)   
[3232. Find if Digit Game Can Be Won](./leetcode/3232-FindIfDigitGameCanBeWon.go)   
[3235. Check if the Rectangle Corner Is Reachable](./leetcode/3235-CheckIfTheRectangleCornerIsReachable.go)   
[3237. Alt and Tab Simulation](./leetcode/3237-AltAndTabSimulation.go)   
[3238. Find the Number of Winning Players](./leetcode/3238-FindTheNumberOfWinningPlayers.go)   
[3239. Minimum Number of Flips to Make Binary Grid Palindromic I](./leetcode/3239-MinimumNumberOfFlipsToMakeBinaryGridPalindromicI.go)   
[3240. Minimum Number of Flips to Make Binary Grid Palindromic II](./leetcode/3240-MinimumNumberOfFlipsToMakeBinaryGridPalindromicII.go)   
[3243. Shortest Distance After Road Addition Queries I](./leetcode/3243-ShortestDistanceAfterRoadAdditionQueriesI.go)   
[3244. Shortest Distance After Road Addition Queries II](./leetcode/3244-ShortestDistanceAfterRoadAdditionQueriesII.go)   
[3245. Alternating Groups III](./leetcode/3245-AlternatingGroupsIII.go)   
[3247. Number of Subsequences with Odd Sum](./leetcode/3247-NumberOfSubsequencesWithOddSum.go)   
[3248. Snake in Matrix](./leetcode/3248-SnakeInMatrix.go)   
[3250. Find the Count of Monotonic Pairs I](./leetcode/3250-FindTheCountOfMonotonicPairsI.go)   
[3251. Find the Count of Monotonic Pairs II](./leetcode/3251-FindTheCountOfMonotonicPairsII.go)   
[3254. Find the Power of K-Size Subarrays I](./leetcode/3254-FindThePowerOfKSizeSubarraysI.go)   
[3255. Find the Power of K-Size Subarrays II](./leetcode/3255-FindThePowerOfKSizeSubarraysII.go)   
[3256. Maximum Value Sum by Placing Three Rooks I](./leetcode/3256-MaximumValueSumByPlacingThreeRooksI.go)   
[3257. Maximum Value Sum by Placing Three Rooks II](./leetcode/3257-MaximumValueSumByPlacingThreeRooksII.go)   
[3259. Maximum Energy Boost From Two Drinks](./leetcode/3259-MaximumEnergyBoostFromTwoDrinks.go)   
[3264. Final Array State After K Multiplication Operations I](./leetcode/3264-FinalArrayStateAfterKMultiplicationOperationsI.go)   
[3265. Count Almost Equal Pairs I](./leetcode/3265-CountAlmostEqualPairsI.go)   
[3266. Final Array State After K Multiplication Operations II](./leetcode/3266-FinalArrayStateAfterKMultiplicationOperationsII.go)  
[3267. Count Almost Equal Pairs II](./leetcode/3267-CountAlmostEqualPairsII.go)   
[3269. Constructing Two Increasing Arrays](./leetcode/3269-ConstructingTwoIncreasingArrays.go)   
[3273. Minimum Amount of Damage Dealt to Bob](./leetcode/3273-MinimumAmountOfDamageDealtToBob.go)   
[3275. K-th Nearest Obstacle Queries](./leetcode/3275-KthNearestObstacleQueries.go)   
[3276. Select Cells in Grid With Maximum Score](./leetcode/3276-SelectCellsInGridWithMaximumScore.go)   
[3277. Maximum XOR Score Subarray Queries](./leetcode/3277-MaximumXORScoreSubarrayQueries.go)   
[3279. Maximum Total Area Occupied by Pistons](./leetcode/3279-MaximumTotalAreaOccupiedByPistons.go)   
[3281. Maximize Score of Numbers in Ranges](./leetcode/3281-MaximizeScoreOfNumbersInRanges.go)   
[3282. Reach End of Array With Max Score](./leetcode/3282-ReachEndOfArrayWithMaxScore.go)   
[3283. Maximum Number of Moves to Kill All Pawns](./leetcode/3283-MaximumNumberOfMovesToKillAllPawns.go)   
[3284. Sum of Consecutive Subarrays](./leetcode/3284-SumOfConsecutiveSubarrays.go)   
[3285. Find Indices of Stable Mountains](./leetcode/3285-FindIndicesOfStableMountains.go)   
[3286. Find a Safe Walk Through a Grid](./leetcode/3286-FindASafeWalkThroughAGrid.go)   
[3287. Find the Maximum Sequence Value of Array](./leetcode/3287-FindTheMaximumSequenceValueOfArray.go)   
[3288. Length of the Longest Increasing Path](./leetcode/3288-LengthOfTheLongestIncreasingPath.go)   
[3289. The Two Sneaky Numbers of Digitville](./leetcode/3289-TheTwoSneakyNumbersOfDigitville.go)   
[3290. Maximum Multiplication Score](./leetcode/3290-MaximumMultiplicationScore.go)   
[3295. Report Spam Message](./leetcode/3295-ReportSpamMessage.go)   
[3296. Minimum Number of Seconds to Make Mountain Height Zero](./leetcode/3296-MinimumNumberOfSecondsToMakeMountainHeightZero.go)   
[3299. Sum of Consecutive Subsequences](./leetcode/3299-SumOfConsecutiveSubsequences.go)   
[3301. Maximize the Total Height of Unique Towers](./leetcode/3301-MaximizeTheTotalHeightOfUniqueTowers.go)   
[3309. Maximum Possible Number by Binary Concatenation](./leetcode/3309-MaximumPossibleNumberByBinaryConcatenation.go)   
[3311. Construct 2D Grid Matching Graph Layout](./leetcode/3311-Construct2DGridMatchingGraphLayout.go)   
[3312. Sorted GCD Pair Queries](./leetcode/3312-SortedGCDPairQueries.go)   
[3314. Construct the Minimum Bitwise Array I](./leetcode/3314-ConstructTheMinimumBitwiseArrayI.go)   
[3315. Construct the Minimum Bitwise Array II](./leetcode/3315-ConstructTheMinimumBitwiseArrayII.go)   
[3318. Find X-Sum of All K-Long Subarrays I](./leetcode/3318-FindXSumOfAllKLongSubarraysI.go)   
[3321. Find X-Sum of All K-Long Subarrays II](./leetcode/3321-FindXSumOfAllKLongSubarraysII.go)   
[3323. Minimize Connected Groups by Inserting Interval](./leetcode/3323-MinimizeConnectedGroupsByInsertingInterval.go)   
[3326. Minimum Division Operations to Make Array Non Decreasing](./leetcode/3326-MinimumDivisionOperationsToMakeArrayNonDecreasing.go)   
[3332. Maximum Points Tourist Can Earn](./leetcode/3332-MaximumPointsTouristCanEarn.go)   
[3334. Find the Maximum Factor Score of Array](./leetcode/3334-FindTheMaximumFactorScoreOfArray.go)   
[3336. Find the Number of Subsequences With Equal GCD](./leetcode/3336-FindTheNumberOfSubsequencesWithEqualGCD.go)   
[3341. Find Minimum Time to Reach Last Room I](./leetcode/3341-FindMinimumTimeToReachLastRoomI.go)   
[3342. Find Minimum Time to Reach Last Room II](./leetcode/3342-FindMinimumTimeToReachLastRoomII.go)   
[3346. Maximum Frequency of an Element After Performing Operations I](./leetcode/3346-MaximumFrequencyOfAnElementAfterPerformingOperationsI.go)   
[3347. Maximum Frequency of an Element After Performing Operations II](./leetcode/3347-MaximumFrequencyOfAnElementAfterPerformingOperationsII.go)   
[3349. Adjacent Increasing Subarrays Detection I](./leetcode/3349-AdjacentIncreasingSubarraysDetectionI.go)   
[3350. Adjacent Increasing Subarrays Detection II](./leetcode/3350-AdjacentIncreasingSubarraysDetectionII.go)   
[3351. Sum of Good Subsequences](./leetcode/3351-SumOfGoodSubsequences.go)   
[3353. Minimum Total Operations](./leetcode/3353-MinimumTotalOperations.go)   
[3354. Make Array Elements Equal to Zero](./leetcode/3354-MakeArrayElementsEqualToZero.go)   
[3355. Zero Array Transformation I](./leetcode/3355-ZeroArrayTransformationI.go)   
[3356. Zero Array Transformation II](./leetcode/3356-ZeroArrayTransformationII.go)   
[3357. Minimize the Maximum Adjacent Element Difference](./leetcode/3357-MinimizeTheMaximumAdjacentElementDifference.go)   
[3359. Find Sorted Submatrices With Maximum Element at Most K](./leetcode/3359-FindSortedSubmatricesWithMaximumElementAtMostK.go)   
[3361. Shift Distance Between Two Strings](./leetcode/3361-ShiftDistanceBetweenTwoStrings.go)   
[3362. Zero Array Transformation III](./leetcode/3362-ZeroArrayTransformationIII.go)   
[3363. Find the Maximum Number of Fruits Collected](./leetcode/3363-FindTheMaximumNumberOfFruitsCollected.go)   
[3364. Minimum Positive Sum Subarray](./leetcode/3364-MinimumPositiveSumSubarray.go)   
[3366. Minimum Array Sum](./leetcode/3366-MinimumArraySum.go)   
[3371. Identify the Largest Outlier in an Array](./leetcode/3371-IdentifyTheLargestOutlierInAnArray.go)   
[3375. Minimum Operations to Make Array Values Equal to K](./leetcode/3375-MinimumOperationsToMakeArrayValuesEqualToK.go)   
[3376. Minimum Time to Break Locks I](./leetcode/3376-MinimumTimeToBreakLocksI.go)   
[3378. Count Connected Components in LCM Graph](./leetcode/3378-CountConnectedComponentsInLCMGraph.go)   
[3379. Transformed Array](./leetcode/3379-TransformedArray.go)   
[3380. Maximum Area Rectangle With Point Constraints I](./leetcode/3380-MaximumAreaRectangleWithPointConstraintsI.go)   
[3381. Maximum Subarray Sum With Length Divisible by K](./leetcode/3381-MaximumSubarraySumWithLengthDivisibleByK.go)   
[3382. Maximum Area Rectangle With Point Constraints II](./leetcode/3382-MaximumAreaRectangleWithPointConstraintsII.go)   
[3383. Minimum Runes to Add to Cast Spell](./leetcode/3383-MinimumRunesToAddToCastSpell.go)   
[3385. Minimum Time to Break Locks II](./leetcode/3385-MinimumTimeToBreakLocksII.go)   
[3386. Button with Longest Push Time](./leetcode/3386-ButtonWithLongestPushTime.go)   
[3387. Maximize Amount After Two Days of Conversions](./leetcode/3387-MaximizeAmountAfterTwoDaysOfConversions.go)   
[3388. Count Beautiful Splits in an Array](./leetcode/3388-CountBeautifulSplitsInAnArray.go)   
[3392. Count Subarrays of Length Three With a Condition](./leetcode/3392-CountSubarraysOfLengthThreeWithACondition.go)   
[3393. Count Paths With the Given XOR Value](./leetcode/3393-CountPathsWithTheGivenXORValue.go)   
[3394. Check if Grid can be Cut into Sections](./leetcode/3394-CheckIfGridCanBeCutIntoSections.go)   
[3395. Subsequences with a Unique Middle Mode I](./leetcode/3395-SubsequencesWithAUniqueMiddleModeI.go)   
[3396. Minimum Number of Operations to Make Elements in Array Distinct](./leetcode/3396-MinimumNumberOfOperationsToMakeElementsInArrayDistinct.go)   
[3397. Maximum Number of Distinct Elements After Operations](./leetcode/3397-MaximumNumberOfDistinctElementsAfterOperations.go)   
[3400. Maximum Number of Matching Indices After Right Shifts](./leetcode/3400-MaximumNumberOfMatchingIndicesAfterRightShifts.go)   
[3402. Minimum Operations to Make Columns Strictly Increasing](./leetcode/3402-MinimumOperationsToMakeColumnsStrictlyIncreasing.go)   
[3404. Count Special Subsequences](./leetcode/3404-CountSpecialSubsequences.go)   
[3409. Longest Subsequence With Decreasing Adjacent Difference](./leetcode/3409-LongestSubsequenceWithDecreasingAdjacentDifference.go)   
[3410. Maximize Subarray Sum After Removing All Occurrences of One Element](./leetcode/3410-MaximizeSubarraySumAfterRemovingAllOccurrencesOfOneElement.go)   
[3411. Maximum Subarray With Equal Products](./leetcode/3411-MaximumSubarrayWithEqualProducts.go)   
[3413. Maximum Coins From K Consecutive Bags](./leetcode/3413-MaximumCoinsFromKConsecutiveBags.go)   
[3414. Maximum Score of Non-overlapping Intervals](./leetcode/3414-MaximumScoreOfNonOverlappingIntervals.go)   
[3416. Subsequences with a Unique Middle Mode II](./leetcode/3416-SubsequencesWithAUniqueMiddleModeII.go)   
[3417. Zigzag Grid Traversal With Skip](./leetcode/3417-ZigzagGridTraversalWithSkip.go)   
[3418. Maximum Amount of Money Robot Can Earn](./leetcode/3418-MaximumAmountOfMoneyRobotCanEarn.go)   
[3420. Count Non-Decreasing Subarrays After K Operations](./leetcode/3420-CountNonDecreasingSubarraysAfterKOperations.go)   
[3422. Minimum Operations to Make Subarray Elements Equal](./leetcode/3422-MinimumOperationsToMakeSubarrayElementsEqual.go)   
[3423. Maximum Difference Between Adjacent Elements in a Circular Array](./leetcode/3423-MaximumDifferenceBetweenAdjacentElementsInACircularArray.go)   
[3424. Minimum Cost to Make Arrays Identical](./leetcode/3424-MinimumCostToMakeArraysIdentical.go)   
[3427. Sum of Variable Length Subarrays](./leetcode/3427-SumOfVariableLengthSubarrays.go)   
[3428. Maximum and Minimum Sums of at Most Size K Subsequences](./leetcode/3428-MaximumAndMinimumSumsOfAtMostSizeKSubsequences.go)   
[3429. Paint House IV](./leetcode/3429-PaintHouseIV.go)   
[3430. Maximum and Minimum Sums of at Most Size K Subarrays](./leetcode/3430-MaximumAndMinimumSumsOfAtMostSizeKSubarrays.go)   
[3431. Minimum Unlocked Indices to Sort Nums](./leetcode/3431-MinimumUnlockedIndicesToSortNums.go)   
[3432. Count Partitions with Even Sum Difference](./leetcode/3432-CountPartitionsWithEvenSumDifference.go)   
[3433. Count Mentions Per User](./leetcode/3433-CountMentionsPerUser.go)   
[3434. Maximum Frequency After Subarray Operation](./leetcode/3434-MaximumFrequencyAfterSubarrayOperation.go)   
[3435. Frequencies of Shortest Supersequences](./leetcode/3435-FrequenciesOfShortestSupersequences.go)   
[3439. Reschedule Meetings for Maximum Free Time I](./leetcode/3439-RescheduleMeetingsForMaximumFreeTimeI.go)   
[3440. Reschedule Meetings for Maximum Free Time II](./leetcode/3440-RescheduleMeetingsForMaximumFreeTimeII.go)   
[3444. Minimum Increments for Target Multiples in an Array](./leetcode/3444-MinimumIncrementsForTargetMultiplesInAnArray.go)   
[3446. Sort Matrix by Diagonals](./leetcode/3446-SortMatrixByDiagonals.go)   
[3447. Assign Elements to Groups with Constraints](./leetcode/3447-AssignElementsToGroupsWithConstraints.go)   
[3449. Maximize the Minimum Game Score](./leetcode/3449-MaximizeTheMinimumGameScore.go)   
[3450. Maximum Students on a Single Bench](./leetcode/3450-MaximumStudentsOnASingleBench.go)   
[3452. Sum of Good Numbers](./leetcode/3452-SumOfGoodNumbers.go)   
[3453. Separate Squares I](./leetcode/3453-SeparateSquaresI.go)   
[3454. Separate Squares II](./leetcode/3454-SeparateSquaresII.go)   
[3457. Eat Pizzas!](./leetcode/3457-EatPizzas.go)   
[3459. Length of Longest V-Shaped Diagonal Segment](./leetcode/3459-LengthOfLongestVShapedDiagonalSegment.go)   
[3462. Maximum Sum With at Most K Elements](./leetcode/3462-MaximumSumWithAtMostKElements.go)   
[3464. Maximize the Distance Between Points on a Square](./leetcode/3464-MaximizeTheDistanceBetweenPointsOnASquare.go)   
[3466. Maximum Coin Collection](./leetcode/3466-MaximumCoinCollection.go)   
[3467. Transform Array by Parity](./leetcode/3467-TransformArrayByParity.go)   
[3468. Find the Number of Copy Arrays](./leetcode/3468-FindTheNumberOfCopyArrays.go)   
[3469. Find Minimum Cost to Remove Array Elements](./leetcode/3469-FindMinimumCostToRemoveArrayElements.go)   
[3471. Find the Largest Almost Missing Integer](./leetcode/3471-FindTheLargestAlmostMissingInteger.go)   
[3473. Sum of K Subarrays With Length at Least M](./leetcode/3473-SumOfKSubarraysWithLengthAtLeastM.go)   
[3476. Maximize Profit from Task Assignment](./leetcode/3476-MaximizeProfitFromTaskAssignment.go)   
[3477. Fruits Into Baskets II](./leetcode/3477-FruitsIntoBasketsII.go)   
[3478. Choose K Elements With Maximum Sum](./leetcode/3478-ChooseKElementsWithMaximumSum.go)   
[3479. Fruits Into Baskets III](./leetcode/3479-FruitsIntoBasketsIII.go)   
[3480. Maximize Subarrays After Removing One Conflicting Pair](./leetcode/3480-MaximizeSubarraysAfterRemovingOneConflictingPair.go)   
[3481. Apply Substitutions](./leetcode/3481-ApplySubstitutions.go)   
[3483. Unique 3-Digit Even Numbers](./leetcode/3483-Unique3DigitEvenNumbers.go)   
[3485. Longest Common Prefix of K Strings After Removal](./leetcode/3485-LongestCommonPrefixOfKStringsAfterRemoval.go)   
[3487. Maximum Unique Subarray Sum After Deletion](./leetcode/3487-MaximumUniqueSubarraySumAfterDeletion.go)   
[3488. Closest Equal Element Queries](./leetcode/3488-ClosestEqualElementQueries.go)   
[3489. Zero Array Transformation IV](./leetcode/3489-ZeroArrayTransformationIV.go)   
[3491. Phone Number Prefix](./leetcode/3491-PhoneNumberPrefix.go)   
[3494. Find the Minimum Amount of Time to Brew Potions](./leetcode/3494-FindTheMinimumAmountOfTimeToBrewPotions.go)   
[3495. Minimum Operations to Make Array Elements Zero](./leetcode/3495-MinimumOperationsToMakeArrayElementsZero.go)   
[3496. Maximize Score After Pair Deletions](./leetcode/3496-MaximizeScoreAfterPairDeletions.go)   
[3500. Minimum Cost to Divide Array Into Subarrays](./leetcode/3500-MinimumCostToDivideArrayIntoSubarrays.go)   
[3502. Minimum Cost to Reach Every Position](./leetcode/3502-MinimumCostToReachEveryPosition.go)   
[3505. Minimum Operations to Make Elements Within K Subarrays Equal](./leetcode/3505-MinimumOperationsToMakeElementsWithinKSubarraysEqual.go)   
[3506. Find Time Required to Eliminate Bacterial Strains II](./leetcode/3506-FindTimeRequiredToEliminateBacterialStrainsII.go)   
[3507. Minimum Pair Removal to Sort Array I](./leetcode/3507-MinimumPairRemovalToSortArrayI.go)   
[3509. Maximum Product of Subsequences With an Alternating Sum Equal to K](./leetcode/3509-MaximumProductOfSubsequencesWithAnAlternatingSumEqualToK.go)   
[3510. Minimum Pair Removal to Sort Array II](./leetcode/3510-MinimumPairRemovalToSortArrayII.go)   
[3511. Make a Positive Array](./leetcode/3511-MakeAPositiveArray.go)   
[3512. Minimum Operations to Make Array Sum Divisible by K](./leetcode/3512-MinimumOperationsToMakeArraySumDivisibleByK.go)   
[3513. Number of Unique XOR Triplets I](./leetcode/3513-NumberOfUniqueXORTripletsI.go)   
[3514. Number of Unique XOR Triplets II](./leetcode/3514-NumberOfUniqueXORTripletsII.go)   
[3520. Minimum Threshold for Inversion Pairs Count](./leetcode/3520-MinimumThresholdForInversionPairsCount.go)   
[3522. Calculate Score After Performing Instructions](./leetcode/3522-CalculateScoreAfterPerformingInstructions.go)   
[3523. Make Array Non-decreasing](./leetcode/3523-MakeArrayNonDecreasing.go)   
[3524. Find X Value of Array I](./leetcode/3524-FindXValueOfArrayI.go)   
[3525. Find X Value of Array II](./leetcode/3525-FindXValueOfArrayII.go)   
[3526. Range XOR Queries with Subarray Reversals](./leetcode/3526-RangeXORQueriesWithSubarrayReversals.go)   
[3527. Find the Most Common Response](./leetcode/3527-FindTheMostCommonResponse.go)   
[3529. Count Cells in Overlapping Horizontal and Vertical Substrings](./leetcode/3529-CountCellsInOverlappingHorizontalAndVerticalSubstrings.go)   
[3531. Count Covered Buildings](./leetcode/3531-CountCoveredBuildings.go)   
[3533. Concatenated Divisibility](./leetcode/3533-ConcatenatedDivisibility.go)   
[3538. Merge Operations for Minimum Travel Time](./leetcode/3538-MergeOperationsForMinimumTravelTime.go)   
[3539. Find Sum of Array Product of Magical Sequences](./leetcode/3539-FindSumOfArrayProductOfMagicalSequences.go)   
[3540. Minimum Time to Visit All Houses](./leetcode/3540-MinimumTimeToVisitAllHouses.go)   
[3542. Minimum Operations to Convert All Elements to Zero](./leetcode/3542-MinimumOperationsToConvertAllElementsToZero.go)   
[3546. Equal Sum Grid Partition I](./leetcode/3546-EqualSumGridPartitionI.go)   
[3548. Equal Sum Grid Partition II](./leetcode/3548-EqualSumGridPartitionII.go)   
[3549. Multiply Two Polynomials](./leetcode/3549-MultiplyTwoPolynomials.go)   
[3550. Smallest Index With Digit Sum Equal to Index](./leetcode/3550-SmallestIndexWithDigitSumEqualToIndex.go)   
[3551. Minimum Swaps to Sort by Digit Sum](./leetcode/3551-MinimumSwapsToSortByDigitSum.go)   
[3552. Grid Teleportation Traversal](./leetcode/3552-GridTeleportationTraversal.go)   
[3555. Smallest Subarray to Sort in Every Sliding Window](./leetcode/3555-SmallestSubarrayToSortInEverySlidingWindow.go)   
[3558. Number of Ways to Assign Edge Weights I](./leetcode/3558-NumberOfWaysToAssignEdgeWeightsI.go)   
[3559. Number of Ways to Assign Edge Weights II](./leetcode/3559-NumberOfWaysToAssignEdgeWeightsII.go)   
[3562. Maximum Profit from Trading Stocks with Discounts](./leetcode/3562-MaximumProfitFromTradingStocksWithDiscounts.go)   
[3565. Sequential Grid Path Cover](./leetcode/3565-SequentialGridPathCover.go)   
[3566. Partition Array into Two Equal Product Subsets](./leetcode/3566-PartitionArrayIntoTwoEqualProductSubsets.go)   
[3567. Minimum Absolute Difference in Sliding Submatrix](./leetcode/3567-MinimumAbsoluteDifferenceInSlidingSubmatrix.go)   
[3568. Minimum Moves to Clean the Classroom](./leetcode/3568-MinimumMovesToCleanTheClassroom.go)   
[3569. Maximize Count of Distinct Primes After Split](./leetcode/3569-MaximizeCountOfDistinctPrimesAfterSplit.go)   
[3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values](./leetcode/3572-MaximizeYSumByPickingATripletOfDistinctXValues.go)   
[3573. Best Time to Buy and Sell Stock V](./leetcode/3573-BestTimeToBuyAndSellStockV.go)   
[3574. Maximize Subarray GCD Score](./leetcode/3574-MaximizeSubarrayGCDScore.go)   
[3575. Maximum Good Subtree Score](./leetcode/3575-MaximumGoodSubtreeScore.go)   
[3576. Transform Array to All Equal Elements](./leetcode/3576-TransformArrayToAllEqualElements.go)   
[3577. Count the Number of Computer Unlocking Permutations](./leetcode/3577-CountTheNumberOfComputerUnlockingPermutations.go)   
[3578. Count Partitions With Max-Min Difference at Most K](./leetcode/3578-CountPartitionsWithMaxMinDifferenceAtMostK.go)   
[3583. Count Special Triplets](./leetcode/3583-CountSpecialTriplets.go)   
[3584. Maximum Product of First and Last Elements of a Subsequence](./leetcode/3584-MaximumProductOfFirstAndLastElementsOfASubsequence.go)   
[3587. Minimum Adjacent Swaps to Alternate Parity](./leetcode/3587-MinimumAdjacentSwapsToAlternateParity.go)   
[3588. Find Maximum Area of a Triangle](./leetcode/3588-FindMaximumAreaOfATriangle.go)   
[3589. Count Prime-Gap Balanced Subarrays](./leetcode/3589-CountPrimeGapBalancedSubarrays.go)   
[3590. Kth Smallest Path XOR Sum](./leetcode/3590-KthSmallestPathXORSum.go)   
[3591. Check if Any Element Has Prime Frequency](./leetcode/3591-CheckIfAnyElementHasPrimeFrequency.go)   
[3592. Inverse Coin Change](./leetcode/3592-InverseCoinChange.go)   
[3594. Minimum Time to Transport All Individuals](./leetcode/3594-MinimumTimeToTransportAllIndividuals.go)   
[3595. Once Twice](./leetcode/3595-OnceTwice.go)   
[3598. Longest Common Prefix Between Adjacent Strings After Removals](./leetcode/3598-LongestCommonPrefixBetweenAdjacentStringsAfterRemovals.go)   
[3599. Partition Array to Minimize XOR](./leetcode/3599-PartitionArrayToMinimizeXOR.go)   
[3605. Minimum Stability Factor of Array](./leetcode/3605-MinimumStabilityFactorOfArray.go)   
[3606. Coupon Code Validator](./leetcode/3606-CouponCodeValidator.go)   
[3616. Number of Student Replacements](./leetcode/3616-NumberOfStudentReplacements.go)   
[3618. Split Array by Prime Indices](./leetcode/3618-SplitArrayByPrimeIndices.go)   
[3623. Count Number of Trapezoids I](./leetcode/3623-CountNumberOfTrapezoidsI.go)   
[3625. Count Number of Trapezoids II](./leetcode/3625-CountNumberOfTrapezoidsII.go)   
[3627. Maximum Median Sum of Subsequences of Size 3](./leetcode/3627-MaximumMedianSumOfSubsequencesOfSize3.go)   
[3629. Minimum Jumps to Reach End via Prime Teleportation](./leetcode/3629-MinimumJumpsToReachEndViaPrimeTeleportation.go)   
[3630. Partition Array for Maximum XOR and AND](./leetcode/3630-PartitionArrayForMaximumXORAndAND.go)   
[3631. Sort Threats by Severity and Exploitability](./leetcode/3631-SortThreatsBySeverityAndExploitability.go)   
[3632. Subarrays with XOR at Least K](./leetcode/3632-SubarraysWithXORAtLeastK.go)   
[3633. Earliest Finish Time for Land and Water Rides I](./leetcode/3633-EarliestFinishTimeForLandAndWaterRidesI.go)   
[3634. Minimum Removals to Balance Array](./leetcode/3634-MinimumRemovalsToBalanceArray.go)   
[3635. Earliest Finish Time for Land and Water Rides II](./leetcode/3635-EarliestFinishTimeForLandAndWaterRidesII.go)   
[3636. Threshold Majority Queries](./leetcode/3636-ThresholdMajorityQueries.go)   
[3637. Trionic Array I](./leetcode/3637-TrionicArrayI.go)   
[3638. Maximum Balanced Shipments](./leetcode/3638-MaximumBalancedShipments.go)   
[3640. Trionic Array II](./leetcode/3640-TrionicArrayII.go)   
[3641. Longest Semi-Repeating Subarray](./leetcode/3641-LongestSemiRepeatingSubarray.go)   
[3643. Flip Square Submatrix Vertically](./leetcode/3643-FlipSquareSubmatrixVertically.go)   
[3644. Maximum K to Sort a Permutation](./leetcode/3644-MaximumKToSortAPermutation.go)   
[3645. Maximum Total from Optimal Activation Order](./leetcode/3645-MaximumTotalFromOptimalActivationOrder.go)   
[3647. Maximum Weight in Two Bags](./leetcode/3647-MaximumWeightInTwoBags.go)   
[3651. Minimum Cost Path with Teleportations](./leetcode/3651-MinimumCostPathWithTeleportations.go)   
[3652. Best Time to Buy and Sell Stock using Strategy](./leetcode/3652-BestTimeToBuyAndSellStockUsingStrategy.go)   
[3653. XOR After Range Multiplication Queries I](./leetcode/3653-XORAfterRangeMultiplicationQueriesI.go)   
[3654. Minimum Sum After Divisible Sum Deletions](./leetcode/3654-MinimumSumAfterDivisibleSumDeletions.go)   
[3655. XOR After Range Multiplication Queries II](./leetcode/3655-XORAfterRangeMultiplicationQueriesII.go)   
[3656. Count the Number of Simple Paths](./leetcode/3656-CountTheNumberOfSimplePaths.go)   
[3659. Partition Array Into K-Distinct Groups](./leetcode/3659-PartitionArrayIntoKDistinctGroups.go)   
[3660. Jump Game IX](./leetcode/3660-JumpGameIX.go)   
[3661. Maximum Walls Destroyed by Robots](./leetcode/3661-MaximumWallsDestroyedByRobots.go)   
[3664. Two-Letter Card Game](./leetcode/3664-TwoLetterCardGame.go)   
[3665. Twisted Mirror Path Count](./leetcode/3665-TwistedMirrorPathCount.go)   
[3667. Sort Array By Absolute Value](./leetcode/3667-SortArrayByAbsoluteValue.go)   
[3668. Restore Finishing Order](./leetcode/3668-RestoreFinishingOrder.go)   
[3670. Maximum Product of Two Integers With No Common Bits](./leetcode/3670-MaximumProductOfTwoIntegersWithNoCommonBits.go)   
[3671. Sum of Beautiful Subsequences](./leetcode/3671-SumOfBeautifulSubsequences.go)   
[3672. Sum of Weighted Modes in Subarrays](./leetcode/3672-SumOfWeightedModesInSubarrays.go)   
[3676. Count Bowl Subarrays](./leetcode/3676-CountBowlSubarrays.go)   
[3678. Smallest Absent Positive Greater Than Average](./leetcode/3678-SmallestAbsentPositiveGreaterThanAverage.go)   
[3679. Minimum Discards to Balance Inventory](./leetcode/3679-MinimumDiscardsToBalanceInventory.go)   
[3681. Maximum XOR of Subsequences](./leetcode/3681-MaximumXOROfSubsequences.go)   
[3682. Minimum Index Sum of Common Elements](./leetcode/3682-MinimumIndexSumOfCommonElements.go)   
[3683. Earliest Time to Finish One Task](./leetcode/3683-EarliestTimeToFinishOneTask.go)   
[3684. Maximize Sum of At Most K Distinct Elements](./leetcode/3684-MaximizeSumOfAtMostKDistinctElements.go)   
[3685. Subsequence Sum After Capping Elements](./leetcode/3685-SubsequenceSumAfterCappingElements.go)   
[3686. Number of Stable Subsequences](./leetcode/3686-NumberOfStableSubsequences.go)   
[3687. Library Late Fee Calculator](./leetcode/3687-LibraryLateFeeCalculator.go)   
[3688. Bitwise OR of Even Numbers in an Array](./leetcode/3688-BitwiseORofEvenNumbersInAnArray.go)   
[3689. Maximum Total Subarray Value I](./leetcode/3689-MaximumTotalSubarrayValueI.go)   
[3690. Split and Merge Array Transformation](./leetcode/3690-SplitAndMergeArrayTransformation.go)   
[3691. Maximum Total Subarray Value II](./leetcode/3691-MaximumTotalSubarrayValueII.go)   
[3693. Climbing Stairs II](./leetcode/3693-ClimbingStairsII.go)   
[3695. Maximize Alternating Sum Using Swaps](./leetcode/3695-MaximizeAlternatingSumUsingSwaps.go)   
[3696. Maximum Distance Between Unequal Words in Array I](./leetcode/3696-MaximumDistanceBetweenUnequalWordsInArrayI.go)   
[3698. Split Array With Minimum Difference](./leetcode/3698-SplitArrayWithMinimumDifference.go)   
[3701. Compute Alternating Sum](./leetcode/3701-ComputeAlternatingSum.go)   
[3702. Longest Subsequence With Non-Zero Bitwise XOR](./leetcode/3702-LongestSubsequenceWithNonZeroBitwiseXOR.go)   
[3706. Maximum Distance Between Unequal Words in Array II](./leetcode/3706-MaximumDistanceBetweenUnequalWordsInArrayII.go)   
[3708. Longest Fibonacci Subarray](./leetcode/3708-LongestFibonacciSubarray.go)   
[3710. Maximum Partition Factor](./leetcode/3710-MaximumPartitionFactor.go)   
[3711. Maximum Transactions Without Negative Balance](./leetcode/3711-MaximumTransactionsWithoutNegativeBalance.go)   
[3712. Sum of Elements With Frequency Divisible by K](./leetcode/3712-SumOfElementsWithFrequencyDivisibleByK.go)   
[3717. Minimum Operations to Make the Array Beautiful](./leetcode/3717-MinimumOperationsToMakeTheArrayBeautiful.go)   
[3718. Smallest Missing Multiple of K](./leetcode/3718-SmallestMissingMultipleOfK.go)   
[3719. Longest Balanced Subarray I](./leetcode/3719-LongestBalancedSubarrayI.go)   
[3721. Longest Balanced Subarray II](./leetcode/3721-LongestBalancedSubarrayII.go)   
[3724. Minimum Operations to Transform Array](./leetcode/3724-MinimumOperationsToTransformArray.go)   
[3725. Count Ways to Choose Coprime Integers from Rows](./leetcode/3725-CountWaysToChooseCoprimeIntegersFromRows.go)   
[3727. Maximum Alternating Sum of Squares](./leetcode/3727-MaximumAlternatingSumOfSquares.go)   
[3728. Stable Subarrays With Equal Boundary and Interior Sum](./leetcode/3728-StableSubarraysWithEqualBoundaryAndInteriorSum.go)   
[3729. Count Distinct Subarrays Divisible by K in Sorted Array](./leetcode/3729-CountDistinctSubarraysDivisibleByKInSortedArray.go)   
[3730. Maximum Calories Burnt from Jumps](./leetcode/3730-MaximumCaloriesBurntFromJumps.go)   
[3731. Find Missing Elements](./leetcode/3731-FindMissingElements.go)   
[3732. Maximum Product of Three Elements After One Replacement](./leetcode/3732-MaximumProductOfThreeElementsAfterOneReplacement.go)   
[3733. Minimum Time to Complete All Deliveries](./leetcode/3733-MinimumTimeToCompleteAllDeliveries.go)   
[3736. Minimum Moves to Equal Array Elements III](./leetcode/3736-MinimumMovesToEqualArrayElementsIII.go)   
[3737. Count Subarrays With Majority Element I](./leetcode/3737-CountSubarraysWithMajorityElementI.go)   
[3738. Longest Non-Decreasing Subarray After Replacing at Most One Element](./leetcode/3738-LongestNonDecreasingSubarrayAfterReplacingAtMostOneElement.go)   
[3739. Count Subarrays With Majority Element II](./leetcode/3739-CountSubarraysWithMajorityElementII.go)   
[3740. Minimum Distance Between Three Equal Elements I](./leetcode/3740-MinimumDistanceBetweenThreeEqualElementsI.go)   
[3741. Minimum Distance Between Three Equal Elements II](./leetcode/3741-MinimumDistanceBetweenThreeEqualElementsII.go)   
[3742. Maximum Path Score in a Grid](./leetcode/3742-MaximumPathScoreInAGrid.go)   
[3743. Maximize Cyclic Partition Score](./leetcode/3743-MaximizeCyclicPartitionScore.go)   
[3745. Maximize Expression of Three Elements](./leetcode/3745-MaximizeExpressionOfThreeElements.go)   
[3748. Count Stable Subarrays](./leetcode/3748-CountStableSubarrays.go)   
[3755. Find Maximum Balanced XOR Subarray Length](./leetcode/3755-FindMaximumBalancedXORSubarrayLength.go)   
[3757. Number of Effective Subsequences](./leetcode/3757-NumberOfEffectiveSubsequences.go)   
[3759. Count Elements With at Least K Greater Values](./leetcode/3759-CountElementsWithAtLeastKGreaterValues.go)   
[3761. Minimum Absolute Distance Between Mirror Pairs](./leetcode/3761-MinimumAbsoluteDistanceBetweenMirrorPairs.go)   
[3762. Minimum Operations to Equalize Subarrays](./leetcode/3762-MinimumOperationsToEqualizeSubarrays.go)   
[3763. Maximum Total Sum with Threshold Constraints](./leetcode/3763-MaximumTotalSumWithThresholdConstraints.go)   
[3766. Minimum Operations to Make Binary Palindrome](./leetcode/3766-MinimumOperationsToMakeBinaryPalindrome.go)   
[3767. Maximize Points After Choosing K Tasks](./leetcode/3767-MaximizePointsAfterChoosingKTasks.go)   
[3768. Minimum Inversion Count in Subarrays of Fixed Length](./leetcode/3768-MinimumInversionCountInSubarraysOfFixedLength.go)   
[3769. Sort Integers by Binary Reflection](./leetcode/3769-SortIntegersByBinaryReflection.go)   
[3771. Total Score of Dungeon Runs](./leetcode/3771-TotalScoreOfDungeonRuns.go)   
[3774. Absolute Difference Between Maximum and Minimum K Elements](./leetcode/3774-AbsoluteDifferenceBetweenMaximumAndMinimumKElements.go)   
[3776. Minimum Moves to Balance Circular Array](./leetcode/3776-MinimumMovesToBalanceCircularArray.go)   
[3779. Minimum Number of Operations to Have Distinct Elements](./leetcode/3779-MinimumNumberOfOperationsToHaveDistinctElements.go)   
[3780. Maximum Sum of Three Numbers Divisible by Three](./leetcode/3780-MaximumSumOfThreeNumbersDivisibleByThree.go)   
[3781. Maximum Score After Binary Swaps](./leetcode/3781-MaximumScoreAfterBinarySwaps.go)   
[3785. Minimum Swaps to Avoid Forbidden Values](./leetcode/3785-MinimumSwapsToAvoidForbiddenValues.go)   
[3788. Maximum Score of a Split](./leetcode/3788-MaximumScoreOfASplit.go)   
[3795. Minimum Subarray Length With Distinct Sum At Least K](./leetcode/3795-MinimumSubarrayLengthWithDistinctSumAtLeastK.go)   
[3796. Find Maximum Value in a Constrained Sequence](./leetcode/3796-FindMaximumValueInAConstrainedSequence.go)    
[3797. Count Routes to Climb a Rectangular Grid](./leetcode/3797-CountRoutesToClimbARectangularGrid.go)   
[3799. Word Squares II](./leetcode/3799-WordSquaresII.go)   
[3801. Minimum Cost to Merge Sorted Lists](./leetcode/3801-MinimumCostToMergeSortedLists.go)   
[3802. Number of Ways to Paint Sheets](./leetcode/3802-NumberOfWaysToPaintSheets.go)   
[3804. Number of Centered Subarrays](./leetcode/3804-NumberOfCenteredSubarrays.go)   
[3805. Count Caesar Cipher Pairs](./leetcode/3805-CountCaesarCipherPairs.go)   
[3806. Maximum Bitwise AND After Increment Operations](./leetcode/3806-MaximumBitwiseANDAfterIncrementOperations.go)   
[3809. Best Reachable Tower](./leetcode/3809-BestReachableTower.go)    
[3810. Minimum Operations to Reach Target Array](./leetcode/3810-MinimumOperationsToReachTargetArray.go)   
[3811. Number of Alternating XOR Partitions](./leetcode/3811-NumberOfAlternatingXORPartitions.go)   
[3814. Maximum Capacity Within Budget](./leetcode/3814-MaximumCapacityWithinBudget.go)   
[3818. Minimum Prefix Removal to Make Array Strictly Increasing](./leetcode/3818-MinimumPrefixRemovalToMakeArrayStrictlyIncreasing.go)   
[3819. Rotate Non Negative Elements](./leetcode/3819-RotateNonNegativeElements.go)   
[3824. Minimum K to Reduce Array Within Limit](./leetcode/3824-MinimumKToReduceArrayWithinLimit.go)   
[3825. Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND](./leetcode/3825-LongestStrictlyIncreasingSubsequenceWithNonZeroBitwiseAND.go)   
[3826. Minimum Partition Score](./leetcode/3826-MinimumPartitionScore.go)   
[3828. Final Element After Subarray Deletions](./leetcode/3828-FinalElementAfterSubarrayDeletions.go)    
[3830. Longest Alternating Subarray After Removing At Most One Element](./leetcode/3830-LongestAlternatingSubarrayAfterRemovingAtMostOneElement.go)   
[3833. Count Dominant Indices](./leetcode/3833-CountDominantIndices.go)   
[3834. Merge Adjacent Equal Elements](./leetcode/3834-MergeAdjacentEqualElements.go)   
[3835. Count Subarrays With Cost Less Than or Equal to K](./leetcode/3835-CountSubarraysWithCostLessThanOrEqualToK.go)   
[3836. Maximum Score Using Exactly K Pairs](./leetcode/3836-MaximumScoreUsingExactlyKPairs.go)   
[3837. Delayed Count of Equal Elements](./leetcode/3837-DelayedCountOfEqualElements.go)   
[3838. Weighted Word Mapping](./leetcode/3838-WeightedWordMapping.go)   
[3839. Number of Prefix Connected Groups](./leetcode/3839-NumberOfPrefixConnectedGroups.go)   
[3840. House Robber V](./leetcode/3840-HouseRobberV.go)   
[3842. Toggle Light Bulbs](./leetcode/3842-ToggleLightBulbs.go)   
[3843. First Element with Unique Frequency](./leetcode/3843-FirstElementWithUniqueFrequency.go)   
[3845. Maximum Subarray XOR with Bounded Range](./leetcode/3845-MaximumSubarrayXORWithBoundedRange.go)   
[3847. Find the Score Difference in a Game](./leetcode/3847-FindTheScoreDifferenceInAGame.go)   
[3850. Count Sequences to K](./leetcode/3850-CountSequencesToK.go)   
[3851. Maximum Requests Without Violating the Limit](./leetcode/3851-MaximumRequestsWithoutViolatingtheLimit.go)   
[3852. Smallest Pair With Different Frequencies](./leetcode/3852-SmallestPairWithDifferentFrequencies.go)   
[3854. Minimum Operations to Make Array Parity Alternating](./leetcode/3854-MinimumOperationsToMakeArrayParityAlternating.go)   
[3858. Minimum Bitwise OR From Grid](./leetcode/3858-MinimumBitwiseORFromGrid.go)   
[3859. Count Subarrays With K Distinct Integers](./leetcode/3859-CountSubarraysWithKDistinctIntegers.go)   
[3860. Unique Email Groups](./leetcode/3860-UniqueEmailGroups.go)   
[3861. Minimum Capacity Box](./leetcode/3861-MinimumCapacityBox.go)   
[3862. Find the Smallest Balanced Index](./leetcode/3862-FindTheSmallestBalancedIndex.go)   
[3865. Reverse K Subarrays](./leetcode/3865-ReverseKSubarrays.go)   
[3866. First Unique Even Element](./leetcode/3866-FirstUniqueEvenElement.go)   
[3867. Sum of GCD of Formed Pairs](./leetcode/3867-SumOfGCDOfFormedPairs.go)   
[3868. Minimum Cost to Equalize Arrays Using Swaps](./leetcode/3868-MinimumCostToEqualizeArraysUsingSwaps.go)   
[3872. Longest Arithmetic Sequence After Changing At Most One Element](./leetcode/3872-LongestArithmeticSequenceAfterChangingAtMostOneElement.go)   
[3873. Maximum Points Activated with One Addition](./leetcode/3873-MaximumPointsActivatedWithOneAddition.go)   
[3874. Valid Subarrays With Exactly One Peak](./leetcode/3874-ValidSubarraysWithExactlyOnePeak.go)   
[3875. Construct Uniform Parity Array I](./leetcode/3875-ConstructUniformParityArrayI.go)   
[3876. Construct Uniform Parity Array II](./leetcode/3876-ConstructUniformParityArrayII.go)   
[3877. Minimum Removals to Achieve Target XOR](./leetcode/3877-MinimumRemovalsToAchieveTargetXOR.go)   
[3878. Count Good Subarrays](./leetcode/3878-CountGoodSubarrays.go)   
[3880. Minimum Absolute Difference Between Two Values](./leetcode/3880-MinimumAbsoluteDifferenceBetweenTwoValues.go)   
[3882. Minimum XOR Path in a Grid](./leetcode/3882-MinimumXORPathInAGrid.go)   
[3883. Count Non Decreasing Arrays With Given Digit Sums](./leetcode/3883-CountNonDecreasingArraysWithGivenDigitSums.go)   
[3886. Sum of Sortable Integers](./leetcode/3886-SumOfSortableIntegers.go)   
[3888. Minimum Operations to Make All Grid Elements Equal](./leetcode/3888-MinimumOperationsToMakeAllGridElementsEqual.go)   
[3891. Minimum Increase to Maximize Special Indices](./leetcode/3891-MinimumIncreaseToMaximizeSpecialIndices.go)   
[3892. Minimum Operations to Achieve At Least K Peaks](./leetcode/3892-MinimumOperationsToAchieveAtLeastKPeaks.go)   
[3893. Maximum Team Size with Overlapping Intervals](./leetcode/3893-MaximumTeamSizeWithOverlappingIntervals.go)   
[3895. Count Digit Appearances](./leetcode/3895-CountDigitAppearances.go)   
[3896. Minimum Operations to Transform Array into Alternating Prime](./leetcode/3896-MinimumOperationsToTransformArrayIntoAlternatingPrime.go)   
[3897. Maximum Value of Concatenated Binary Segments](./leetcode/3897-MaximumValueOfConcatenatedBinarySegments.go)   
[3898. Find the Degree of Each Vertex](./leetcode/3898-FindDegreeOfEachVertex.go)   
[3899. Angles of a Triangle](./leetcode/3899-AnglesOfATriangle.go)   
[3901. Good Subsequence Queries](./leetcode/3901-GoodSubsequenceQueries.go)   
[3903. Smallest Stable Index I](./leetcode/3903-SmallestStableIndexI.go)   
[3904. Smallest Stable Index II](./leetcode/3904-SmallestStableIndexII.go)   
[3905. Multi Source Flood Fill](./leetcode/3905-MultiSourceFloodFill.go)   
[3907. Count Smaller Elements With Opposite Parity](./leetcode/3907-CountSmallerElementsWithOppositeParity.go)   
[3909. Compare Sums of Bitonic Parts](./leetcode/3909-CompareSumsOfBitonicParts.go)   
[3910. Count Connected Subgraphs with Even Node Sum](./leetcode/3910-CountConnectedSubgraphsWithEvenNodeSum.go)   
[3911. K-th Smallest Remaining Even Integer in Subarray Queries](./leetcode/3911-KthSmallestRemainingEvenIntegerInSubarrayQueries.go)   
[3912. Valid Elements in an Array](./leetcode/3912-ValidElementsInAnArray.go)   
[3914. Minimum Operations to Make Array Non Decreasing](./leetcode/3914-MinimumOperationsToMakeArrayNonDecreasing.go)   
[3915. Maximum Sum of Alternating Subsequence With Distance at Least K](./leetcode/3915-MaximumSumOfAlternatingSubsequenceWithDistanceAtLeastK.go)   
[3917. Count Indices With Opposite Parity](./leetcode/3917-CountIndicesWithOppositeParity.go)   
[3919. Minimum Cost to Move Between Indices](./leetcode/3919-MinimumCostToMoveBetweenIndices.go)   
[3920. Maximize Fixed Points After Deletions](./leetcode/3920-MaximizeFixedPointsAfterDeletions.go)   
[3921. Score Validator](./leetcode/3921-ScoreValidator.go)   
[3923. Minimum Generations to Target Point](./leetcode/3923-MinimumGenerationsToTargetPoint.go)   
[3925. Concatenate Array With Reverse Order](./leetcode/3925-ConcatenateArrayWithReverseOrder.go)   
[3926. Count Valid Word Occurrences](./leetcode/3926-CountValidWordOccurrences.go)   
[3927. Minimize Array Sum Using Divisible Replacements](./leetcode/3927-MinimizeArraySumUsingDivisibleReplacements.go)   
[3929. Minimum Partition Score II](./leetcode/3929-MinimumPartitionScoreII.go)   
[3930. Power Update After K-th Largest Insertion II](./leetcode/3930-PowerUpdateAfterKthLargestInsertionII.go)   
[3933. Largest Local Values in a Matrix II](./leetcode/3933-LargestLocalValuesInAMatrixII.go)   
[3934. Smallest Unique Subarray](./leetcode/3934-SmallestUniqueSubarray.go)   
[3935. Power Update After K-th Largest Insertion I](./leetcode/3935-PowerUpdateAfterKthLargestInsertionI.go)   
[3936. Minimum Swaps to Move Zeros to End](./leetcode/3936-MinimumSwapsToMoveZerosToEnd.go)   
[3937. Minimum Operations to Make Array Modulo Alternating I](./leetcode/3937-MinimumOperationsToMakeArrayModuloAlternatingI.go)   
[3938. Maximum Path Intersection Sum in a Grid](./leetcode/3938-MaximumPathIntersectionSumInAGrid.go)   
[3940. Limit Occurrences in Sorted Array](./leetcode/3940-LimitOccurrencesInSortedArray.go)   
[3942. Minimum Operations to Sort a Permutation](./leetcode/3942-MinimumOperationsToSortAPermutation.go)   
[3943. Number of Pairs After Increment](./leetcode/3943-NumberOfPairsAfterIncrement.go)   
[3944. Minimum Operations to Make Array Modulo Alternating II](./leetcode/3944-MinimumOperationsToMakeArrayModuloAlternatingII.go)   
[3946. Maximum Number of Items From Sale I](./leetcode/3946-MaximumNumberofItemsFromSaleI.go)   
[3947. Maximum Number of Items From Sale II](./leetcode/3947-MaximumNumberofItemsFromSaleII.go)   
[3948. Lexicographically Maximum MEX Array](./leetcode/3948-LexicographicallyMaximumMEXArray.go)   
[3951. Minimum Energy to Maintain Brightness](./leetcode/3951-MinimumEnergyToMaintainBrightness.go)   
[3952. Maximum Total Value of Covered Indices](./leetcode/3952-MaximumTotalValueOfCoveredIndices.go)   
[3953. Maximum Score with Co-Prime Element](./leetcode/3953-MaximumScoreWithCoPrimeElement.go)   
[3956. Maximum Sum of M Non-Overlapping Subarrays I](./leetcode/3956-MaximumSumOfMNonOverlappingSubarraysI.go)   
[3957. Maximum Sum of M Non-Overlapping Subarrays II](./leetcode/3957-MaximumSumOfMNonOverlappingSubarraysII.go)   
[3960. Frequency Balance Subarray](./leetcode/3960-FrequencyBalanceSubarray.go)   
[3961. Maximize Sum of Device Ratings](./leetcode/3961-MaximizeSumOfDeviceRatings.go)   
[3962. Maximum Subarray Sum After at Most K Swaps](./leetcode/3962-MaximumSubarraySumAfterAtMostKSwaps.go)   
[3964. Minimum Lights to Illuminate a Road](./leetcode/3964-MinimumLightsToIlluminateARoad.go)   
[3969. Valid Subarrays With Matching Sum Digits I](./leetcode/3969-ValidSubarraysWithMatchingSumDigitsI.go)   
[3971. Maximum Total Value](./leetcode/3971-MaximumTotalValue.go)   
[3972. Valid Subarrays With Matching Sum Digits II](./leetcode/3972-ValidSubarraysWithMatchingSumDigitsII.go)   
[3973. Distinct Gate Paths to LCA](./leetcode/3973-DistinctGatePathsToLCA.go)   
[3974. Maximum Total Sum of K Selected Elements](./leetcode/3974-MaximumTotalSumOfKSelectedElements.go)   
[3975. Filter Occupied Intervals](./leetcode/3975-FilterOccupiedIntervals.go)   
[3976. Maximum Subarray Sum After Multiplier](./leetcode/3976-MaximumSubarraySumAfterMultiplier.go)   
[3978. Unique Middle Element](./leetcode/3978-UniqueMiddleElement.go)   
[3979. Maximum Valid Pair Sum](./leetcode/3979-MaximumValidPairSum.go)   
[3982. Sum of Integers with Maximum Digit Range](./leetcode/3982-SumOfIntegersWithMaximumDigitRange.go)   
[3984. Divisible Game](./leetcode/3984-DivisibleGame.go)   
[3985. Palindromic Subarray Sum](./leetcode/3985-PalindromicSubarraySum.go)   
[3987. Minimum Total Cost to Process All Elements](./leetcode/3987-MinimumTotalCostToProcessAllElements.go)   
[3989. Maximum Consistent Columns in a Grid](./leetcode/3989-MaximumConsistentColumnsInAGrid.go)   
[3991. Sort Array Using Prefix Reversals](./leetcode/3991-SortArrayUsingPrefixReversals.go)   
[3996. Even Number of Knight Moves](./leetcode/3996-EvenNumberofKnightMoves.go)   
[3999. Minimum Number of String Groups Through Transformations](./leetcode/3999-MinimumNumberofStringGroupsThroughTransformations.go)   
[4001. Aggregate Two Time Series](./leetcode/4001-AggregateTwoTimeSeries.go)   
[4003. Minimum Cost Path with Alternating Directions III](./leetcode/4003-MinimumCostPathWithAlternatingDirectionsIII.go)   
[4004. Minimum Moves to Balance Circular Array II](./leetcode/4004-MinimumMovesToBalanceCircularArrayII.go)   
[4005. Minimum Operations to Make Array Equal III](./leetcode/4005-MinimumOperationsToMakeArrayEqualIII.go)   
[4007. Widest Possible Fence](./leetcode/4007-WidestPossibleFence.go)   
[4008. Minimum Initial Strength to Defeat All Monsters](./leetcode/4008-MinimumInitialStrengthToDefeatAllMonsters.go)   
[4009. Minimum Possible Maximum Waiting Time](./leetcode/4009-MinimumPossibleMaximumWaitingTime.go)   
[4010. Maximize Pair Strength Using GCD](./leetcode/4010-MaximizePairStrengthUsingGCD.go)   
[4011. Count Subarrays With Even Odd Ratio I](./leetcode/4011-CountSubarraysWithEvenOddRatioI.go)   
[4012. Count of Unfinished Tasks After Each Shift](./leetcode/4012-CountofUnfinishedTasksAfterEachShift.go)   
[4013. Count Subarrays With Even Odd Ratio II](./leetcode/4013-CountSubarraysWithEvenOddRatioII.go)   
[4014. Minimum Total Price After Applying Discounts](./leetcode/4014-MinimumTotalPriceAfterApplyingDiscounts.go)   
[4016. Maximum Area of Two Non-Overlapping Square Submatrices](./leetcode/4016-MaximumAreaOfTwoNonOverlappingSquareSubmatrices.go)   
[4017. Peaks in Array II](./leetcode/4017-PeaksInArrayII.go)   
[4020. Elevator Requests I](./leetcode/4020-ElevatorRequestsI.go)   
[4023. Elevator Requests II](./leetcode/4023-ElevatorRequestsII.go)   
[4024. Nearest Available Drone](./leetcode/4024-NearestAvailableDrone.go)   
[4025. Minimize the Maximum Waiting Time at Synchronized Traffic Lights](./leetcode/4025-MinimizeTheMaximumWaitingTimeAtSynchronizedTrafficLights.go)   
[4027. Elevator Requests III](./leetcode/4027-ElevatorRequestsIII.go)   
[4029. Elevator Requests IV](./leetcode/4029-ElevatorRequestsIV.go)   
[4031. Find All Numbers Disappeared in an Array II](./leetcode/4031-FindAllNumbersDisappearedinanAnArrayII.go)   
[4032. Longest Subarray With at Most K Distinct Prime Factors](./leetcode/4032-LongestSubarrayWithAtMostKDistinctPrimeFactors.go)   
[4033. Valid K-Unique Subarrays I](./leetcode/4033-ValidKUniqueSubarraysI.go)   
[4035. Maximum Valid Split Positions I](./leetcode/4035-MaximumValidSplitPositionsI.go)   
[4036. Lexicographically Largest String After Pair Transformations](./leetcode/4036-LexicographicallyLargestStringAfterPairTransformations.go)   
[4037. Maximum Valid Split Positions II](./leetcode/4037-MaximumValidSplitPositionsII.go)   
[4038. Count Integers Appearing in a Single Block](./leetcode/4038-CountIntegersAppearinginaASingleBlock.go)   
[4039. Sum of Decoded Numbers](./leetcode/4039-SumOfDecodedNumbers.go)   
[4040. Minimum Operations to Form Subset Sum I](./leetcode/4040-MinimumOperationsToFormSubsetSumI.go)   
[4041. Minimum Operations to Form Subset Sum II](./leetcode/4041-MinimumOperationsToFormSubsetSumII.go)   
[4042. Valid K-Unique Subarrays II](./leetcode/4042-ValidKUniqueSubarraysII.go)   
[4044. Count Good Cyclic Rotations](./leetcode/4044-CountGoodCyclicRotations.go)   
[4045. Count Robot Groups](./leetcode/4045-CountRobotGroups.go)   
[4046. Minimum Cost Path With At Most K Turns](./leetcode/4046-MinimumCostPathWithAtMostKTurns.go)   
[4047. Minimum Operations to Make XOR of All Elements Zero](./leetcode/4047-MinimumOperationsToMakeXOROfAllElementsZero.go)   
[4048. Count Values With Equally Spaced Occurrences I](./leetcode/4048-CountValuesWithEquallySpacedOccurrencesI.go)   
[4049. Count Values With Equally Spaced Occurrences II](./leetcode/4049-CountValuesWithEquallySpacedOccurrencesII.go)   
[4051. Count Subarrays with Distant Sums](./leetcode/4051-CountSubarraysWithDistantSums.go)   
[4052. Cyclically Shift Rows and Columns](./leetcode/4052-CyclicallyShiftRowsAndColumns.go)   
[4053. Minimum Operations to Make Every Element Palindromic](./leetcode/4053-MinimumOperationsToMakeEveryElementPalindromic.go)   
[4054. Count Shadow Pairs I](./leetcode/4054-CountShadowPairsI.go)   
[4055. Count Shadow Pairs II](./leetcode/4055-CountShadowPairsII.go)   

# String
[3. Longest Substring Without Repeating Characters](./leetcode/3-LongestSubstringWithoutRepeatingCharacters.go)    
[5. Longest Palindromic Substring](./leetcode/5-LongestPalindromicSubstring.go)    
[6. ZigZag Conversion](./leetcode/6-ZigZagConversion.go)    
[8. String to Integer (atoi)](./leetcode/8-StringtoInteger.go)    
[10. Regular Expression Matching](./leetcode/10-RegularExpressionMatching.go)   
[12. Integer to Roman](./leetcode/12-IntegertoRoman.go)   
[13. Roman to Integer](./leetcode/13-RomantoInteger.go)   
[14. Longest Common Prefix](./leetcode/14-LongestCommonPrefix.go)   
[17. Letter Combinations of a Phone Number](./leetcode/17-LetterCombinationsofaPhoneNumber.go)    
[20. Valid Parentheses](./leetcode/20-ValidParentheses.go)   
[22. Generate Parentheses](./leetcode/22-GenerateParentheses.go)   
[28. Implement strStr()](./leetcode/28-ImplementstrStr.go)   
[30. Substring with Concatenation of All Words](./leetcode/30-SubstringwithConcatenationofAllWords.go)    
[32. Longest Valid Parentheses](./leetcode/32-LongestValidParentheses.go)   
[38. Count and Say](./leetcode/38-CountAndSay.go)   
[43. Multiply Strings](./leetcode/43-MultiplyStrings.go)    
[44. Wildcard Matching](./leetcode/44-WildcardMatching.go)   
[49. Group Anagrams](./leetcode/49-GroupAnagrams.go)    
[58. Length of Last Word](./leetcode/58-LengthofLastWord.go)    
[65. Valid Number](./leetcode/65-ValidNumber.go)    
[67. Add Binary](./leetcode/67-AddBinary.go)    
[71. Simplify Path](./leetcode/71-SimplifyPath.go)    
[72. Edit Distance](./leetcode/72-EditDistance.go)    
[76. Minimum Window Substring](./leetcode/76-MinimumWindowSubstring.go)    
[87. Scramble String](./leetcode/87-ScrambleString.go)    
[91. Decode Ways](./leetcode/91-DecodeWays.go)    
[93. Restore IP Addresses](./leetcode/93-RestoreIPAddresses.go)    
[97. Interleaving String](./leetcode/97-InterleavingString.go)    
[115. Distinct Subsequences](./leetcode/115-DistinctSubsequences.go)    
[125. Valid Palindrome](./leetcode/125-ValidPalindrome.go)    
[126. Word Ladder II](./leetcode/126-WordLadderII.go)    
[127. Word Ladder](./leetcode/127-WordLadder.go)    
[131. Palindrome Partitioning](./leetcode/131-PalindromePartitioning.go)   
[132. Palindrome Partitioning II](./leetcode/132-PalindromePartitioningII.go)   
[139. Word Break](./leetcode/139-WordBreak.go)      
[151. Reverse Words in a String](./leetcode/151-ReverseWordsInAString.go)   
[157. Read N Characters Given Read4](./leetcode/157-ReadNCharactersGivenRead4.go)   
[158. Read N Characters Given read4 II - Call Multiple Times](./leetcode/158-ReadNCharactersGivenRead4II-CallMultipleTimes.go)   
[159. Longest Substring with At Most Two Distinct Characters](./leetcode/159-LongestSubstringWithAtMostTwoDistinctCharacters.go)   
[161. One Edit Distance](./leetcode/161-OneEditDistance.go)   
[165. Compare Version Numbers](./leetcode/165-CompareVersionNumbers.go)   
[168. Excel Sheet Column Title](./leetcode/168-ExcelSheetColumnTitle.go)   
[171. Excel Sheet Column Number](./leetcode/171-ExcelSheetColumnNumber.go)   
[179. Largest Number](./leetcode/179-LargestNumber.go)   
[186. Reverse Words in a String II](./leetcode/186-ReverseWordsInAStringII.go)   
[187. Repeated DNA Sequences](./leetcode/187-RepeatedDNASequences.go)   
[205. Isomorphic Strings](./leetcode/205-IsomorphicStrings.go)   
[214. Shortest Palindrome](./leetcode/214-ShortestPalindrome.go)   
[224. Basic Calculator](./leetcode/224-BasicCalculator.go)   
[227. Basic Calculator II](./leetcode/227-BasicCalculatorII.go)    
[241. Different Ways to Add Parentheses](./leetcode/241-DifferentWaysToAddParentheses.go)   
[242. Valid Anagram](./leetcode/242-ValidAnagram.go)   
[246. Strobogrammatic Number](./leetcode/246-StrobogrammaticNumber.go)   
[247. Strobogrammatic Number II](./leetcode/247-StrobogrammaticNumberII.go)   
[248. Strobogrammatic Number III](./leetcode/248-StrobogrammaticNumberIII.go)   
[266. Palindrome Permutation](./leetcode/266-PalindromePermutation.go)   
[267. Palindrome Permutation II](./leetcode/267-PalindromePermutationII.go)   
[282. Expression Add Operators](./leetcode/282-ExpressionAddOperators.go)   
[290. Word Pattern](./leetcode/290-WordPattern.go)   
[291. Word Pattern II](./leetcode/291-WordPatternII.go)   
[293. Flip Game](./leetcode/293-FlipGame.go)   
[294. Flip Game II](./leetcode/294-FlipGameII.go)   
[299. Bulls and Cows](./leetcode/299-BullsAndCows.go)   
[301. Remove Invalid Parentheses](./leetcode/301-RemoveInvalidParentheses.go)   
[306. Additive Number](./leetcode/306-AdditiveNumber.go)   
[315. Count of Smaller Numbers After Self](./leetcode/315-CountOfSmallerNumbersAfterSelf.go)   
[316. Remove Duplicate Letters](./leetcode/316-RemoveDuplicateLetters.go)   
[320. Generalized Abbreviation](./leetcode/320-GeneralizedAbbreviation.go)   
[331. Verify Preorder Serialization of a Binary Tree](./leetcode/331-VerifyPreorderSerializationOfABinaryTree.go)   
[340. Longest Substring with At Most K Distinct Characters](./leetcode/340-LongestSubstringWithAtMostKDistinctCharacters.go)   
[344. Reverse String](./leetcode/344-ReverseString.go)   
[345. Reverse Vowels of a String](./leetcode/345-ReverseVowelsOfAString.go)   
[358. Rearrange String k Distance Apart](./leetcode/358-RearrangeStringKDistanceApart.go)   
[383. Ransom Note](./leetcode/383-RansomNote.go)   
[385. Mini Parser](./leetcode/385-MiniParser.go)   
[387. First Unique Character in a String](./leetcode/387-FirstUniqueCharacterInAString.go)   
[388. Longest Absolute File Path](./leetcode/388-LongestAbsoluteFilePath.go)   
[389. Find the Difference](./leetcode/389-FindTheDifference.go)   
[392. Is Subsequence](./leetcode/392-IsSubsequence.go)   
[394. Decode String](./leetcode/394-DecodeString.go)   
[395. Longest Substring with At Least K Repeating Characters](./leetcode/395-LongestSubstringWithAtLeastKRepeatingCharacters.go)   
[402. Remove K Digits](./leetcode/402-RemoveKDigits.go)   
[408. Valid Word Abbreviation](./leetcode/408-ValidWordAbbreviation.go)   
[409. Longest Palindrome](./leetcode/409-LongestPalindrome.go)   
[411. Minimum Unique Word Abbreviation](./leetcode/411-MinimumUniqueWordAbbreviation.go)   
[415. Add Strings](./leetcode/415-AddStrings.go)   
[418. Sentence Screen Fitting](./leetcode/418-SentenceScreenFitting.go)   
[420. Strong Password Checker](./leetcode/420-StrongPasswordChecker.go)   
[423. Reconstruct Original Digits from English](./leetcode/423-ReconstructOriginalDigitsFromEnglish.go)   
[424. Longest Repeating Character Replacement](./leetcode/424-LongestRepeatingCharacterReplacement.go)   
[433. Minimum Genetic Mutation](./leetcode/433-MinimumGeneticMutation.go)   
[434. Number of Segments in a String](./leetcode/434-NumberOfSegmentsInAString.go)   
[438. Find All Anagrams in a String](./leetcode/438-FindAllAnagramsInAString.go)   
[439. Ternary Expression Parser](./leetcode/439-TernaryExpressionParser.go)   
[451. Sort Characters By Frequency](./leetcode/451-SortCharactersByFrequency.go)   
[459. Repeated Substring Pattern](./leetcode/459-RepeatedSubstringPattern.go)   
[466. Count The Repetitions](./leetcode/466-CountTheRepetitions.go)   
[467. Unique Substrings in Wraparound String](./leetcode/467-UniqueSubstringsInWraparoundString.go)   
[468. Validate IP Address](./leetcode/468-ValidateIPAddress.go)   
[471. Encode String with Shortest Length](./leetcode/471-EncodeStringWithShortestLength.go)   
[481. Magical String](./leetcode/481-MagicalString.go)   
[482. License Key Formatting](./leetcode/482-LicenseKeyFormatting.go)   
[483. Smallest Good Base](./leetcode/483-SmallestGoodBase.go)   
[488. Zuma Game](./leetcode/488-ZumaGame.go)   
[484. Find Permutation](./leetcode/484-FindPermutation.go)   
[514. Freedom Trail](./leetcode/514-FreedomTrail.go)   
[516. Longest Palindromic Subsequence](./leetcode/516-LongestPalindromicSubsequence.go)   
[520. Detect Capital](./leetcode/520-DetectCapital.go)   
[521. Longest Uncommon Subsequence I](./leetcode/521-LongestUncommonSubsequenceI.go)   
[524. Longest Word in Dictionary through Deleting](./leetcode/524-LongestWordInDictionaryThroughDeleting.go)   
[536. Construct Binary Tree from String](./leetcode/536-ConstructBinaryTreeFromString.go)   
[537. Complex Number Multiplication](./leetcode/537-ComplexNumberMultiplication.go)   
[541. Reverse String II](./leetcode/541-ReverseStringII.go)   
[544. Output Contest Matches](./leetcode/544-OutputContestMatches.go)   
[551. Student Attendance Record I](./leetcode/551-StudentAttendanceRecordI.go)   
[553. Optimal Division](./leetcode/553-OptimalDivision.go)   
[557. Reverse Words in a String III](./leetcode/557-ReverseWordsInAStringIII.go)   
[564. Find the Closest Palindrome](./leetcode/564-FindTheClosestPalindrome.go)   
[567. Permutation in String](./leetcode/567-PermutationInString.go)   
[583. Delete Operation for Two Strings](./leetcode/583-DeleteOperationForTwoStrings.go)   
[591. Tag Validator](./leetcode/591-TagValidator.go)   
[592. Fraction Addition and Subtraction](./leetcode/592-FractionAdditionAndSubtraction.go)   
[616. Add Bold Tag in String](./leetcode/616-AddBoldTagInString.go)   
[639. Decode Ways II](./leetcode/639-DecodeWaysII.go)   
[640. Solve the Equation](./leetcode/640-SolveTheEquation.go)   
[647. Palindromic Substrings](./leetcode/647-PalindromicSubstrings.go)   
[649. Dota2 Senate](./leetcode/649-Dota2Senate.go)   
[657. Robot Return to Origin](./leetcode/657-RobotReturnToOrigin.go)   
[664. Strange Printer](./leetcode/664-StrangePrinter.go)   
[678. Valid Parenthesis String](./leetcode/678-ValidParenthesisString.go)   
[680. Valid Palindrome II](./leetcode/680-ValidPalindromeII.go)   
[681. Next Closest Time](./leetcode/681-NextClosestTime.go)   
[686. Repeated String Match](./leetcode/686-RepeatedStringMatch.go)   
[696. Count Binary Substrings](./leetcode/696-CountBinarySubstrings.go)   
[709. To Lower Case](./leetcode/709-ToLowerCase.go)   
[712. Minimum ASCII Delete Sum for Two Strings](./leetcode/712-MinimumASCIIDeleteSumForTwoStrings.go)   
[726. Number of Atoms](./leetcode/726-NumberOfAtoms.go)   
[727. Minimum Window Subsequence](./leetcode/727-MinimumWindowSubsequence.go)   
[730. Count Different Palindromic Subsequences](./leetcode/730-CountDifferentPalindromicSubsequences.go)   
[736. Parse Lisp Expression](./leetcode/736-ParseLispExpression.go)   
[751. IP to CIDR](./leetcode/751-IPToCIDR.go)   
[756. Pyramid Transition Matrix](./leetcode/756-PyramidTransitionMatrix.go)   
[758. Bold Words in String](./leetcode/758-BoldWordsInString.go)   
[761. Special Binary String](./leetcode/761-SpecialBinaryString.go)   
[763. Partition Labels](./leetcode/763-PartitionLabels.go)   
[767. Reorganize String](./leetcode/767-ReorganizeString.go)   
[770. Basic Calculator IV](./leetcode/770-BasicCalculatorIV.go)   
[772. Basic Calculator III](./leetcode/772-BasicCalculatorIII.go)   
[777. Swap Adjacent in LR String](./leetcode/777-SwapAdjacentInLRString.go)   
[784. Letter Case Permutation](./leetcode/784-LetterCasePermutation.go)   
[791. Custom Sort String](./leetcode/791-CustomSortString.go)   
[792. Number of Matching Subsequences](./leetcode/792-NumberOfMatchingSubsequences.go)   
[796. Rotate String](./leetcode/796-RotateString.go)   
[800. Similar RGB Color](./leetcode/800-SimilarRGBColor.go)   
[809. Expressive Words](./leetcode/809-ExpressiveWords.go)   
[816. Ambiguous Coordinates](./leetcode/816-AmbiguousCoordinates.go)   
[819. Most Common Word](./leetcode/819-MostCommonWord.go)   
[821. Shortest Distance to a Character](./leetcode/821-ShortestDistanceToACharacter.go)   
[824. Goat Latin](./leetcode/824-GoatLatin.go)   
[828. Count Unique Characters of All Substrings of a Given String](./leetcode/828-CountUniqueCharactersOfAllSubstringsOfAGivenString.go)   
[830. Positions of Large Groups](./leetcode/830-PositionsOfLargeGroups.go)   
[831. Masking Personal Information](./leetcode/831-MaskingPersonalInformation.go)   
[833. Find And Replace in String](./leetcode/833-FindAndReplaceInString.go)   
[838. Push Dominoes](./leetcode/838-PushDominoes.go)   
[842. Split Array into Fibonacci Sequence](./leetcode/842-SplitArrayIntoFibonacciSequence.go)   
[844. Backspace String Compare](./leetcode/844-BackspaceStringCompare.go)   
[848. Shifting Letters](./leetcode/848-ShiftingLetters.go)   
[854. K-Similar Strings](./leetcode/854-KSimilarStrings.go)   
[856. Score of Parentheses](./leetcode/856-ScoreOfParentheses.go)   
[859. Buddy Strings](./leetcode/859-BuddyStrings.go)   
[871. Minimum Number of Refueling Stops](./leetcode/871-MinimumNumberOfRefuelingStops.go)   
[880. Decoded String at Index](./leetcode/880-DecodedStringAtIndex.go)   
[884. Uncommon Words from Two Sentences](./leetcode/884-UncommonWordsFromTwoSentences.go)   
[890. Find and Replace Pattern](./leetcode/890-FindAndReplacePattern.go)   
[899. Orderly Queue](./leetcode/899-OrderlyQueue.go)   
[903. Valid Permutations for DI Sequence](./leetcode/903-ValidPermutationsForDISequence.go)   
[906. Super Palindromes](./leetcode/906-SuperPalindromes.go)   
[917. Reverse Only Letters](./leetcode/917-ReverseOnlyLetters.go)   
[921. Minimum Add to Make Parentheses Valid](./leetcode/921-MinimumAddToMakeParenthesesValid.go)   
[925. Long Pressed Name](./leetcode/925-LongPressedName.go)   
[926. Flip String to Monotone Increasing](./leetcode/926-FlipStringToMonotoneIncreasing.go)   
[936. Stamping The Sequence](./leetcode/936-StampingTheSequence.go)   
[940. Distinct Subsequences II](./leetcode/940-DistinctSubsequencesII.go)   
[942. DI String Match](./leetcode/942-DIStringMatch.go)   
[972. Equal Rational Numbers](./leetcode/972-EqualRationalNumbers.go)   
[984. String Without AAA or BBB](./leetcode/984-StringWithoutAAAOrBBB.go)   
[1003. Check If Word Is Valid After Substitutions](./leetcode/1003-CheckIfWordIsValidAfterSubstitutions.go)   
[1016. Binary String With Substrings Representing 1 To N](./leetcode/1016-BinaryStringWithSubstringsRepresentingOneToN.go)   
[1021. Remove Outermost Parentheses](./leetcode/1021-RemoveOutermostParentheses.go)   
[1023. Camelcase Matching](./leetcode/1023-CamelcaseMatching.go)   
[1041. Robot Bounded In Circle](./leetcode/1041-RobotBoundedInCircle.go)   
[1044. Longest Duplicate Substring](./leetcode/1044-LongestDuplicateSubstring.go)   
[1047. Remove All Adjacent Duplicates In String](./leetcode/1047-RemoveAllAdjacentDuplicatesInString.go)   
[1055. Shortest Way to Form String](./leetcode/1055-ShortestWayToFormString.go)   
[1061. Lexicographically Smallest Equivalent String](./leetcode/1061-LexicographicallySmallestEquivalentString.go)   
[1062. Longest Repeating Substring](./leetcode/1062-LongestRepeatingSubstring.go)   
[1071. Greatest Common Divisor of Strings](./leetcode/1071-GreatestCommonDivisorOfStrings.go)   
[1078. Occurrences After Bigram](./leetcode/1078-OccurrencesAfterBigram.go)   
[1079. Letter Tile Possibilities](./leetcode/1079-LetterTilePossibilities.go)   
[1081. Smallest Subsequence of Distinct Characters](./leetcode/1081-SmallestSubsequenceOfDistinctCharacters.go)   
[1087. Brace Expansion](./leetcode/1087-BraceExpansion.go)   
[1092. Shortest Common Supersequence](./leetcode/1092-ShortestCommonSupersequence.go)   
[1096. Brace Expansion II](./leetcode/1096-BraceExpansionII.go)   
[1100. Find K-Length Substrings With No Repeated Characters](./leetcode/1100-FindKLengthSubstringsWithNoRepeatedCharacters.go)   
[1106. Parsing A Boolean Expression](./leetcode/1106-ParsingABooleanExpression.go)   
[1108. Defanging an IP Address](./leetcode/1108-DefangingAnIPAddress.go)   
[1111. Maximum Nesting Depth of Two Valid Parentheses Strings](./leetcode/1111-MaximumNestingDepthOfTwoValidParenthesesStrings.go)   
[1119. Remove Vowels from a String](./leetcode/1119-RemoveVowelsFromAString.go)   
[1138. Alphabet Board Path](./leetcode/1138-AlphabetBoardPath.go)   
[1143. Longest Common Subsequence](./leetcode/1143-LongestCommonSubsequence.go)   
[1147. Longest Chunked Palindrome Decomposition](./leetcode/1147-LongestChunkedPalindromeDecomposition.go)   
[1153. String Transforms Into Another String](./leetcode/1153-StringTransformsIntoAnotherString.go)   
[1154. Day of the Year](./leetcode/1154-DayOfTheYear.go)   
[1156. Swap For Longest Repeated Character Substring](./leetcode/1156-SwapForLongestRepeatedCharacterSubstring.go)   
[1163. Last Substring in Lexicographical Order](./leetcode/1163-LastSubstringInLexicographicalOrder.go)   
[1165. Single-Row Keyboard](./leetcode/1165-Single-RowKeyboard.go)   
[1177. Can Make Palindrome from Substring](./leetcode/1177-CanMakePalindromeFromSubstring.go)   
[1180. Count Substrings with Only One Distinct Letter](./leetcode/1180-CountSubstringsWithOnlyOneDistinctLetter.go)   
[1189. Maximum Number of Balloons](./leetcode/1189-MaximumNumberOfBalloons.go)   
[1190. Reverse Substrings Between Each Pair of Parentheses](./leetcode/1190-ReverseSubstringsBetweenEachPairOfParentheses.go)   
[1202. Smallest String With Swaps](./leetcode/1202-SmallestStringWithSwaps.go)   
[1208. Get Equal Substrings Within Budget](./leetcode/1208-GetEqualSubstringsWithinBudget.go)   
[1209. Remove All Adjacent Duplicates in String II](./leetcode/1209-RemoveAllAdjacentDuplicatesInStringII.go)   
[1216. Valid Palindrome III](./leetcode/1216-ValidPalindromeIII.go)   
[1221. Split a String in Balanced Strings](./leetcode/1221-SplitAStringInBalancedStrings.go)   
[1234. Replace the Substring for Balanced String](./leetcode/1234-ReplaceTheSubstringForBalancedString.go)   
[1236. Web Crawler](./leetcode/1236-WebCrawler.go)   
[1239. Maximum Length of a Concatenated String with Unique Characters](./leetcode/1239-MaximumLengthOfAConcatenatedStringWithUniqueCharacters.go)   
[1247. Minimum Swaps to Make Strings Equal](./leetcode/1247-MinimumSwapsToMakeStringsEqual.go)   
[1249. Minimum Remove to Make Valid Parentheses](./leetcode/1249-MinimumRemoveToMakeValidParentheses.go)   
[1257. Smallest Common Region](./leetcode/1257-SmallestCommonRegion.go)   
[1258. Synonymous Sentences](./leetcode/1258-SynonymousSentences.go)   
[1271. Hexspeak](./leetcode/1271-Hexspeak.go)   
[1278. Palindrome Partitioning III](./leetcode/1278-PalindromePartitioningIII.go)   
[1297. Maximum Number of Occurrences of a Substring](./leetcode/1297-MaximumNumberOfOccurrencesOfASubstring.go)   
[1309. Decrypt String from Alphabet to Integer Mapping](./leetcode/1309-DecryptStringFromAlphabetToIntegerMapping.go)   
[1312. Minimum Insertion Steps to Make a String Palindrome](./leetcode/1312-MinimumInsertionStepsToMakeAStringPalindrome.go)   
[1316. Distinct Echo Substrings](./leetcode/1316-DistinctEchoSubstrings.go)   
[1320. Minimum Distance to Type a Word Using Two Fingers](./leetcode/1320-MinimumDistanceToTypeAWordUsingTwoFingers.go)   
[1324. Print Words Vertically](./leetcode/1324-PrintWordsVertically.go)   
[1328. Break a Palindrome](./leetcode/1328-BreakAPalindrome.go)   
[1332. Remove Palindromic Subsequences](./leetcode/1332-RemovePalindromicSubsequences.go)   
[1347. Minimum Number of Steps to Make Two Strings Anagram](./leetcode/1347-MinimumNumberOfStepsToMakeTwoStringsAnagram.go)   
[1358. Number of Substrings Containing All Three Characters](./leetcode/1358-NumberOfSubstringsContainingAllThreeCharacters.go)   
[1360. Number of Days Between Two Dates](./leetcode/1360-NumberOfDaysBetweenTwoDates.go)   
[1370. Increasing Decreasing String](./leetcode/1370-IncreasingDecreasingString.go)   
[1371. Find the Longest Substring Containing Vowels in Even Counts](./leetcode/1371-FindTheLongestSubstringContainingVowelsTnEvenCounts.go)   
[1374. Generate a String With Characters That Have Odd Counts](./leetcode/1374-GenerateAStringWithCharactersThatHaveOddCounts.go)   
[1392. Longest Happy Prefix](./leetcode/1392-LongestHappyPrefix.go)   
[1397. Find All Good Strings](./leetcode/1397-FindAllGoodStrings.go)   
[1400. Construct K Palindrome Strings](./leetcode/1400-ConstructKPalindromeStrings.go)   
[1404. Number of Steps to Reduce a Number in Binary Representation to One](./leetcode/1404-NumberOfStepsToReduceANumberInBinaryRepresentationToOne.go)   
[1405. Longest Happy String](./leetcode/1405-LongestHappyString.go)   
[1410. HTML Entity Parser](./leetcode/1410-HTMLEntityParser.go)   
[1415. The k-th Lexicographical String of All Happy Strings of Length n](./leetcode/1415-TheKthLexicographicalStringOfAllHappyStringsOfLengthN.go)   
[1416. Restore The Array](./leetcode/1416-RestoreTheArray.go)   
[1417. Reformat The String](./leetcode/1417-ReformatTheString.go)   
[1419. Minimum Number of Frogs Croaking](./leetcode/1419-MinimumNumberOfFrogsCroaking.go)   
[1422. Maximum Score After Splitting a String](./leetcode/1422-MaximumScoreAfterSplittingAString.go)    
[1427. Perform String Shifts](./leetcode/1427-PerformStringShifts.go)   
[1433. Check If a String Can Break Another String](./leetcode/1433-CheckIfAStringCanBreakAnotherString.go)   
[1446. Consecutive Characters](./leetcode/1446-ConsecutiveCharacters.go)   
[1451. Rearrange Words in a Sentence](./leetcode/1451-RearrangeWordsInASentence.go)   
[1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](./leetcode/1455-CheckIfAWordOccursAsAPrefixOfAnyWordInASentence.go)   
[1456. Maximum Number of Vowels in a Substring of Given Length](./leetcode/1456-MaximumNumberOfVowelsInASubstringOfGivenLength.go)   
[1461. Check If a String Contains All Binary Codes of Size K](./leetcode/1461-CheckIfAStringContainsAllBinaryCodesOfSizeK.go)   
[1496. Path Crossing](./leetcode/1496-PathCrossing.go)   
[1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits](./leetcode/1505-MinimumPossibleIntegerAfterAtMostKAdjacentSwapsOnDigits.go)   
[1507. Reformat Date](./leetcode/1507-ReformatDate.go)   
[1513. Number of Substrings With Only 1s](./leetcode/1513-NumberOfSubstringsWithOnlyOnes.go)   
[1520. Maximum Number of Non-Overlapping Substrings](./leetcode/1520-MaximumNumberOfNonOverlappingSubstrings.go)   
[1525. Number of Good Ways to Split a String](./leetcode/1525-NumberOfGoodWaysToSplitAString.go)   
[1528. Shuffle String](./leetcode/1528-ShuffleString.go)   
[1529. Minimum Suffix Flips](./leetcode/1529-MinimumSuffixFlips.go)   
[1531. String Compression II](./leetcode/1531-StringCompressionII.go)   
[1540. Can Convert String in K Moves](./leetcode/1540-CanConvertStringInKMoves.go)   
[1541. Minimum Insertions to Balance a Parentheses String](./leetcode/1541-MinimumInsertionsToBalanceAParenthesesString.go)   
[1542. Find Longest Awesome Substring](./leetcode/1542-FindLongestAwesomeSubstring.go)   
[1544. Make The String Great](./leetcode/1544-MakeTheStringGreat.go)   
[1545. Find Kth Bit in Nth Binary String](./leetcode/1545-FindKthBitInNthBinaryString.go)   
[1573. Number of Ways to Split a String](./leetcode/1573-NumberOfWaysToSplitAString.go)   
[1576. Replace All ?'s to Avoid Consecutive Repeating Characters](./leetcode/1576-ReplaceAllQuestionMarksToAvoidConsecutiveRepeatingCharacters.go)   
[1585. Check If String Is Transformable With Substring Sort Operations](./leetcode/1585-CheckIfStringIsTransformableWithSubstringSortOperations.go)   
[1592. Rearrange Spaces Between Words](./leetcode/1592-RearrangeSpacesBetweenWords.go)   
[1593. Split a String Into the Max Number of Unique Substrings](./leetcode/1593-SplitAStringIntoTheMaxNumberOfUniqueSubstrings.go)   
[1556. Thousand Separator](./leetcode/1556-ThousandSeparator.go)   
[1597. Build Binary Expression Tree From Infix Expression](./leetcode/1597-BuildBinaryExpressionTreeFromInfixExpression.go)   
[1598. Crawler Log Folder](./leetcode/1598-CrawlerLogFolder.go)   
[1614. Maximum Nesting Depth of the Parentheses](./leetcode/1614-MaximumNestingDepthOfTheParentheses.go)   
[1616. Split Two Strings to Make Palindrome](./leetcode/1616-SplitTwoStringsToMakePalindrome.go)   
[1618. Maximum Font to Fit a Sentence in a Screen](./leetcode/1618-MaximumFontToFitASentenceInAScreen.go)   
[1624. Largest Substring Between Two Equal Characters](./leetcode/1624-LargestSubstringBetweenTwoEqualCharacters.go)  
[1625. Lexicographically Smallest String After Applying Operations](./leetcode/1625-LexicographicallySmallestStringAfterApplyingOperations.go)   
[1638. Count Substrings That Differ by One Character](./leetcode/1638-CountSubstringsThatDifferByOneCharacter.go)   
[1647. Minimum Deletions to Make Character Frequencies Unique](./leetcode/1647-MinimumDeletionsToMakeCharacterFrequenciesUnique.go)   
[1653. Minimum Deletions to Make String Balanced](./leetcode/1653-MinimumDeletionsToMakeStringBalanced.go)   
[1657. Determine if Two Strings Are Close](./leetcode/1657-DetermineIfTwoStringsAreClose.go)   
[1663. Smallest String With A Given Numeric Value](./leetcode/1663-SmallestStringWithAGivenNumericValue.go)   
[1668. Maximum Repeating Substring](./leetcode/1668-MaximumRepeatingSubstring.go)   
[1678. Goal Parser Interpretation](./leetcode/1678-GoalParserInterpretation.go)   
[1682. Longest Palindromic Subsequence II](./leetcode/1682-LongestPalindromicSubsequenceII.go)   
[1684. Count the Number of Consistent Strings](./leetcode/1684-CountTheNumberOfConsistentStrings.go)   
[1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](./leetcode/1689-PartitioningIntoMinimumNumberOfDeciBinaryNumbers.go)   
[1694. Reformat Phone Number](./leetcode/1694-ReformatPhoneNumber.go)   
[1698. Number of Distinct Substrings in a String](./leetcode/1698-NumberOfDistinctSubstringsInAString.go)   
[1702. Maximum Binary String After Change](./leetcode/1702-MaximumBinaryStringAfterChange.go)   
[1704. Determine if String Halves Are Alike](./leetcode/1704-DetermineIfStringHalvesAreAlike.go)   
[1717. Maximum Score From Removing Substrings](./leetcode/1717-MaximumScoreFromRemovingSubstrings.go)   
[1736. Latest Time by Replacing Hidden Digits](./leetcode/1736-LatestTimeByReplacingHiddenDigits.go)   
[1737. Change Minimum Characters to Satisfy One of Three Conditions](./leetcode/1737-ChangeMinimumCharactersToSatisfyOneOfThreeConditions.go)   
[1745. Palindrome Partitioning IV](./leetcode/1745-PalindromePartitioningIV.go)   
[1750. Minimum Length of String After Deleting Similar Ends](./leetcode/1750-MinimumLengthOfStringAfterDeletingSimilarEnds.go)    
[1754. Largest Merge Of Two Strings](./leetcode/1754-LargestMergeOfTwoStrings.go)   
[1758. Minimum Changes To Make Alternating Binary String](./leetcode/1758-MinimumChangesToMakeAlternatingBinaryString.go)   
[1759. Count Number of Homogenous Substrings](./leetcode/1759-CountNumberOfHomogenousSubstrings.go)   
[1763. Longest Nice Substring](./leetcode/1763-LongestNiceSubstring.go)   
[1768. Merge Strings Alternately](./leetcode/1768-MergeStringsAlternately.go)   
[1769. Minimum Number of Operations to Move All Balls to Each Box](./leetcode/1769-MinimumNumberOfOperationsToMoveAllBallsToEachBox.go)   
[1771. Maximize Palindrome Length From Subsequences](./leetcode/1771-MaximizePalindromeLengthFromSubsequences.go)   
[1781. Sum of Beauty of All Substrings](./leetcode/1781-SumOfBeautyOfAllSubstrings.go)   
[1784. Check if Binary String Has at Most One Segment of Ones](./leetcode/1784-CheckIfBinaryStringHasAtMostOneSegmentOfOnes.go)   
[1794. Count Pairs of Equal Substrings With Minimum Difference](./leetcode/1794-CountPairsOfEqualSubstringsWithMinimumDifference.go)   
[1796. Second Largest Digit in a String](./leetcode/1796-SecondLargestDigitInAString.go)   
[1790. Check if One String Swap Can Make Strings Equal](./leetcode/1790-CheckIfOneStringSwapCanMakeStringsEqual.go)   
[1805. Number of Different Integers in a String](./leetcode/1805-NumberOfDifferentIntegersInAString.go)   
[1807. Evaluate the Bracket Pairs of a String](./leetcode/1807-EvaluateTheBracketPairsOfAString.go)   
[1813. Sentence Similarity III](./leetcode/1813-SentenceSimilarityIII.go)   
[1816. Truncate Sentence](./leetcode/1816-TruncateSentence.go)   
[1830. Minimum Number of Operations to Make String Sorted](./leetcode/1830-MinimumNumberOfOperationsToMakeStringSorted.go)   
[1832. Check if the Sentence Is Pangram](./leetcode/1832-CheckIfTheSentenceIsPangram.go)   
[1839. Longest Substring Of All Vowels in Order](./leetcode/1839-LongestSubstringOfAllVowelsInOrder.go)   
[1842. Next Palindrome Using Same Digits](./leetcode/1842-NextPalindromeUsingSameDigits.go)   
[1844. Replace All Digits with Characters](./leetcode/1844-ReplaceAllDigitsWithCharacters.go)   
[1849. Splitting a String Into Descending Consecutive Values](./leetcode/1849-SplittingAStringIntoDescendingConsecutiveValues.go)   
[1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](./leetcode/1850-MinimumAdjacentSwapsToReachTheKthSmallestNumber.go)   
[1859. Sorting the Sentence](./leetcode/1859-SortingTheSentence.go)   
[1864. Minimum Number of Swaps to Make the Binary String Alternating](./leetcode/1864-MinimumNumberOfSwapsToMakeTheBinaryStringAlternating.go)   
[1869. Longer Contiguous Segments of Ones than Zeros](./leetcode/1869-LongerContiguousSegmentsOfOnesThanZeros.go)   
[1871. Jump Game VII](./leetcode/1871-JumpGameVII.go)   
[1876. Substrings of Size Three with Distinct Characters](./leetcode/1876-SubstringsOfSizeThreeWithDistinctCharacters.go)   
[1880. Check if Word Equals Summation of Two Words](./leetcode/1880-CheckIfWordEqualsSummationOfTwoWords.go)   
[1881. Maximum Value after Insertion](./leetcode/1881-MaximumValueAfterInsertion.go)   
[1888. Minimum Number of Flips to Make the Binary String Alternating](./leetcode/1888-MinimumNumberOfFlipsToMakeTheBinaryStringAlternating.go)   
[1896. Minimum Cost to Change the Final Value of Expression](./leetcode/1896-MinimumCostToChangeTheFinalValueOfExpression.go)   
[1898. Maximum Number of Removable Characters](./leetcode/1898-MaximumNumberOfRemovableCharacters.go)   
[1903. Largest Odd Number in String](./leetcode/1903-LargestOddNumberInString.go)   
[1904. The Number of Full Rounds You Have Played](./leetcode/1904-TheNumberOfFullRoundsYouHavePlayed.go)   
[1910. Remove All Occurrences of a Substring](./leetcode/1910-RemoveAllOccurrencesOfASubstring.go)   
[1915. Number of Wonderful Substrings](./leetcode/1915-NumberOfWonderfulSubstrings.go)   
[1927. Sum Game](./leetcode/1927-SumGame.go)   
[1930. Unique Length-3 Palindromic Subsequences](./leetcode/1930-UniqueLength3PalindromicSubsequences.go)   
[1933. Check if String Is Decomposable Into Value-Equal Substrings](./leetcode/1933-CheckIfStringIsDecomposableIntoValueEqualSubstrings.go)   
[1935. Maximum Number of Words You Can Type](./leetcode/1935-MaximumNumberOfWordsYouCanType.go)   
[1941. Check if All Characters Have Equal Number of Occurrences](./leetcode/1941-CheckIfAllCharactersHaveEqualNumberOfOccurrences.go)   
[1945. Sum of Digits of String After Convert](./leetcode/1945-SumOfDigitsOfStringAfterConvert.go)   
[1946. Largest Number After Mutating Substring](./leetcode/1946-LargestNumberAfterMutatingSubstring.go)   
[1948. Delete Duplicate Folders in System](./leetcode/1948-DeleteDuplicateFoldersInSystem.go)   
[1957. Delete Characters to Make Fancy String](./leetcode/1957-DeleteCharactersToMakeFancyString.go)   
[1960. Maximum Product of the Length of Two Palindromic Substrings](./leetcode/1960-MaximumProductOfTheLengthOfTwoPalindromicSubstrings.go)   
[1961. Check If String Is a Prefix of Array](./leetcode/1961-CheckIfStringIsAPrefixOfArray.go)   
[1963. Minimum Number of Swaps to Make the String Balanced](./leetcode/1963-MinimumNumberOfSwapsToMakeTheStringBalanced.go)   
[1967. Number of Strings That Appear as Substrings in Word](./leetcode/1967-NumberOfStringsThatAppearAsSubstringsInWord.go)   
[1974. Minimum Time to Type Word Using Special Typewriter](./leetcode/1974-MinimumTimeToTypeWordUsingSpecialTypewriter.go)   
[1977. Number of Ways to Separate Numbers](./leetcode/1977-NumberOfWaysToSeparateNumbers.go)   
[1987. Number of Unique Good Subsequences](./leetcode/1987-NumberOfUniqueGoodSubsequences.go)   
[2000. Reverse Prefix of Word](./leetcode/2000-ReversePrefixOfWord.go)   
[2002. Maximum Product of the Length of Two Palindromic Subsequences](./leetcode/2002-MaximumProductOfTheLengthOfTwoPalindromicSubsequences.go)   
[2014. Longest Subsequence Repeated k Times](./leetcode/2014-LongestSubsequenceRepeatedKTimes.go)   
[2019. The Score of Students Solving Math Expression](./leetcode/2019-TheScoreOfStudentsSolvingMathExpression.go)   
[2024. Maximize the Confusion of an Exam](./leetcode/2024-MaximizeTheConfusionOfAnExam.go)   
[2027. Minimum Moves to Convert String](./leetcode/2027-MinimumMovesToConvertString.go)   
[2030. Smallest K-Length Subsequence With Occurrences of a Letter](./leetcode/2030-SmallestKLengthSubsequenceWithOccurrencesOfALetter.go)   
[2038. Remove Colored Pieces if Both Neighbors are the Same Color](./leetcode/2038-RemoveColoredPiecesIfBothNeighborsAreTheSameColor.go)   
[2042. Check if Numbers Are Ascending in a Sentence](./leetcode/2042-CheckIfNumbersAreAscendingInASentence.go)   
[2047. Number of Valid Words in a Sentence](./leetcode/2047-NumberOfValidWordsInASentence.go)   
[2052. Minimum Cost to Separate Sentence Into Rows](./leetcode/2052-MinimumCostToSeparateSentenceIntoRows.go)   
[2055. Plates Between Candles](./leetcode/2055-PlatesBetweenCandles.go)   
[2060. Check if an Original String Exists Given Two Encoded Strings](./leetcode/2060-CheckIfAnOriginalStringExistsGivenTwoEncodedStrings.go)   
[2062. Count Vowel Substrings of a String](./leetcode/2062-CountVowelSubstringsOfAString.go)   
[2063. Vowels of All Substrings](./leetcode/2063-VowelsOfAllSubstrings.go)   
[2067. Number of Equal Count Substrings](./leetcode/2067-NumberOfEqualCountSubstrings.go)   
[2068. Check Whether Two Strings are Almost Equivalent](./leetcode/2068-CheckWhetherTwoStringsAreAlmostEquivalent.go)   
[2075. Decode the Slanted Ciphertext](./leetcode/2075-DecodeTheSlantedCiphertext.go)   
[2083. Substrings That Begin and End With the Same Letter](./leetcode/2083-SubstringsThatBeginAndEndWithTheSameLetter.go)   
[2086. Minimum Number of Food Buckets to Feed the Hamsters](./leetcode/2086-MinimumNumberOfFoodBucketsToFeedTheHamsters.go)   
[2103. Rings and Rods](./leetcode/2103-RingsAndRods.go)   
[2109. Adding Spaces to a String](./leetcode/2109-AddingSpacesToAString.go)   
[2116. Check if a Parentheses String Can Be Valid](./leetcode/2116-CheckIfAParenthesesStringCanBeValid.go)   
[2124. Check if All A's Appears Before All B's](./leetcode/2124-CheckIfAllAsAppearsBeforeAllBs.go)   
[2129. Capitalize the Title](./leetcode/2129-CapitalizeTheTitle.go)   
[2138. Divide a String Into Groups of Size k](./leetcode/2138-DivideAStringIntoGroupsOfSizeK.go)   
[2147. Number of Ways to Divide a Long Corridor](./leetcode/2147-NumberOfWaysToDivideALongCorridor.go)   
[2156. Find Substring With Given Hash Value](./leetcode/2156-FindSubstringWithGivenHashValue.go)   
[2167. Minimum Time to Remove All Cars Containing Illegal Goods](./leetcode/2167-MinimumTimeToRemoveAllCarsContainingIllegalGoods.go)   
[2168. Unique Substrings With Equal Digit Frequency](./leetcode/2168-UniqueSubstringsWithEqualDigitFrequency.go)   
[2182. Construct String With Repeat Limit](./leetcode/2182-ConstructStringWithRepeatLimit.go)   
[2185. Counting Words With a Given Prefix](./leetcode/2185-CountingWordsWithAGivenPrefix.go)   
[2186. Minimum Number of Steps to Make Two Strings Anagram II](./leetcode/2186-MinimumNumberOfStepsToMakeTwoStringsAnagramII.go)   
[2193. Minimum Number of Moves to Make Palindrome](./leetcode/2193-MinimumNumberOfMovesToMakePalindrome.go)   
[2194. Cells in a Range on an Excel Sheet](./leetcode/2194-CellsInARangeOnAnExcelSheet.go)   
[2207. Maximize Number of Subsequences in a String](./leetcode/2207-MaximizeNumberOfSubsequencesInAString.go)   
[2209. Minimum White Tiles After Covering With Carpets](./leetcode/2209-MinimumWhiteTilesAfterCoveringWithCarpets.go)   
[2211. Count Collisions on a Road](./leetcode/2211-CountCollisionsOnARoad.go)   
[2213. Longest Substring of One Repeating Character](./leetcode/2213-LongestSubstringOfOneRepeatingCharacter.go)   
[2222. Number of Ways to Select Buildings](./leetcode/2222-NumberOfWaysToSelectBuildings.go)   
[2223. Sum of Scores of Built Strings](./leetcode/2223-SumOfScoresOfBuiltStrings.go)   
[2224. Minimum Number of Operations to Convert Time](./leetcode/2224-MinimumNumberOfOperationsToConvertTime.go)   
[2232. Minimize Result by Adding Parentheses to Expression](./leetcode/2232-MinimizeResultByAddingParenthesesToExpression.go)   
[2243. Calculate Digit Sum of a String](./leetcode/2243-CalculateDigitSumOfAString.go)   
[2259. Remove Digit From Number to Maximize Result](./leetcode/2259-RemoveDigitFromNumberToMaximizeResult.go)   
[2262. Total Appeal of A String](./leetcode/2262-TotalAppealOfAString.go)   
[2264. Largest 3-Same-Digit Number in String](./leetcode/2264-Largest3SameDigitNumberInString.go)   
[2268. Minimum Number of Keypresses](./leetcode/2268-MinimumNumberOfKeypresses.go)   
[2272. Substring With Largest Variance](./leetcode/2272-SubstringWithLargestVariance.go)   
[2278. Percentage of Letter in String](./leetcode/2278-PercentageOfLetterInString.go)   
[2283. Check if Number Has Equal Digit Count and Digit Value](./leetcode/2283-CheckIfNumberHasEqualDigitCountAndDigitValue.go)   
[2287. Rearrange Characters to Make Target String](./leetcode/2287-RearrangeCharactersToMakeTargetString.go)   
[2288. Apply Discount to Prices](./leetcode/2288-ApplyDiscountToPrices.go)   
[2299. Strong Password Checker II](./leetcode/2299-StrongPasswordCheckerII.go)   
[2301. Match Substring After Replacement](./leetcode/2301-MatchSubstringAfterReplacement.go)   
[2309. Greatest English Letter in Upper and Lower Case](./leetcode/2309-GreatestEnglishLetterInUpperAndLowerCase.go)   
[2311. Longest Binary Subsequence Less Than or Equal to K](./leetcode/2311-LongestBinarySubsequenceLessThanOrEqualToK.go)   
[2315. Count Asterisks](./leetcode/2315-CountAsterisks.go)   
[2322. Minimum Score After Removals on a Tree](./leetcode/2322-MinimumScoreAfterRemovalsOnATree.go)   
[2325. Decode the Message](./leetcode/2325-DecodeTheMessage.go)   
[2330. Valid Palindrome IV](./leetcode/2330-ValidPalindromeIV.go)   
[2337. Move Pieces to Obtain a String](./leetcode/2337-MovePiecesToObtainAString.go)   
[2351. First Letter to Appear Twice](./leetcode/2351-FirstLetterToAppearTwice.go)   
[2370. Longest Ideal Subsequence](./leetcode/2370-LongestIdealSubsequence.go)   
[2375. Construct Smallest Number From DI String](./leetcode/2375-ConstructSmallestNumberFromDIString.go)   
[2379. Minimum Recolors to Get K Consecutive Black Blocks](./leetcode/2379-MinimumRecolorsToGetKConsecutiveBlackBlocks.go)   
[2380. Time Needed to Rearrange a Binary String](./leetcode/2380-TimeNeededToRearrangeABinaryString.go)   
[2381. Shifting Letters II](./leetcode/2381-ShiftingLettersII.go)   
[2384. Largest Palindromic Number](./leetcode/2384-LargestPalindromicNumber.go)   
[2390. Removing Stars From a String](./leetcode/2390-RemovingStarsFromAString.go)   
[2399. Check Distances Between Same Letters](./leetcode/2399-CheckDistancesBetweenSameLetters.go)   
[2405. Optimal Partition of String](./leetcode/2405-OptimalPartitionOfString.go)   
[2409. Count Days Spent Together](./leetcode/2409-CountDaysSpentTogether.go)   
[2414. Length of the Longest Alphabetical Continuous Substring](./leetcode/2414-LengthOfTheLongestAlphabeticalContinuousSubstring.go)   
[2423. Remove Letter To Equalize Frequency](./leetcode/2423-RemoveLetterToEqualizeFrequency.go)   
[2430. Maximum Deletions on a String](./leetcode/2430-MaximumDeletionsOnAString.go)   
[2434. Using a Robot to Print the Lexicographically Smallest String](./leetcode/2434-UsingARobotToPrintTheLexicographicallySmallestString.go)   
[2437. Number of Valid Clock Times](./leetcode/2437-NumberOfValidClockTimes.go)   
[2450. Number of Distinct Binary Strings After Applying Operations](./leetcode/2450-NumberOfDistinctBinaryStringsAfterApplyingOperations.go)   
[2468. Split Message Based on Limit](./leetcode/2468-SplitMessageBasedOnLimit.go)   
[2472. Maximum Number of Non-overlapping Palindrome Substrings](./leetcode/2472-MaximumNumberOfNonOverlappingPalindromeSubstrings.go)   
[2478. Number of Beautiful Partitions](./leetcode/2478-NumberOfBeautifulPartitions.go)   
[2483. Minimum Penalty for a Shop](./leetcode/2483-MinimumPenaltyForAShop.go)   
[2484. Count Palindromic Subsequences](./leetcode/2484-CountPalindromicSubsequences.go)   
[2486. Append Characters to String to Make Subsequence](./leetcode/2486-AppendCharactersToStringToMakeSubsequence.go)   
[2489. Number of Substrings With Fixed Ratio](./leetcode/2489-NumberOfSubstringsWithFixedRatio.go)   
[2490. Circular Sentence](./leetcode/2490-CircularSentence.go)   
[2491. Divide Players Into Teams of Equal Skill](./leetcode/2491-DividePlayersIntoTeamsOfEqualSkill.go)   
[2514. Count Anagrams](./leetcode/2514-CountAnagrams.go)   
[2516. Take K of Each Character From Left and Right](./leetcode/2516-TakeKOfEachCharacterFromLeftAndRight.go)   
[2522. Partition String Into Substrings With Values at Most K](./leetcode/2522-PartitionStringIntoSubstringsWithValuesAtMostK.go)   
[2531. Make Number of Distinct Characters Equal](./leetcode/2531-MakeNumberOfDistinctCharactersEqual.go)   
[2539. Count the Number of Good Subsequences](./leetcode/2539-CountTheNumberOfGoodSubsequences.go)   
[2546. Apply Bitwise Operations to Make Strings Equal](./leetcode/2546-ApplyBitwiseOperationsToMakeStringsEqual.go)   
[2564. Substring XOR Queries](./leetcode/2564-SubstringXORQuerie2s.go)   
[2565. Subsequence With the Minimum Score](./leetcode/2565-SubsequenceWithTheMinimumScore.go)   
[2573. Find the String with LCP](./leetcode/2573-FindTheStringWithLCP.go)   
[2575. Find the Divisibility Array of a String](./leetcode/2575-FindTheDivisibilityArrayOfAString.go)   
[2586. Count the Number of Vowel Strings in Range](./leetcode/2586-CountTheNumberOfVowelStringsInRange.go)   
[2606. Find the Substring With Maximum Cost](./leetcode/2606-FindTheSubstringWithMaximumCost.go)   
[2609. Find the Longest Balanced Substring of a Binary String](./leetcode/2609-FindTheLongestBalancedSubstringOfABinaryString.go)   
[2645. Minimum Additions to Make Valid String](./leetcode/2645-MinimumAdditionsToMakeValidString.go)   
[2663. Lexicographically Smallest Beautiful String](./leetcode/2663-LexicographicallySmallestBeautifulString.go)   
[2696. Minimum String Length After Removing Substrings](./leetcode/2696-MinimumStringLengthAfterRemovingSubstrings.go)   
[2697. Lexicographically Smallest Palindrome](./leetcode/2697-LexicographicallySmallestPalindrome.go)   
[2707. Extra Characters in a String](./leetcode/2707-ExtraCharactersInAString.go)   
[2710. Remove Trailing Zeros From a String](./leetcode/2710-RemoveTrailingZerosFromAString.go)   
[2712. Minimum Cost to Make All Characters Equal](./leetcode/2712-MinimumCostToMakeAllCharactersEqual.go)   
[2716. Minimize String Length](./leetcode/2716-MinimizeStringLength.go)   
[2719. Count of Integers](./leetcode/2719-CountOfIntegers.go)   
[2730. Find the Longest Semi-Repetitive Substring](./leetcode/2730-FindTheLongestSemiRepetitiveSubstring.go)   
[2734. Lexicographically Smallest String After Substring Operation](./leetcode/2734-LexicographicallySmallestStringAfterSubstringOperation.go)   
[2743. Count Substrings Without Repeating Character](./leetcode/2743-CountSubstringsWithoutRepeatingCharacter.go)   
[2767. Partition String Into Minimum Beautiful Substrings](./leetcode/2767-PartitionStringIntoMinimumBeautifulSubstrings.go)   
[2781. Length of the Longest Valid Substring](./leetcode/2781-LengthOfTheLongestValidSubstring.go)   
[2785. Sort Vowels in a String](./leetcode/2785-SortVowelsInAString.go)   
[2800. Shortest String That Contains Three Strings](./leetcode/2800-ShortestStringThatContainsThreeStrings.go)   
[2801. Count Stepping Numbers in Range](./leetcode/2801-CountSteppingNumbersInRange.go)   
[2810. Faulty Keyboard](./leetcode/2810-FaultyKeyboard.go)   
[2825. Make String a Subsequence Using Cyclic Increments](./leetcode/2825-MakeStringASubsequenceUsingCyclicIncrements.go)   
[2828. Check if a String Is an Acronym of Words](./leetcode/2828-CheckIfAStringIsAnAcronymOfWords.go)   
[2833. Furthest Point From Origin](./leetcode/2833-FurthestPointFromOrigin.go)   
[2839. Check if Strings Can be Made Equal With Operations I](./leetcode/2839-CheckIfStringsCanBeMadeEqualWithOperationsI.go)   
[2840. Check if Strings Can be Made Equal With Operations II](./leetcode/2840-CheckIfStringsCanBeMadeEqualWithOperationsII.go)   
[2842. Count K-Subsequences of a String With Maximum Beauty](./leetcode/2842-CountKSubsequencesOfAStringWithMaximumBeauty.go)   
[2844. Minimum Operations to Make a Special Number](./leetcode/2844-MinimumOperationsToMakeASpecialNumber.go)   
[2864. Maximum Odd Binary Number](./leetcode/2864-MaximumOddBinaryNumber.go)   
[2851. String Transformation](./leetcode/2851-StringTransformation.go)   
[2896. Apply Operations to Make Two Strings Equal](./leetcode/2896-ApplyOperationsToMakeTwoStringsEqual.go)   
[2904. Shortest and Lexicographically Smallest Beautiful String](./leetcode/2904-ShortestAndLexicographicallySmallestBeautifulString.go)   
[2911. Minimum Changes to Make K Semi-palindromes](./leetcode/2911-MinimumChangesToMakeKSemiPalindromes.go)   
[2914. Minimum Number of Changes to Make Binary String Beautiful](./leetcode/2914-MinimumNumberOfChangesToMakeBinaryStringBeautiful.go)   
[2937. Make Three Strings Equal](./leetcode/2937-MakeThreeStringsEqual.go)   
[2938. Separate Black and White Balls](./leetcode/2938-SeparateBlackAndWhiteBalls.go)   
[2942. Find Words Containing Character](./leetcode/2942-FindWordsContainingCharacter.go)   
[2947. Count Beautiful Substrings I](./leetcode/2947-CountBeautifulSubstringsI.go)   
[2949. Count Beautiful Substrings II](./leetcode/2949-CountBeautifulSubstringsII.go)   
[2950. Number of Divisible Substrings](./leetcode/2950-NumberOfDivisibleSubstrings.go)   
[2953. Count Complete Substrings](./leetcode/2953-CountCompleteSubstrings.go)   
[2955. Number of Same-End Substrings](./leetcode/2955-NumberOfSameEndSubstrings.go)   
[2957. Remove Adjacent Almost-Equal Characters](./leetcode/2957-RemoveAdjacentAlmostEqualCharacters.go)   
[2976. Minimum Cost to Convert String I](./leetcode/2976-MinimumCostToConvertStringI.go)   
[2977. Minimum Cost to Convert String II](./leetcode/2977-MinimumCostToConvertStringII.go)   
[2981. Find Longest Special Substring That Occurs Thrice I](./leetcode/2981-FindLongestSpecialSubstringThatOccursThriceI.go)   
[2982. Find Longest Special Substring That Occurs Thrice II](./leetcode/2982-FindLongestSpecialSubstringThatOccursThriceII.go)   
[2983. Palindrome Rearrangement Queries](./leetcode/2983-PalindromeRearrangementQueries.go)   
[3003. Maximize the Number of Partitions After Operations](./leetcode/3003-MaximizeTheNumberOfPartitionsAfterOperations.go)   
[3006. Find Beautiful Indices in the Given Array I](./leetcode/3006-FindBeautifulIndicesInTheGivenArrayI.go)   
[3008. Find Beautiful Indices in the Given Array II](./leetcode/3008-FindBeautifulIndicesInTheGivenArrayII.go)   
[3014. Minimum Number of Pushes to Type Word I](./leetcode/3014-MinimumNumberOfPushesToTypeWordI.go)   
[3016. Minimum Number of Pushes to Type Word II](./leetcode/3016-MinimumNumberOfPushesToTypeWordII.go)   
[3019. Number of Changing Keys](./leetcode/3019-NumberOfChangingKeys.go)   
[3029. Minimum Time to Revert Word to Initial State I](./leetcode/3029-MinimumTimeToRevertWordToInitialStateI.go)   
[3031. Minimum Time to Revert Word to Initial State II](./leetcode/3031-MinimumTimeToRevertWordToInitialStateII.go)   
[3039. Apply Operations to Make String Empty](./leetcode/3039-ApplyOperationsToMakeStringEmpty.go)   
[3081. Replace Question Marks in String to Minimize Its Value](./leetcode/3081-ReplaceQuestionMarksInStringToMinimizeItsValue.go)   
[3083. Existence of a Substring in a String and Its Reverse](./leetcode/3083-ExistenceOfASubstringInAStringAndItsReverse.go)   
[3084. Count Substrings Starting and Ending with Given Character](./leetcode/3084-CountSubstringsStartingAndEndingWithGivenCharacter.go)   
[3085. Minimum Deletions to Make String K-Special](./leetcode/3085-MinimumDeletionsToMakeStringKSpecial.go)   
[3088. Make String Anti-palindrome](./leetcode/3088-MakeStringAntiPalindrome.go)   
[3090. Maximum Length Substring With Two Occurrences](./leetcode/3090-MaximumLengthSubstringWithTwoOccurrences.go)   
[3104. Find Longest Self-Contained Substring](./leetcode/3104-FindLongestSelfContainedSubstring.go)   
[3106. Lexicographically Smallest String After Operations With Constraint](./leetcode/3106-LexicographicallySmallestStringAfterOperationsWithConstraint.go)   
[3110. Score of a String](./leetcode/3110-ScoreOfAString.go)   
[3114. Latest Time You Can Obtain After Replacing Characters](./leetcode/3114-LatestTimeYouCanObtainAfterReplacingCharacters.go)   
[3119. Maximum Number of Potholes That Can Be Fixed](./leetcode/3119-MaximumNumberOfPotholesThatCanBeFixed.go)   
[3120. Count the Number of Special Characters I](./leetcode/3120-CountTheNumberOfSpecialCharactersI.go)   
[3121. Count the Number of Special Characters II](./leetcode/3121-CountTheNumberOfSpecialCharactersII.go)   
[3125. Maximum Number That Makes Result of Bitwise AND Zero](./leetcode/3125-MaximumNumberThatMakesResultOfBitwiseANDZero.go)   
[3135. Equalize Strings by Adding or Removing Characters at Ends](./leetcode/3135-EqualizeStringsByAddingOrRemovingCharactersAtEnds.go)   
[3136. Valid Word](./leetcode/3136-ValidWord.go)   
[3137. Minimum Number of Operations to Make Word K-Periodic](./leetcode/3137-MinimumNumberOfOperationsToMakeWordKPeriodic.go)   
[3138. Minimum Length of Anagram Concatenation](./leetcode/3138-MinimumLengthOfAnagramConcatenation.go)   
[3144. Minimum Substring Partition of Equal Character](./leetcode/3144-MinimumSubstringPartitionOfEqualCharacter.go)   
[3146. Permutation Difference between Two Strings](./leetcode/3146-PermutationDifferenceBetweenTwoStrings.go)   
[3163. String Compression III](./leetcode/3163-StringCompressionIII.go)   
[3167. Better Compression of String](./leetcode/3167-BetterCompressionOfString.go)   
[3168. Minimum Number of Chairs in a Waiting Room](./leetcode/3168-MinimumNumberOfChairsInAWaitingRoom.go)   
[3170. Lexicographically Minimum String After Removing Stars](./leetcode/3170-LexicographicallyMinimumStringAfterRemovingStars.go)   
[3174. Clear Digits](./leetcode/3174-ClearDigits.go)   
[3210. Find the Encrypted String](./leetcode/3210-FindTheEncryptedString.go)   
[3213. Construct String with Minimum Cost](./leetcode/3213-ConstructStringWithMinimumCost.go)   
[3216. Lexicographically Smallest String After a Swap](./leetcode/3216-LexicographicallySmallestStringAfterASwap.go)   
[3223. Minimum Length of String After Operations](./leetcode/3223-MinimumLengthOfStringAfterOperations.go)   
[3227. Vowels Game in a String](./leetcode/3227-VowelsGameInAString.go)   
[3228. Maximum Number of Operations to Move Ones to the End](./leetcode/3228-MaximumNumberOfOperationsToMoveOnesToTheEnd.go)   
[3234. Count the Number of Substrings With Dominant Ones](./leetcode/3234-CountTheNumberOfSubstringsWithDominantOnes.go)   
[3253. Construct String with Minimum Cost (Easy)](./leetcode/3253-ConstructStringWithMinimumCost-Easy.go)   
[3258. Count Substrings That Satisfy K-Constraint I](./leetcode/3258-CountSubstringsThatSatisfyKConstraintI.go)   
[3261. Count Substrings That Satisfy K-Constraint II](./leetcode/3261-CountSubstringsThatSatisfyKConstraintII.go)   
[3271. Hash Divided String](./leetcode/3271-HashDividedString.go)   
[3274. Check if Two Chessboard Squares Have the Same Color](./leetcode/3274-CheckIfTwoChessboardSquaresHaveTheSameColor.go)   
[3280. Convert Date to Binary](./leetcode/3280-ConvertDateToBinary.go)   
[3291. Minimum Number of Valid Strings to Form Target I](./leetcode/3291-MinimumNumberOfValidStringsToFormTargetI.go)   
[3292. Minimum Number of Valid Strings to Form Target II](./leetcode/3292-MinimumNumberOfValidStringsToFormTargetII.go)   
[3297. Count Substrings That Can Be Rearranged to Contain a String I](./leetcode/3297-CountSubstringsThatCanBeRearrangedToContainAStringI.go)   
[3298. Count Substrings That Can Be Rearranged to Contain a String II](./leetcode/3298-CountSubstringsThatCanBeRearrangedToContainAStringII.go)   
[3302. Find the Lexicographically Smallest Valid Sequence](./leetcode/3302-FindTheLexicographicallySmallestValidSequence.go)   
[3303. Find the Occurrence of First Almost Equal Substring](./leetcode/3303-FindTheOccurrenceOfFirstAlmostEqualSubstring.go)   
[3305. Count of Substrings Containing Every Vowel and K Consonants I](./leetcode/3305-CountOfSubstringsContainingEveryVowelAndKConsonantsI.go)   
[3306. Count of Substrings Containing Every Vowel and K Consonants II](./leetcode/3306-CountOfSubstringsContainingEveryVowelAndKConsonantsII.go)   
[3316. Find Maximum Removals From Source String](./leetcode/3316-FindMaximumRemovalsFromSourceString.go)   
[3320. Count The Number of Winning Sequences](./leetcode/3320-CountTheNumberOfWinningSequences.go)   
[3324. Find the Sequence of Strings Appeared on the Screen](./leetcode/3324-FindTheSequenceOfStringsAppearedOnTheScreen.go)   
[3325. Count Substrings With K-Frequency Characters I](./leetcode/3325-CountSubstringsWithKFrequencyCharactersI.go)   
[3329. Count Substrings With K-Frequency Characters II](./leetcode/3329-CountSubstringsWithKFrequencyCharactersII.go)   
[3330. Find the Original Typed String I](./leetcode/3330-FindTheOriginalTypedStringI.go)   
[3333. Find the Original Typed String II](./leetcode/3333-FindTheOriginalTypedStringII.go)   
[3335. Total Characters in String After Transformations I](./leetcode/3335-TotalCharactersInStringAfterTransformationsI.go)   
[3337. Total Characters in String After Transformations II](./leetcode/3337-TotalCharactersInStringAfterTransformationsII.go)   
[3340. Check Balanced String](./leetcode/3340-CheckBalancedString.go)   
[3343. Count Number of Balanced Permutations](./leetcode/3343-CountNumberOfBalancedPermutations.go)   
[3348. Smallest Divisible Digit Product II](./leetcode/3348-SmallestDivisibleDigitProductII.go)   
[3352. Count K-Reducible Numbers Less Than N](./leetcode/3352-CountKReducibleNumbersLessThanN.go)   
[3365. Rearrange K Substrings to Form Target String](./leetcode/3365-RearrangeKSubstringsToFormTargetString.go)   
[3389. Minimum Operations to Make Character Frequencies Equal](./leetcode/3389-MinimumOperationsToMakeCharacterFrequenciesEqual.go)   
[3398. Smallest Substring With Identical Characters I](./leetcode/3398-SmallestSubstringWithIdenticalCharactersI.go)   
[3399. Smallest Substring With Identical Characters II](./leetcode/3399-SmallestSubstringWithIdenticalCharactersII.go)   
[3403. Find the Lexicographically Largest String From the Box I](./leetcode/3403-FindTheLexicographicallyLargestStringFromTheBoxI.go)   
[3406. Find the Lexicographically Largest String From the Box II](./leetcode/3406-FindTheLexicographicallyLargestStringFromTheBoxII.go)   
[3407. Substring Matching Pattern](./leetcode/3407-SubstringMatchingPattern.go)   
[3412. Find Mirror Score of a String](./leetcode/3412-FindMirrorScoreOfAStriing.go)   
[3438. Find Valid Pair of Adjacent Digits in String](./leetcode/3438-FindValidPairOfAdjacentDigitsInString.go)   
[3441. Minimum Cost Good Caption](./leetcode/3441-MinimumCostGoodCaption.go)   
[3442. Maximum Difference Between Even and Odd Frequency I](./leetcode/3442-MaximumDifferenceBetweenEvenAndOddFrequencyI.go)   
[3443. Maximum Manhattan Distance After K Changes](./leetcode/3443-MaximumManhattanDistanceAfterKChanges.go)   
[3445. Maximum Difference Between Even and Odd Frequency II](./leetcode/3445-MaximumDifferenceBetweenEvenAndOddFrequencyII.go)   
[3448. Count Substrings Divisible By Last Digit](./leetcode/3448-CountSubstringsDivisibleByLastDigit.go)   
[3455. Shortest Matching Substring](./leetcode/3455-ShortestMatchingSubstring.go)   
[3456. Find Special Substring of Length K](./leetcode/3456-FindSpecialSubstringOfLengthK.go)   
[3458. Select K Disjoint Special Substrings](./leetcode/3458-SelectKDisjointSpecialSubstrings.go)   
[3460. Longest Common Prefix After at Most One Removal](./leetcode/3460-LongestCommonPrefixAfterAtMostOneRemoval.go)   
[3461. Check If Digits Are Equal in String After Operations I](./leetcode/3461-CheckIfDigitsAreEqualInStringAfterOperationsI.go)   
[3463. Check If Digits Are Equal in String After Operations II](./leetcode/3463-CheckIfDigitsAreEqualInStringAfterOperationsII.go)   
[3472. Longest Palindromic Subsequence After at Most K Operations](./leetcode/3472-LongestPalindromicSubsequenceAfterAtMostKOperations.go)   
[3474. Lexicographically Smallest Generated String](./leetcode/3474-LexicographicallySmallestGeneratedString.go)   
[3498. Reverse Degree of a String](./leetcode/3498-ReverseDegreeOfAString.go)   
[3499. Maximize Active Section with Trade I](./leetcode/3499-MaximizeActiveSectionWithTradeI.go)   
[3501. Maximize Active Section with Trade II](./leetcode/3501-MaximizeActiveSectionWithTradeII.go)   
[3503. Longest Palindrome After Substring Concatenation I](./leetcode/3503-LongestPalindromeAfterSubstringConcatenationI.go)   
[3504. Longest Palindrome After Substring Concatenation II](./leetcode/3504-LongestPalindromeAfterSubstringConcatenationII.go)   
[3517. Smallest Palindromic Rearrangement I](./leetcode/3517-SmallestPalindromicRearrangementI.go)   
[3518. Smallest Palindromic Rearrangement II](./leetcode/3518-SmallestPalindromicRearrangementII.go)   
[3519. Count Numbers with Non-Decreasing Digits](./leetcode/3519-CountNumbersWithNonDecreasingDigits.go)   
[3541. Find Most Frequent Vowel and Consonant](./leetcode/3541-FindMostFrequentVowelAndConsonant.go)   
[3545. Minimum Deletions for At Most K Distinct Characters](./leetcode/3545-MinimumDeletionsForAtMostKDistinctCharacters.go)   
[3556. Sum of Largest Prime Substrings](./leetcode/3556-SumOfLargestPrimeSubstrings.go)   
[3557. Find Maximum Number of Non Intersecting Substrings](./leetcode/3557-FindMaximumNumberOfNonIntersectingSubstrings.go)   
[3561. Resulting String After Adjacent Removals](./leetcode/3561-ResultingStringAfterAdjacentRemovals.go)   
[3563. Lexicographically Smallest String After Adjacent Removals](./leetcode/3563-LexicographicallySmallestStringAfterAdjacentRemovals.go)   
[3571. Find the Shortest Superstring II](./leetcode/3571-FindTheShortestSuperstringII.go)   
[3579. Minimum Steps to Convert String with Operations](./leetcode/3579-MinimumStepsToConvertStringWithOperations.go)   
[3582. Generate Tag for Video Caption](./leetcode/3582-GenerateTagForVideoCaption.go)   
[3597. Partition String](./leetcode/3597-PartitionString.go)   
[3612. Process String with Special Operations I](./leetcode/3612-ProcessStringWithSpecialOperationsI.go)   
[3614. Process String with Special Operations II](./leetcode/3614-ProcessStringWithSpecialOperationsII.go)   
[3628. Maximum Number of Subsequences After One Inserting](./leetcode/3628-MaximumNumberOfSubsequencesAfterOneInserting.go)   
[3662. Filter Characters by Frequency](./leetcode/3662-FilterCharactersByFrequency.go)   
[3666. Minimum Operations to Equalize Binary String](./leetcode/3666-MinimumOperationsToEqualizeBinaryString.go)   
[3639. Minimum Time to Activate String](./leetcode/3639-MinimumTimeToActivateString.go)   
[3692. Majority Frequency Characters](./leetcode/3692-MajorityFrequencyCharacters.go)   
[3694. Distinct Points Reachable After Substring Removal](./leetcode/3694-DistinctPointsReachableAfterSubstringRemoval.go)   
[3703. Remove K-Balanced Substrings](./leetcode/3703-RemoveKBalancedSubstrings.go)   
[3707. Equal Score Substrings](./leetcode/3707-EqualScoreSubstrings.go)   
[3713. Longest Balanced Substring I](./leetcode/3713-LongestBalancedSubstringI.go)   
[3714. Longest Balanced Substring II](./leetcode/3714-LongestBalancedSubstringII.go)   
[3720. Lexicographically Smallest Permutation Greater Than Target](./leetcode/3720-LexicographicallySmallestPermutationGreaterThanTarget.go)   
[3722. Lexicographically Smallest String After Reverse](./leetcode/3722-LexicographicallySmallestStringAfterReverse.go)   
[3734. Lexicographically Smallest Palindromic Permutation Greater Than Target](./leetcode/3734-LexicographicallySmallestPalindromicPermutationGreaterThanTarget.go)   
[3735. Lexicographically Smallest String After Reverse II](./leetcode/3735-LexicographicallySmallestStringAfterReverseII.go)   
[3744. Find Kth Character in Expanded String](./leetcode/3744-FindKthCharacterInExpandedString.go)   
[3746. Minimum String Length After Balanced Removals](./leetcode/3746-MinimumStringLengthAfterBalancedRemovals.go)   
[3749. Evaluate Valid Expressions](./leetcode/3749-EvaluateValidExpressions.go)   
[3756. Concatenate Non-Zero Digits and Multiply by Sum II](./leetcode/3756-ConcatenateNonZeroDigitsAndMultiplyBySumII.go)   
[3758. Convert Number Words to Digits](./leetcode/3758-ConvertNumberWordsToDigits.go)   
[3760. Maximum Substrings With Distinct Start](./leetcode/3760-MaximumSubstringsWithDistinctStart.go)   
[3773. Maximum Number of Equal Length Runs](./leetcode/3773-MaximumNumberOfEqualLengthRuns.go)   
[3775. Reverse Words With Same Vowel Count](./leetcode/3775-ReverseWordsWithSameVowelCount.go)   
[3777. Minimum Deletions to Make Alternating Substring](./leetcode/3777-MinimumDeletionsToMakeAlternatingSubstring.go)   
[3784. Minimum Deletion Cost to Make All Characters Equal](./leetcode/3784-MinimumDeletionCostToMakeAllCharactersEqual.go)   
[3794. Reverse String Prefix](./leetcode/3794-ReverseStringPrefix.go)   
[3798. Largest Even Number](./leetcode/3798-LargestEvenNumber.go)   
[3800. Minimum Cost to Make Two Binary Strings Equal](./leetcode/3800-MinimumCostToMakeTwoBinaryStringsEqual.go)   
[3803. Count Residue Prefixes](./leetcode/3803-CountResiduePrefixes.go)   
[3813. Vowel-Consonant Score](./leetcode/3813-VowelConsonantScore.go)   
[3816. Lexicographically Smallest String After Deleting Duplicate Characters](./leetcode/3816-LexicographicallySmallestStringAfterDeletingDuplicateCharacters.go)   
[3817. Good Indices in a Digit String](./leetcode/3817-GoodIndicesInADigitString.go)   
[3823. Reverse Letters Then Special Characters in a String](./leetcode/3823-ReverseLettersThenSpecialCharactersInAString.go)   
[3844. Longest Almost-Palindromic Substring](./leetcode/3844-LongestAlmostPalindromicSubstring.go)   
[3846. Total Distance to Type a String Using One Finger](./leetcode/3846-TotalDistanceToTypeAStringUsingOneFinger.go)   
[3849. Maximum Bitwise XOR After Rearrangement](./leetcode/3849-MaximumBitwiseXORAfterRearrangement.go)   
[3853. Merge Close Characters](./leetcode/3853-MergeCloseCharacters.go)   
[3856. Trim Trailing Vowels from a String](./leetcode/3856-TrimTrailingVowelsFromAString.go)   
[3863. Minimum Operations to Sort a String](./leetcode/3863-MinimumOperationsToSortAString.go)   
[3864. Minimum Cost to Partition a Binary String](./leetcode/3864-MinimumCostToPartitionABinaryString.go)   
[3884. First Matching Character From Both Ends](./leetcode/3884-FirstMatchingCharacterFromBothEnds.go)   
[3889. Mirror Frequency Distance](./leetcode/3889-MirrorFrequencyDistance.go)   
[3900. Longest Balanced Substring After One Swap](./leetcode/3900-LongestBalancedSubstringAfterOneSwap.go)   
[3906. Count Good Integers on a Grid Path](./leetcode/3906-CountGoodIntegersOnAGridPath.go)   
[3913. Sort Vowels by Frequency](./leetcode/3913-SortVowelsByFrequency.go)   
[3922. Minimum Flips to Make Binary String Coherent](./leetcode/3922-MinimumFlipsToMakeBinaryStringCoherent.go)   
[3931. Check Adjacent Digit Differences](./leetcode/3931-CheckAdjacentDigitDifferences.go)   
[3941. Password Strength](./leetcode/3941-PasswordStrength.go)   
[3968. Maximum Manhattan Distance After All Moves](./leetcode/3968-MaximumManhattanDistanceAfterAllMoves.go)   
[3980. Minimum Operations to Transform Binary String](./leetcode/3980-MinimumOperationsToTransformBinaryString.go)   
[3981. Count Distinct Ways to Form Target from Two Strings](./leetcode/3981-CountDistinctWaysToFormTargetFromTwoStrings.go)   
[3983. Subsequence After One Replacement](./leetcode/3983-SubsequenceAfterOneReplacement.go)   
[3986. Number of Elapsed Seconds Between Two Times](./leetcode/3986-NumberOfElapsedSecondsBetweenTwoTimes.go)   
[3992. Rearrange String to Avoid Character Pair](./leetcode/3992-RearrangeStringToAvoidCharacterPair.go)   
[3995. Minimum Cost to Convert String III](./leetcode/3995-MinimumCostToConvertStringIII.go)   
[3998. Transform Binary String Using Subsequence Sort](./leetcode/3998-TransformBinaryStringUsingSubsequenceSort.go)   
[4006. Count Valid Prefixes](./leetcode/4006-CountValidPrefixes.go)   
[4019. Merge Close Characters II](./leetcode/4019-MergeCloseCharactersII.go)   
[4021. Minimum Operations to Make a Rotated Palindrome I](./leetcode/4021-MinimumOperationsToMakeARotatedPalindromeI.go)   
[4026. Maximum Gap Between Stations](./leetcode/4026-MaximumGapBetweenStations.go)   
[4028. Minimum Operations to Make a Rotated Palindrome II](./leetcode/4028-MinimumOperationsToMakeARotatedPalindromeII.go)   
[4030. Check ASCII Palindromic](./leetcode/4030-CheckASCIIPalindromic.go)   
[4043. Count Rotations With Exactly K Equal Adjacent Pairs](./leetcode/4043-CountRotationsWithExactlyKEquEqualAdjacentPairs.go)   

# Dynamic Programming
[276. Paint Fence](./leetcode/276-PaintFence.go)   
[552. Student Attendance Record II](./leetcode/552-StudentAttendanceRecordII.go)   
[576. Out of Boundary Paths](./leetcode/576-OutOfBoundaryPaths.go)   
[600. Non-negative Integers without Consecutive Ones](./leetcode/600-Non-NegativeIntegersWithoutConsecutiveOnes.go)   
[629. K Inverse Pairs Array](./leetcode/629-K-InversePairsArray.go)   
[688. Knight Probability in Chessboard](./leetcode/688-KnightProbabilityInChessboard.go)   
[787. Cheapest Flights Within K Stops](./leetcode/787-CheapestFlightsWithinKStops.go)   
[790. Domino and Tromino Tiling](./leetcode/790-DominoAndTrominoTiling.go)   
[799. Champagne Tower](./leetcode/799-ChampagneTower.go)   
[935. Knight Dialer](./leetcode/935-KnightDialer.go)   
[1155. Number of Dice Rolls With Target Sum](./leetcode/1155-NumberOfDiceRollsWithTargetSum.go)   
[1220. Count Vowels Permutation](./leetcode/1220-CountVowelsPermutation.go)   
[1269. Number of Ways to Stay in the Same Place After Some Steps](./leetcode/1269-NumberOfWaysToStayInTheSamePlaceAfterSomeSteps.go)   
[1387. Sort Integers by The Power Value](./leetcode/1387-SortIntegersByThePowerValue.go)   
[1411. Number of Ways to Paint N × 3 Grid](./leetcode/1411-NumberOfWaysToPaintN3Grid.go)   
[1420. Build Array Where You Can Find The Maximum Exactly K Comparisons](./leetcode/1420-BuildArrayWhereYouCanFindTheMaximumExactlyKComparisons.go)   
[1553. Minimum Number of Days to Eat N Oranges](./leetcode/1553-MinimumNumberOfDaysToEatNOranges.go)   
[1611. Minimum One Bit Operations to Make Integers Zero](./leetcode/1611-MinimumOneBitOperationsToMakeIntegersZero.go)   
[1659. Maximize Grid Happiness](./leetcode/1659-MaximizeGridHappiness.go)   
[1692. Count Ways to Distribute Candies](./leetcode/1692-CountWaysToDistributeCandies.go)   
[1900. The Earliest and Latest Rounds Where Players Compete](./leetcode/1900-TheEarliestAndLatestRoundsWherePlayersCompete.go)   
[1931. Painting a Grid With Three Different Colors](./leetcode/1931-PaintingAGridWithThreeDifferentColors.go)   
[2318. Number of Distinct Roll Sequences](./leetcode/2318-NumberOfDistinctRollSequences.go)   
[2320. Count Number of Ways to Place Houses](./leetcode/2320-CountNumberOfWaysToPlaceHouses.go)   
[2327. Number of People Aware of a Secret](./leetcode/2327-NumberOfPeopleAwareOfASecret.go)   
[2466. Count Ways To Build Good Strings](./leetcode/2466-CountWaysToBuildGoodStrings.go)   
[2533. Number of Good Binary Strings](./leetcode/2533-NumberOfGoodBinaryStrings.go)   
[2787. Ways to Express an Integer as Sum of Powers](./leetcode/2787-WaysToExpressAnIntegerAsSumOfPowers.go)   
[2998. Minimum Number of Operations to Make X and Y Equal](./leetcode/2998-MinimumNumberOfOperationsToMakeXAndYEqual.go)   
[3129. Find All Possible Stable Binary Arrays I](./leetcode/3129-FindAllPossibleStableBinaryArraysI.go)   
[3130. Find All Possible Stable Binary Arrays II](./leetcode/3130-FindAllPossibleStableBinaryArraysII.go)   
[3339. Find the Number of K-Even Arrays](./leetcode/3339-FindTheNumberOfKEvenArrays.go)   

# Two Pointers
[11. Container With Most Water](./leetcode/11-ContainerWithMostWater.go)   

# Heap
[2231. Largest Number After Digit Swaps by Parity](./leetcode/2231-LargestNumberAfterDigitSwapsByParity.go)   

# Linked List
[2. Add Two Numbers](./leetcode/2-AddTwoNumbers.go)    
[19. Remove Nth Node From End of List](./leetcode/19-RemoveNthNodeFromEndOfList.go)    
[21. Merge Two Sorted Lists](./leetcode/21-MergeTwoSortedLists.go)    
[23. Merge k Sorted Lists](./leetcode/23-MergeKSortedLists.go)    
[24. Swap Nodes in Pairs](./leetcode/24-SwapNodesInPairs.go)    
[25. Reverse Nodes in k-Group](./leetcode/25-ReverseNodesInKGroup.go)    
[61. Rotate List](./leetcode/61-RotateList.go)    
[82. Remove Duplicates from Sorted List II](./leetcode/82-RemoveDuplicatesFromSortedListII.go)   
[83. Remove Duplicates from Sorted List](./leetcode/83-RemoveDuplicatesFromSortedList.go)    
[86. Partition List](./leetcode/86-PartitionList.go)    
[92. Reverse Linked List II](./leetcode/92-ReverseLinkedListII.go)   
[109. Convert Sorted List to Binary Search Tree](./leetcode/109-ConvertSortedListToBinarySearchTree.go)    
[138. Copy List with Random Pointer](./leetcode/138-CopyListWithRandomPointer.go)   
[141. Linked List Cycle](./leetcode/141-LinkedListCycle.go)    
[142. Linked List Cycle II](./leetcode/142-LinkedListCycleII.go)    
[143. Reorder List](./leetcode/143-ReorderList.go)    
[147. Insertion Sort List](./leetcode/147-InsertionSortList.go)    
[148. Sort List](./leetcode/148-SortList.go)    
[160. Intersection of Two Linked Lists](./leetcode/160-IntersectionOfTwoLinkedLists.go)   
[203. Remove Linked List Elements](./leetcode/203-RemoveLinkedListElements.go)   
[206. Reverse Linked List](./leetcode/206-ReverseLinkedList.go)   
[234. Palindrome Linked List](./leetcode/234-PalindromeLinkedList.go)    
[237. Delete Node in a Linked List](./leetcode/237-DeleteNodeInALinkedList.go)   
[328. Odd Even Linked List](./leetcode/328-OddEvenLinkedList.go)   
[369. Plus One Linked List](./leetcode/369-PlusOneLinkedList.go)   
[430. Flatten a Multilevel Doubly Linked List](./leetcode/430-FlattenAMultilevelDoublyLinkedList.go)   
[445. Add Two Numbers II](./leetcode/445-AddTwoNumbersII.go)   
[708. Insert into a Sorted Circular Linked List](./leetcode/708-InsertIntoASortedCircularLinkedList.go)   
[725. Split Linked List in Parts](./leetcode/725-SplitLinkedListInParts.go)   
[817. Linked List Components](./leetcode/817-LinkedListComponents.go)   
[876. Middle of the Linked List](./leetcode/876-MiddleOfTheLinkedList.go)   
[1019. Next Greater Node In Linked List](./leetcode/1019-NextGreaterNodeInLinkedList.go)   
[1171. Remove Zero Sum Consecutive Nodes from Linked List](./leetcode/1171-RemoveZeroSumConsecutiveNodesFromLinkedList.go)   
[1265. Print Immutable Linked List in Reverse](./leetcode/1265-PrintImmutableLinkedListInReverse.go)   
[1290. Convert Binary Number in a Linked List to Integer](./leetcode/1290-ConvertBinaryNumberInALinkedListToInteger.go)   
[1367. Linked List in Binary Tree](./leetcode/1367-LinkedListInBinaryTree.go)   
[1474. Delete N Nodes After M Nodes of a Linked List](./leetcode/1474-DeleteN-NodesAfterM-NodesOfALinkedList.go)   
[1634. Add Two Polynomials Represented as Linked Lists](./leetcode/1634-AddTwoPolynomialsRepresentedAsLinkedLists.go)   
[1669. Merge In Between Linked Lists](./leetcode/1669-MergeInBetweenLinkedLists.go)   
[1721. Swapping Nodes in a Linked List](./leetcode/1721-SwappingNodesInALinkedList.go)   
[1836. Remove Duplicates From an Unsorted Linked List](./leetcode/1836-RemoveDuplicatesFromAnUnsortedLinkedList.go)   
[2046. Sort Linked List Already Sorted Using Absolute Values](./leetcode/2046-SortLinkedListAlreadySortedUsingAbsoluteValues.go)   
[2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](./leetcode/2058-FindTheMinimumAndMaximumNumberOfNodesBetweenCriticalPoints.go)   
[2074. Reverse Nodes in Even Length Groups](./leetcode/2074-ReverseNodesInEvenLengthGroups.go)   
[2095. Delete the Middle Node of a Linked List](./leetcode/2095-DeleteTheMiddleNodeOfALinkedList.go)   
[2130. Maximum Twin Sum of a Linked List](./leetcode/2130-MaximumTwinSumOfALinkedList.go)   
[2181. Merge Nodes in Between Zeros](./leetcode/2181-MergeNodesInBetweenZeros.go)   
[2326. Spiral Matrix IV](./leetcode/2326-SpiralMatrixIV.go)   
[2487. Remove Nodes From Linked List](./leetcode/2487-RemoveNodesFromLinkedList.go)   
[2674. Split a Circular Linked List](./leetcode/2674-SplitACircularLinkedList.go)   
[2807. Insert Greatest Common Divisors in Linked List](./leetcode/2807-InsertGreatestCommonDivisorsInLinkedList.go)   
[2816. Double a Number Represented as a Linked List](./leetcode/2816-DoubleANumberRepresentedAsALinkedList.go)   
[3062. Winner of the Linked List Game](./leetcode/3062-WinnerOfTheLinkedListGame.go)   
[3063. Linked List Frequency](./leetcode/3063-LinkedListFrequency.go)   
[3217. Delete Nodes From Linked List Present in Array](./leetcode/3217-DeleteNodesFromLinkedListPresentInArray.go)   
[3263. Convert Doubly Linked List to Array I](./leetcode/3263-ConvertDoublyLinkedListToArrayI.go)   
[3294. Convert Doubly Linked List to Array II](./leetcode/3294-ConvertDoublyLinkedListToArrayII.go)   

# Enumeration
[204. Count Primes](./leetcode/204-CountPrimes.go)   
[1291. Sequential Digits](./leetcode/1291-SequentialDigits.go)   
[3001. Minimum Moves to Capture The Queen](./leetcode/3001-MinimumMovesToCaptureTheQueen.go)   

# HashTable
[694. Number of Distinct Islands](./leetcode/694-NumberOfDistinctIslands.go)   
[711. Number of Distinct Islands II](./leetcode/711-NumberOfDistinctIslandsII.go)   

# Segment_Tree
[307. Range Sum Query - Mutable](./leetcode/307-RangeSumQuery-Mutable.go)   

# Math
[2. Add Two Numbers](./leetcode/2-AddTwoNumbers.go)    
[7. Reverse Integer](./leetcode/7-ReverseInteger.go)    
[9. Palindrome Number](./leetcode/9-PalindromeNumber.go)    
[29. Divide Two Integers](./leetcode/29-DivideTwoIntegers.go)    
[50. Pow(x, n)](./leetcode/50-Pow-x-n.go)    
[60. Permutation Sequence](./leetcode/60-PermutationSequence.go)    
[62. Unique Paths](./leetcode/62-UniquePaths.go)    
[69. Sqrt(x)](./leetcode/69-Sqrtx.go)    
[70. Climbing Stairs](./leetcode/70-ClimbingStairs.go)    
[89. Gray Code](./leetcode/89-GrayCode.go)    
[166. Fraction to Recurring Decimal](./leetcode/166-FractionToRecurringDecimal.go)    
[172. Factorial Trailing Zeroes](./leetcode/172-FactorialTrailingZeroes.go)    
[202. Happy Number](./leetcode/202-HappyNumber.go)    
[223. Rectangle Area](./leetcode/223-RectangleArea.go)    
[231. Power of Two](./leetcode/231-PowerOfTwo.go)    
[233. Number of Digit One](./leetcode/233-NumberOfDigitOne.go)   
[258. Add Digits](./leetcode/258-AddDigits.go)    
[263. Ugly Number](./leetcode/263-UglyNumber.go)    
[264. Ugly Number II](./leetcode/264-UglyNumberII.go)   
[273. Integer to English Words](./leetcode/273-IntegerToEnglishWords.go)   
[279. Perfect Squares](./leetcode/279-PerfectSquares.go)   
[292. Nim Game](./leetcode/292-NimGame.go)   
[313. Super Ugly Number](./leetcode/313-SuperUglyNumber.go)   
[319. Bulb Switcher](./leetcode/319-BulbSwitcher.go)   
[326. Power of Three](./leetcode/326-PowerOfThree.go)   
[342. Power of Four](./leetcode/342-PowerOfFour.go)   
[343. Integer Break](./leetcode/343-IntegerBreak.go)   
[356. Line Reflection](./leetcode/356-LineReflection.go)   
[357. Count Numbers with Unique Digits](./leetcode/357-CountNumbersWithUniqueDigits.go)   
[360. Sort Transformed Array](./leetcode/360-SortTransformedArray.go)   
[365. Water and Jug Problem](./leetcode/365-WaterAndJugProblem.go)   
[367. Valid Perfect Square](./leetcode/367-ValidPerfectSquare.go)   
[371. Sum of Two Integers](./leetcode/371-SumOfTwoIntegers.go)   
[372. Super Pow](./leetcode/372-SuperPow.go)   
[375. Guess Number Higher or Lower II](./leetcode/375-GuessNumberHigherOrLowerII.go)   
[390. Elimination Game](./leetcode/390-EliminationGame.go)   
[396. Rotate Function](./leetcode/396-RotateFunction.go)   
[400. Nth Digit](./leetcode/400-NthDigit.go)   
[405. Convert a Number to Hexadecimal](./leetcode/405-ConvertANumberToHexadecimal.go)   
[412. Fizz Buzz](./leetcode/412-FizzBuzz.go)   
[441. Arranging Coins](./leetcode/441-ArrangingCoins.go)   
[453. Minimum Moves to Equal Array Elements](./leetcode/453-MinimumMovesToEqualArrayElements.go)   
[458. Poor Pigs](./leetcode/458-PoorPigs.go)   
[464. Can I Win](./leetcode/464-CanIWin.go)   
[479. Largest Palindrome Product](./leetcode/479-LargestPalindromeProduct.go)   
[492. Construct the Rectangle](./leetcode/492-ConstructTheRectangle.go)   
[504. Base 7](./leetcode/504-Base7.go)   
[507. Perfect Number](./leetcode/507-PerfectNumber.go)   
[509. Fibonacci Number](./leetcode/509-FibonacciNumber.go)   
[519. Random Flip Matrix](./leetcode/519-RandomFlipMatrix.go)   
[556. Next Greater Element III](./leetcode/556-NextGreaterElementIII.go)   
[587. Erect the Fence](./leetcode/587-ErectTheFence.go)   
[593. Valid Square](./leetcode/593-ValidSquare.go)   
[625. Minimum Factorization](./leetcode/625-MinimumFactorization.go)   
[633. Sum of Square Numbers](./leetcode/633-SumOfSquareNumbers.go)   
[634. Find the Derangement of An Array](./leetcode/634-FindTheDerangementOfAnArray.go)   
[650. 2 Keys Keyboard](./leetcode/650-2KeysKeyboard.go)   
[651. 4 Keys Keyboard](./leetcode/651-4KeysKeyboard.go)   
[660. Remove 9](./leetcode/660-Remove9.go)   
[667. Beautiful Arrangement II](./leetcode/667-BeautifulArrangementII.go)   
[668. Kth Smallest Number in Multiplication Table](./leetcode/668-KthSmallestNumberInMultiplicationTable.go)   
[670. Maximum Swap](./leetcode/670-MaximumSwap.go)   
[672. Bulb Switcher II](./leetcode/672-BulbSwitcherII.go)   
[728. Self Dividing Numbers](./leetcode/728-SelfDividingNumbers.go)   
[738. Monotone Increasing Digits](./leetcode/738-MonotoneIncreasingDigits.go)   
[754. Reach a Number](./leetcode/754-ReachANumber.go)   
[762. Prime Number of Set Bits in Binary Representation](./leetcode/762-PrimeNumberOfSetBitsInBinaryRepresentation.go)   
[775. Global and Local Inversions](./leetcode/775-GlobalAndLocalInversions.go)   
[779. K-th Symbol in Grammar](./leetcode/779-KthSymbolInGrammar.go)   
[780. Reaching Points](./leetcode/780-ReachingPoints.go)   
[788. Rotated Digits](./leetcode/788-RotatedDigits.go)   
[793. Preimage Size of Factorial Zeroes Function](./leetcode/793-PreimageSizeOfFactorialZeroesFunction.go)   
[808. Soup Servings](./leetcode/808-SoupServings.go)   
[812. Largest Triangle Area](./leetcode/812-LargestTriangleArea.go)   
[818. Race Car](./leetcode/818-RaceCar.go)   
[829. Consecutive Numbers Sum](./leetcode/829-ConsecutiveNumbersSum.go)   
[836. Rectangle Overlap](./leetcode/836-RectangleOverlap.go)   
[837. New 21 Game](./leetcode/837-New21Game.go)   
[858. Mirror Reflection](./leetcode/858-MirrorReflection.go)   
[866. Prime Palindrome](./leetcode/866-PrimePalindrome.go)   
[869. Reordered Power of 2](./leetcode/869-ReorderedPowerOfTwo.go)   
[878. Nth Magical Number](./leetcode/878-NthMagicalNumber.go)   
[883. Projection Area of 3D Shapes](./leetcode/883-ProjectionAreaOf3DShapes.go)   
[892. Surface Area of 3D Shapes](./leetcode/892-SurfaceAreaOf3DShapes.go)   
[887. Super Egg Drop](./leetcode/887-SuperEggDrop.go)   
[902. Numbers At Most N Given Digit Set](./leetcode/902-NumbersAtMostNGivenDigitSet.go)   
[908. Smallest Range I](./leetcode/908-SmallestRangeI.go)   
[910. Smallest Range II](./leetcode/910-SmallestRangeII.go)   
[920. Number of Music Playlists](./leetcode/920-NumberOfMusicPlaylists.go)   
[932. Beautiful Array](./leetcode/932-BeautifulArray.go)   
[939. Minimum Area Rectangle](./leetcode/939-MinimumAreaRectangle.go)   
[964. Least Operators to Express Number](./leetcode/964-LeastOperatorsToExpressNumber.go)   
[970. Powerful Integers](./leetcode/970-PowerfulIntegers.go)   
[972. Equal Rational Numbers](./leetcode/972-EqualRationalNumbers.go)   
[973. K Closest Points to Origin](./leetcode/973-KClosestPointsToOrigin.go)   
[991. Broken Calculator](./leetcode/991-BrokenCalculator.go)   
[1006. Clumsy Factorial](./leetcode/1006-ClumsyFactorial.go)   
[1012. Numbers With Repeated Digits](./leetcode/1012-NumbersWithRepeatedDigits.go)   
[1015. Smallest Integer Divisible by K](./leetcode/1015-SmallestIntegerDivisibleByK.go)   
[1017. Convert to Base -2](./leetcode/1017-ConvertToBase-2.go)   
[1025. Divisor Game](./leetcode/1025-DivisorGame.go)   
[1033. Moving Stones Until Consecutive](./leetcode/1033-MovingStonesUntilConsecutive.go)   
[1056. Confusing Number](./leetcode/1056-ConfusingNumber.go)   
[1067. Digit Count in Range](./leetcode/1067-DigitCountInRange.go)   
[1088. Confusing Number II](./leetcode/1088-ConfusingNumberII.go)   
[1103. Distribute Candies to People](./leetcode/1103-DistributeCandiesToPeople.go)   
[1104. Path In Zigzag Labelled Binary Tree](./leetcode/1104-PathInZigzagLabelledBinaryTree.go)   
[1118. Number of Days in a Month](./leetcode/1118-NumberOfDaysInAMonth.go)   
[1134. Armstrong Number](./leetcode/1134-ArmstrongNumber.go)   
[1137. N-th Tribonacci Number](./leetcode/1137-NthTribonacciNumber.go)   
[1154. Day of the Year](./leetcode/1154-DayOfTheYear.go)   
[1175. Prime Arrangements](./leetcode/1175-PrimeArrangements.go)   
[1183. Maximum Number of Ones](./leetcode/1183-MaximumNumberOfOnes.go)   
[1185. Day of the Week](./leetcode/1185-DayOfTheWeek.go)   
[1201. Ugly Number III](./leetcode/1201-UglyNumberIII.go)   
[1227. Airplane Seat Assignment Probability](./leetcode/1227-AirplaneSeatAssignmentProbability.go)   
[1237. Find Positive Integer Solution for a Given Equation](./leetcode/1237-FindPositiveIntegerSolutionForAGivenEquation.go)   
[1238. Circular Permutation in Binary Representation](./leetcode/1238-CircularPermutationInBinaryRepresentation.go)   
[1256. Encode Number](./leetcode/1256-EncodeNumber.go)   
[1259. Handshakes That Don't Cross](./leetcode/1259-HandshakesThatDontCross.go)   
[1276. Number of Burgers with No Waste of Ingredients](./leetcode/1276-NumberOfBurgersWithNoWasteOfIngredients.go)   
[1281. Subtract the Product and Sum of Digits of an Integer](./leetcode/1281-SubtractTheProductAndSumOfDigitsOfAnInteger.go)   
[1304. Find N Unique Integers Sum up to Zero](./leetcode/1304-FindNUniqueIntegersSumUpToZero.go)   
[1317. Convert Integer to the Sum of Two No-Zero Integers](./leetcode/1317-ConvertIntegerToTheSumOfTwoNoZeroIntegers.go)   
[1323. Maximum 69 Number](./leetcode/1323-Maximum69Number.go)   
[1342. Number of Steps to Reduce a Number to Zero](./leetcode/1342-NumberOfStepsToReduceANumberToZero.go)   
[1344. Angle Between Hands of a Clock](./leetcode/1344-AngleBetweenHandsOfAClock.go)   
[1359. Count All Valid Pickup and Delivery Options](./leetcode/1359-CountAllValidPickupAndDeliveryOptions.go)   
[1362. Closest Divisors](./leetcode/1362-ClosestDivisors.go)   
[1390. Four Divisors](./leetcode/1390-FourDivisors.go)   
[1399. Count Largest Group](./leetcode/1399-CountLargestGroup.go)   
[1401. Circle and Rectangle Overlapping](./leetcode/1401-CircleAndRectangleOverlapping.go)   
[1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](./leetcode/1414-FindTheMinimumNumberOfFibonacciNumbersWhoseSumIsK.go)   
[1432. Max Difference You Can Get From Changing an Integer](./leetcode/1432-MaxDifferenceYouCanGetFromChangingAnInteger.go)   
[1447. Simplified Fractions](./leetcode/1447-SimplifiedFractions.go)   
[1453. Maximum Number of Darts Inside of a Circular Dartboard](./leetcode/1453-MaximumNumberOfDartsInsideOfACircularDartboard.go)   
[1486. XOR Operation in an Array](./leetcode/1486-XOROperationInAnArray.go)   
[1492. The kth Factor of n](./leetcode/1492-TheKthFactorOfN.go)   
[1510. Stone Game IV](./leetcode/1510-StoneGameIV.go)   
[1512. Number of Good Pairs](./leetcode/1512-NumberOfGoodPairs.go)   
[1515. Best Position for a Service Centre](./leetcode/1515-BestPositionForAServiceCentre.go)   
[1518. Water Bottles](./leetcode/1518-WaterBottles.go)   
[1523. Count Odd Numbers in an Interval Range](./leetcode/1523-CountOddNumbersInAnIntervalRange.go)   
[1551. Minimum Operations to Make Array Equal](./leetcode/1551-MinimumOperationsToMakeArrayEqual.go)   
[1578. Minimum Time to Make Rope Colorful](./leetcode/1578-MinimumTimeToMakeRopeColorful.go)   
[1610. Maximum Number of Visible Points](./leetcode/1610-MaximumNumberOfVisiblePoints.go)   
[1621. Number of Sets of K Non-Overlapping Line Segments](./leetcode/1621-NumberOfSetsOfKNonOverlappingLineSegments.go)   
[1641. Count Sorted Vowel Strings](./leetcode/1641-CountSortedVowelStrings.go)   
[1680. Concatenation of Consecutive Binary Numbers](./leetcode/1680-ConcatenationOfConsecutiveBinaryNumbers.go)   
[1688. Count of Matches in Tournament](./leetcode/1688-CountOfMatchesInTournament.go)   
[1701. Average Waiting Time](./leetcode/1701-AverageWaitingTime.go)   
[1716. Calculate Money in Leetcode Bank](./leetcode/1716-CalculateMoneyInLeetcodeBank.go)   
[1739. Building Boxes](./leetcode/1739-BuildingBoxes.go)   
[1742. Maximum Number of Balls in a Box](./leetcode/1742-MaximumNumberOfBallsInABox.go)   
[1753. Maximum Score From Removing Stones](./leetcode/1753-MaximumScoreFromRemovingStones.go)   
[1780. Check if Number is a Sum of Powers of Three](./leetcode/1780-CheckIfNumberIsASumOfPowersOfThree.go)   
[1806. Minimum Number of Operations to Reinitialize a Permutation](./leetcode/1806-MinimumNumberOfOperationsToReinitializeAPermutation.go)   
[1808. Maximize Number of Nice Divisors](./leetcode/1808-MaximizeNumberOfNiceDivisors.go)   
[1823. Find the Winner of the Circular Game](./leetcode/1823-FindTheWinnerOfTheCircularGame.go)   
[1828. Queries on Number of Points Inside a Circle](./leetcode/1828-QueriesOnNumberOfPointsInsideACircle.go)   
[1837. Sum of Digits in Base K](./leetcode/1837-SumOfDigitsInBaseK.go)   
[1860. Incremental Memory Leak](./leetcode/1860-IncrementalMemoryLeak.go)   
[1862. Sum of Floored Pairs](./leetcode/1862-SumOfFlooredPairs.go)   
[1866. Number of Ways to Rearrange Sticks With K Sticks Visible](./leetcode/1866-NumberOfWaysToRearrangeSticksWithKSticksVisible.go)   
[1884. Egg Drop With 2 Eggs and N Floors](./leetcode/1884-EggDropWithTwoEggsAndNFloors.go)   
[1908. Game of Nim](./leetcode/1908-GameOfNim.go)   
[1922. Count Good Numbers](./leetcode/1922-CountGoodNumbers.go)   
[1924. Erect the Fence II](./leetcode/1924-ErectTheFenceII.go)   
[1925. Count Square Sum Triples](./leetcode/1925-CountSquareSumTriples.go)   
[1952. Three Divisors](./leetcode/1952-ThreeDivisors.go)   
[1954. Minimum Garden Perimeter to Collect Enough Apples](./leetcode/1954-MinimumGardenPerimeterToCollectEnoughApples.go)   
[1956. Minimum Time For K Virus Variants to Spread](./leetcode/1956-MinimumTimeForKVirusVariantsToSpread.go)   
[1999. Smallest Greater Multiple Made of Two Digits](./leetcode/1999-SmallestGreaterMultipleMadeOfTwoDigits.go)   
[2005. Subtree Removal Game with Fibonacci Tree](./leetcode/2005-SubtreeRemovalGameWithFibonacciTree.go)   
[2048. Next Greater Numerically Balanced Number](./leetcode/2048-NextGreaterNumericallyBalancedNumber.go)   
[2081. Sum of k-Mirror Numbers](./leetcode/2081-SumOfKMirrorNumbers.go)   
[2101. Detonate the Maximum Bombs](./leetcode/2101-DetonateTheMaximumBombs.go)   
[2128. Remove All Ones With Row and Column Flips](./leetcode/2128-RemoveAllOnesWithRowAndColumnFlips.go)   
[2139. Minimum Moves to Reach Target Score](./leetcode/2139-MinimumMovesToReachTargetScore.go)   
[2152. Minimum Number of Lines to Cover Points](./leetcode/2152-MinimumNumberOfLinesToCoverPoints.go)   
[2160. Minimum Sum of Four Digit Number After Splitting Digits](./leetcode/2160-MinimumSumOfFourDigitNumberAfterSplittingDigits.go)   
[2162. Minimum Cost to Set Cooking Time](./leetcode/2162-MinimumCostToSetCookingTime.go)   
[2165. Smallest Value of the Rearranged Number](./leetcode/2165-SmallestValueOfTheRearrangedNumber.go)   
[2169. Count Operations to Obtain Zero](./leetcode/2169-CountOperationsToObtainZero.go)   
[2180. Count Integers With Even Digit Sum](./leetcode/2180-CountIntegersWithEvenDigitSum.go)   
[2189. Number of Ways to Build House of Cards](./leetcode/2189-NumberOfWaysToBuildHouseOfCards.go)   
[2117. Abbreviating the Product of a Range](./leetcode/2117-AbbreviatingTheProductOfARange.go)   
[2119. A Number After a Double Reversal](./leetcode/2119-ANumberAfterADoubleReversal.go)   
[2177. Find Three Consecutive Integers That Sum to a Given Number](./leetcode/2177-FindThreeConsecutiveIntegersThatSumToAGivenNumber.go)   
[2178. Maximum Split of Positive Even Integers](./leetcode/2178-MaximumSplitOfPositiveEvenIntegers.go)   
[2221. Find Triangular Sum of an Array](./leetcode/2221-FindTriangularSumOfAnArray.go)   
[2235. Add Two Integers](./leetcode/2235-AddTwoIntegers.go)   
[2240. Number of Ways to Buy Pens and Pencils](./leetcode/2240-NumberOfWaysToBuyPensAndPencils.go)   
[2249. Count Lattice Points Inside a Circle](./leetcode/2249-CountLatticePointsInsideACircle.go)   
[2269. Find the K-Beauty of a Number](./leetcode/2269-FindTheKBeautyOfANumber.go)   
[2310. Sum of Numbers With Units Digit K](./leetcode/2310-SumOfNumbersWithUnitsDigitK.go)   
[2338. Count the Number of Ideal Arrays](./leetcode/2338-CountTheNumberOfIdealArrays.go)   
[2376. Count Special Integers](./leetcode/2376-CountSpecialIntegers.go)   
[2396. Strictly Palindromic Number](./leetcode/2396-StrictlyPalindromicNumber.go)   
[2400. Number of Ways to Reach a Position After Exactly k Steps](./leetcode/2400-NumberOfWaysToReachAPositionAfterExactlyKSteps.go)   
[2413. Smallest Even Multiple](./leetcode/2413-SmallestEvenMultiple.go)   
[2417. Closest Fair Integer](./leetcode/2417-ClosestFairInteger.go)   
[2427. Number of Common Factors](./leetcode/2427-NumberOfCommonFactors.go)   
[2443. Sum of Number and Its Reverse](./leetcode/2443-SumOfNumberAndItsReverse.go)   
[2457. Minimum Addition to Make Integer Beautiful](./leetcode/2457-MinimumAdditionToMakeIntegerBeautiful.go)   
[2469. Convert the Temperature](./leetcode/2469-ConvertTheTemperature.go)   
[2481. Minimum Cuts to Divide a Circle](./leetcode/2481-MinimumCutsToDivideACircle.go)   
[2485. Find the Pivot Integer](./leetcode/2485-FindThePivotInteger.go)   
[2507. Smallest Value After Replacing With Sum of Prime Factors](./leetcode/2507-SmallestValueAfterReplacingWithSumOfPrimeFactors.go)   
[2513. Minimize the Maximum of Two Arrays](./leetcode/2513-MinimizeTheMaximumOfTwoArrays.go)   
[2520. Count the Digits That Divide a Number](./leetcode/2520-CountTheDigitsThatDivideANumber.go)   
[2523. Closest Prime Numbers in Range](./leetcode/2523-ClosestPrimeNumbersInRange.go)   
[2525. Categorize Box According to Criteria](./leetcode/2525-CategorizeBoxAccordingToCriteria.go)   
[2543. Check if Point Is Reachable](./leetcode/2543-CheckIfPointIsReachable.go)   
[2544. Alternating Digit Sum](./leetcode/2544-AlternatingDigitSum.go)   
[2550. Count Collisions of Monkeys on a Polygon](./leetcode/2550-CountCollisionsOfMonkeysOnAPolygon.go)   
[2566. Maximum Difference by Remapping a Digit](./leetcode/2566-MaximumDifferenceByRemappingADigit.go)   
[2571. Minimum Operations to Reduce an Integer to 0](./leetcode/2571-MinimumOperationsToReduceAnIntegerTo0.go)   
[2578. Split With Minimum Sum](./leetcode/2578-SplitWithMinimumSum.go)   
[2579. Count Total Number of Colored Cells](./leetcode/2579-CountTotalNumberOfColoredCells.go)   
[2582. Pass the Pillow](./leetcode/2582-PassThePillowd.go)   
[2591. Distribute Money to Maximum Children](./leetcode/2591-DistributeMoneyToMaximumChildren.go)   
[2595. Number of Even and Odd Bits](./leetcode/2595-NumberOfEvenAndOddBits.go)   
[2600. K Items With the Maximum Sum](./leetcode/2600-KItemsWithTheMaximumSum.go)   
[2601. Prime Subtraction Operation](./leetcode/2601-PrimeSubtractionOperation.go)   
[2647. Color the Triangle Red](./leetcode/2647-ColorTheTriangleRed.go)   
[2651. Calculate Delayed Arrival Time](./leetcode/2651-CalculateDelayedArrivalTime.go)   
[2652. Sum Multiples](./leetcode/2652-SumMultiples.go)   
[2682. Find the Losers of the Circular Game](./leetcode/2682-FindTheLosersOfTheCircularGame.go)   
[2698. Find the Punishment Number of an Integer](./leetcode/2698-FindThePunishmentNumberOfAnInteger.go)   
[2729. Check if The Number is Fascinating](./leetcode/2729-CheckIfTheNumberIsFascinating.go)   
[2739. Total Distance Traveled](./leetcode/2739-TotalDistanceTraveled.go)   
[2749. Minimum Operations to Make the Integer Zero](./leetcode/2749-MinimumOperationsToMakeTheIntegerZero.go)   
[2745. Construct the Longest New String](./leetcode/2745-ConstructTheLongestNewString.go)   
[2761. Prime Pairs With Target Sum](./leetcode/2761-PrimePairsWithTargetSum.go)   
[2769. Find the Maximum Achievable Number](./leetcode/2769-FindTheMaximumAchievableNumber.go)   
[2802. Find The K-th Lucky Number](./leetcode/2802-FindTheKthLuckyNumber.go)   
[2806. Account Balance After Rounded Purchase](./leetcode/2806-AccountBalanceAfterRoundedPurchase.go)   
[2827. Number of Beautiful Integers in the Range](./leetcode/2827-NumberOfBeautifulIntegersInTheRange.go)   
[2829. Determine the Minimum Sum of a k-avoiding Array](./leetcode/2829-DetermineTheMinimumSumOfAKAvoidingArray.go)   
[2834. Find the Minimum Possible Sum of a Beautiful Array](./leetcode/2834-FindTheMinimumPossibleSumOfABeautifulArray.go)    
[2843. Count Symmetric Integers](./leetcode/2843-CountSymmetricIntegers.go)   
[2847. Smallest Number With Given Digit Product](./leetcode/2847-SmallestNumberWithGivenDigitProduct.go)   
[2849. Determine if a Cell Is Reachable at a Given Time](./leetcode/2849-DetermineIfACellIsReachableAtAGivenTime.go)   
[2894. Divisible and Non-divisible Sums Difference](./leetcode/2894-DivisibleAndNonDivisibleSumsDifference.go)   
[2927. Distribute Candies Among Children III](./leetcode/2927-DistributeCandiesAmongChildrenIII.go)   
[2928. Distribute Candies Among Children I](./leetcode/2928-DistributeCandiesAmongChildrenI.go)   
[2929. Distribute Candies Among Children II](./leetcode/2929-DistributeCandiesAmongChildrenII.go)   
[2930. Number of Strings Which Can Be Rearranged to Contain Substring](./leetcode/2930-NumberOfStringsWhichCanBeRearrangedToContainSubstring.go)   
[2939. Maximum Xor Product](./leetcode/2939-MaximumXorProduct.go)   
[2979. Most Expensive Item That Can Not Be Bought](./leetcode/2979-MostExpensiveItemThatCanNotBeBought.go)   
[2992. Number of Self-Divisible Permutations](./leetcode/2992-NumberOfSelfDivisiblePermutations.go)   
[2999. Count the Number of Powerful Integers](./leetcode/2999-CountTheNumberOfPowerfulIntegers.go)   
[3009. Maximum Number of Intersections on the Chart](./leetcode/3009-MaximumNumberOfIntersectionsOnTheChart.go)   
[3021. Alice and Bob Playing Flower Game](./leetcode/3021-AliceAndBobPlayingFlowerGame.go)   
[3024. Type of Triangle](./leetcode/3024-TypeOfTriangle.go)   
[3032. Count Numbers With Unique Digits II](./leetcode/3032-CountNumbersWithUniqueDigitsII.go)   
[3091. Apply Operations to Make Sum of Array Greater Than or Equal to k](./leetcode/3091-ApplyOperationsToMakeSumOfArrayGreaterThanOrEqualToK.go)   
[3099. Harshad Number](./leetcode/3099-HarshadNumber.go)   
[3100. Water Bottles II](./leetcode/3100-WaterBottlesII.go)   
[3102. Minimize Manhattan Distances](./leetcode/3102-MinimizeManhattanDistances.go)   
[3128. Right Triangles](./leetcode/3128-RightTriangles.go)   
[3154. Find Number of Ways to Reach the K-th Stair](./leetcode/3154-FindNumberOfWaysToReachTheKthStair.go)   
[3155. Maximum Number of Upgradable Servers](./leetcode/3155-MaximumNumberOfUpgradableServers.go)   
[3162. Find the Number of Good Pairs I](./leetcode/3162-FindTheNumberOfGoodPairsI.go)   
[3164. Find the Number of Good Pairs II](./leetcode/3164-FindTheNumberOfGoodPairsII.go)   
[3178. Find the Child Who Has the Ball After K Seconds](./leetcode/3178-FindTheChildWhoHasTheBallAfterKSeconds.go)   
[3179. Find the N-th Value After K Seconds](./leetcode/3179-FindTheNthValueAfterKSeconds.go)   
[3200. Maximum Height of a Triangle](./leetcode/3200-MaximumHeightOfATriangle.go)   
[3222. Find the Winning Player in Coin Game](./leetcode/3222-FindTheWinningPlayerInCoinGame.go)   
[3233. Find the Count of Numbers Which Are Not Special](./leetcode/3233-FindTheCountOfNumbersWhichAreNotSpecial.go)   
[3235. Check if the Rectangle Corner Is Reachable](./leetcode/3235-CheckIfTheRectangleCornerIsReachable.go)   
[3250. Find the Count of Monotonic Pairs I](./leetcode/3250-FindTheCountOfMonotonicPairsI.go)   
[3251. Find the Count of Monotonic Pairs II](./leetcode/3251-FindTheCountOfMonotonicPairsII.go)   
[3260. Find the Largest Palindrome Divisible by K](./leetcode/3260-FindTheLargestPalindromeDivisibleByK.go)   
[3270. Find the Key of the Numbers](./leetcode/3270-FindTheKeyOfTheNumbers.go)   
[3272. Find the Count of Good Integers](./leetcode/3272-FindTheCountOfGoodIntegers.go)   
[3300. Minimum Element After Replacement With Digit Sum](./leetcode/3300-MinimumElementAfterReplacementWithDigitSum.go)   
[3304. Find the K-th Character in String Game I](./leetcode/3304-FindTheKthCharacterInStringGameI.go)   
[3307. Find the K-th Character in String Game II](./leetcode/3307-FindTheKthCharacterInStringGameII.go)   
[3317. Find the Number of Possible Ways for an Event](./leetcode/3317-FindTheNumberOfPossibleWaysForAnEvent.go)   
[3345. Smallest Divisible Digit Product I](./leetcode/3345-SmallestDivisibleDigitProductI.go)   
[3360. Stone Removal Game](./leetcode/3360-StoneRemovalGame.go)   
[3370. Smallest Number With All Set Bits](./leetcode/3370-SmallestNumberWithAllSetBits.go)   
[3377. Digit Operations to Make Two Integers Equal](./leetcode/3377-DigitOperationsToMakeTwoIntegersEqual.go)   
[3395. Subsequences with a Unique Middle Mode I](./leetcode/3395-SubsequencesWithAUniqueMiddleModeI.go)   
[3405. Count the Number of Arrays with K Matching Adjacent Elements](./leetcode/3405-CountTheNumberOfArraysWithKMatchingAdjacentElements.go)   
[3416. Subsequences with a Unique Middle Mode II](./leetcode/3416-SubsequencesWithAUniqueMiddleModeII.go)   
[3426. Manhattan Distances of All Arrangements of Pieces](./leetcode/3426-ManhattanDistancesOfAllArrangementsOfPieces.go)   
[3437. Permutations III](./leetcode/3437-PermutationsIII.go)   
[3470. Permutations IV](./leetcode/3470-PermutationsIV.go)   
[3490. Count Beautiful Numbers](./leetcode/3490-CountBeautifulNumbers.go)   
[3492. Maximum Containers on a Ship](./leetcode/3492-MaximumContainersOnAShip.go)   
[3516. Find Closest Person](./leetcode/3516-FindClosestPerson.go)   
[3536. Maximum Product of Two Digits](./leetcode/3536-MaximumProductOfTwoDigits.go)   
[3537. Fill a Special Grid](./leetcode/3537-FillASpecialGrid.go)   
[3560. Find Minimum Log Transportation Cost](./leetcode/3560-FindMinimumLogTransportationCost.go)   
[3581. Count Odd Letters from Number](./leetcode/3581-CountOddLettersFromNumber.go)   
[3596. Minimum Cost Path with Alternating Directions I](./leetcode/3596-MinimumCostPathWithAlternatingDirectionsI.go)   
[3602. Hexadecimal and Hexatrigesimal Conversion](./leetcode/3602-HexadecimalAndHexatrigesimalConversion.go)   
[3621. Number of Integers With Popcount-Depth Equal to K I](./leetcode/3621-NumberOfIntegersWithPopcountDepthEqualToKI.go)   
[3622. Check Divisibility by Digit Sum and Product](./leetcode/3622-CheckDivisibilityByDigitSumAndProduct.go)   
[3624. Number of Integers With Popcount-Depth Equal to K II](./leetcode/3624-NumberOfIntegersWithPopcountDepthEqualToKII.go)   
[3646. Next Special Palindrome Number](./leetcode/3646-NextSpecialPalindromeNumber.go)   
[3658. GCD of Odd and Even Sums](./leetcode/3658-GCDOfOddAndEvenSums.go)   
[3677. Count Binary Palindromic Numbers](./leetcode/3677-CountBinaryPalindromicNumbers.go)   
[3680. Generate Schedule](./leetcode/3680-GenerateSchedule.go)   
[3697. Compute Decimal Representation](./leetcode/3697-ComputeDecimalRepresentation.go)   
[3699. Number of ZigZag Arrays I](./leetcode/3699-NumberOfZigZagArraysI.go)   
[3700. Number of ZigZag Arrays II](./leetcode/3700-NumberOfZigZagArraysII.go)   
[3704. Count No-Zero Pairs That Sum to N](./leetcode/3704-CountNoZeroPairsThatSumToN.go)   
[3723. Maximize Sum of Squares of Digits](./leetcode/3723-MaximizeSumOfSquaresOfDigits.go)   
[3726. Remove Zeros in Decimal Representation](./leetcode/3726-RemoveZerosInDecimalRepresentation.go)   
[3747. Count Distinct Integers After Removing Zeros](./leetcode/3747-CountDistinctIntegersAfterRemovingZeros.go)   
[3750. Minimum Number of Flips to Reverse Binary String](./leetcode/3750-MinimumNumberOfFlipsToReverseBinaryString.go)   
[3751. Total Waviness of Numbers in Range I](./leetcode/3751-TotalWavinessOfNumbersInRangeI.go)   
[3752. Lexicographically Smallest Negated Permutation that Sums to Target](./leetcode/3752-LexicographicallySmallestNegatedPermutationThatSumsToTarget.go)   
[3753. Total Waviness of Numbers in Range II](./leetcode/3753-TotalWavinessOfNumbersInRangeII.go)   
[3754. Concatenate Non-Zero Digits and Multiply by Sum I](./leetcode/3754-ConcatenateNonZeroDigitsAndMultiplyBySumI.go)   
[3765. Complete Prime Number](./leetcode/3765-CompletePrimeNumber.go)   
[3770. Largest Prime from Consecutive Prime Sum](./leetcode/3770-LargestPrimeFromConsecutivePrimeSum.go)   
[3782. Last Remaining Integer After Alternating Deletion Operations](./leetcode/3782-LastRemainingIntegerAfterAlternatingDeletionOperations.go)   
[3783. Mirror Distance of an Integer](./leetcode/3783-MirrorDistanceOfAnInteger.go)   
[3789. Minimum Cost to Acquire Required Items](./leetcode/3789-MinimumCostToAcquireRequiredItems.go)   
[3790. Smallest All-Ones Multiple](./leetcode/3790-SmallestAllOnesMultiple.go)   
[3791. Number of Balanced Integers in a Range](./leetcode/3791-NumberOfBalancedIntegersInARange.go)   
[3792. Sum of Increasing Product Blocks](./leetcode/3792-SumOfIncreasingProductBlocks.go)   
[3821. Find Nth Smallest Integer With K One Bits](./leetcode/3821-FindNthSmallestIntegerWithKOneBits.go)   
[3827. Count Monobit Integers](./leetcode/3827-CountMonobitIntegers.go)   
[3848. Check Digitorial Permutation](./leetcode/3848-CheckDigitorialPermutation.go)   
[3855. Sum of K-Digit Numbers in a Range](./leetcode/3855-SumOfKDigitNumbersInARange.go)   
[3857. Minimum Cost to Split into Ones](./leetcode/3857-MinimumCostToSplitIntoOnes.go)   
[3869. Count Fancy Numbers in a Range](./leetcode/3869-CountFancyNumbersInRange.go)   
[3870. Count Commas in Range](./leetcode/3870-CountCommasInRange.go)   
[3871. Count Commas in Range II](./leetcode/3871-CountCommasInRangeII.go)   
[3881. Direction Assignments with Exactly K Visible People](./leetcode/3881-DirectionAssignmentsWithExactlyKVisiblePeople.go)   
[3890. Integers With Multiple Sum of Two Cubes](./leetcode/3890-IntegersWithMultipleSumOfTwoCubes.go)   
[3894. Traffic Signal Color](./leetcode/3894-TrafficSignalColor.go)   
[3908. Valid Digit Number](./leetcode/3908-ValidDigitNumber.go)   
[3916. Number of ZigZag Arrays III](./leetcode/3916-NumberOfZigZagArraysIII.go)   
[3918. Sum of Primes Between Number and Its Reverse](./leetcode/3918-SumOfPrimesBetweenNumberAndItsReverse.go)   
[3932. Count K-th Roots in a Range](./leetcode/3932-CountKthRootsInRange.go)   
[3945. Digit Frequency Score](./leetcode/3945-DigitFrequencyScore.go)   
[3950. Exactly One Consecutive Set Bits Pair](./leetcode/3950-ExactlyOneConsecutiveSetBitsPair.go)   
[3954. Sum of Compatible Numbers in Range I](./leetcode/3954-SumOfCompatibleNumbersInRangeI.go)   
[3955. Valid Binary Strings With Cost Limit](./leetcode/3955-ValidBinaryStringsWithCostLimit.go)   
[3958. Minimum Cost to Split into Ones II](./leetcode/3958-MinimumCostToSplitIntoOnesII.go)   
[3959. Check Good Integer](./leetcode/3959-CheckGoodInteger.go)   
[3963. Create Grid With Exactly One Path](./leetcode/3963-CreateGridWithExactlyOnePath.go)   
[3966. Count Good Integers in a Range](./leetcode/3966-CountGoodIntegersInRange.go)   
[3988. Create Grid With Exactly K Paths I](./leetcode/3988-CreateGridWithExactlyKPathsI.go)   
[3990. Create Grid With Exactly K Paths II](./leetcode/3990-CreateGridWithExactlyKPathsII.go)   
[3993. Maximum Value of an Alternating Sequence](./leetcode/3993-MaximumValueOfAnAlternatingSequence.go)   
[3994. Minimum Adjacent Swaps to Partition Array](./leetcode/3994-MinimumAdjacentSwapsToPartitionArray.go)   
[4000. Largest Integer With Given Digit Sum](./leetcode/4000-LargestIntegerWithGivenDigitSum.go)   
[4002. Count Valid Sequences](./leetcode/4002-CountValidSequences.go)   
[4022. K-th Digit in Infinite String](./leetcode/4022-KthDigitInInfiniteString.go)   
[4034. Minimum Bishop Moves to Reach Target](./leetcode/4034-MinimumBishopMovesToReachTarget.go)   
[4050. Minimum Days to Score Exactly N Points](./leetcode/4050-MinimumDaysToScoreExactlyNPoints.go)   

# Stack
[225. Implement Stack using Queues](./leetcode/225-ImplementStackUsingQueues.go)   
[232. Implement Queue using Stacks](./leetcode/232-ImplementQueueUsingStacks.go)   
[321. Create Maximum Number](./leetcode/321-CreateMaximumNumber.go)   
[339. Nested List Weight Sum](./leetcode/339-NestedListWeightSum.go)   
[364. Nested List Weight Sum II](./leetcode/364-NestedListWeightSumII.go)   

# Tree
[94. Binary Tree Inorder Traversal](./leetcode/94-BinaryTreeInorderTraversal.go)   
[95. Unique Binary Search Trees II](./leetcode/95-UniqueBinarySearchTreesII.go)   
[96. Unique Binary Search Trees](./leetcode/96-UniqueBinarySearchTrees.go)   
[99. Recover Binary Search Tree](./leetcode/99-RecoverBinarySearchTree.go)   
[100. Same Tree](./leetcode/100-SameTree.go)   
[101. Symmetric Tree](./leetcode/101-SymmetricTree.go)      
[102. Binary Tree Level Order Traversal](./leetcode/102-BinaryTreeLevelOrderTraversal.go)   
[103. Binary Tree Zigzag Level Order Traversal](./leetcode/103-BinaryTreeZigzagLevelOrderTraversal.go)   
[104. Maximum Depth of Binary Tree](./leetcode/104-MaximumDepthOfBinaryTree.go)   
[107. Binary Tree Level Order Traversal II](./leetcode/107-BinaryTreeLevelOrderTraversalII.go)   
[109. Convert Sorted List to Binary Search Tree](./leetcode/109-ConvertSortedListToBinarySearchTree.go)   
[110. Balanced Binary Tree](./leetcode/110-BalancedBinaryTree.go)   
[111. Minimum Depth of Binary Tree](./leetcode/111-MinimumDepthOfBinaryTree.go)   
[112. Path Sum](./leetcode/112-PathSum.go)   
[113. Path Sum II](./leetcode/113-PathSumII.go)   
[114. Flatten Binary Tree to Linked List](./leetcode/114-FlattenBinaryTreeToLinkedList.go)   
[116. Populating Next Right Pointers in Each Node](./leetcode/116-PopulatingNextRightPointersInEachNode.go)   
[117. Populating Next Right Pointers in Each Node II](./leetcode/117-PopulatingNextRightPointersInEachNodeII.go)   
[124. Binary Tree Maximum Path Sum](./leetcode/124-BinaryTreeMaximumPathSum.go)   
[129. Sum Root to Leaf Numbers](./leetcode/129-SumRootToLeafNumbers.go)   
[144. Binary Tree Preorder Traversal](./leetcode/144-BinaryTreePreorderTraversal.go)   
[145. Binary Tree Postorder Traversal](./leetcode/145-BinaryTreePostorderTraversal.go)   
[156. Binary Tree Upside Down](./leetcode/156-BinaryTreeUpsideDown.go)   
[173. Binary Search Tree Iterator](./leetcode/173-BinarySearchTreeIterator.go)   
[199. Binary Tree Right Side View](./leetcode/199-BinaryTreeRightSideView.go)   
[222. Count Complete Tree Nodes](./leetcode/222-CountCompleteTreeNodes.go)   
[226. Invert Binary Tree](./leetcode/226-InvertBinaryTree.go)   
[230. Kth Smallest Element in a BST](./leetcode/230-KthSmallestElementInABST.go)   
[235. Lowest Common Ancestor of a Binary Search Tree](./leetcode/235-LowestCommonAncestorOfABinarySearchTree.go)   
[236. Lowest Common Ancestor of a Binary Tree](./leetcode/236-LowestCommonAncestorOfABinaryTree.go)   
[250. Count Univalue Subtrees](./leetcode/250-CountUnivalueSubtrees.go)   
[255. Verify Preorder Sequence in Binary Search Tree](./leetcode/255-VerifyPreorderSequenceInBinarySearchTree.go)   
[257. Binary Tree Paths](./leetcode/257-BinaryTreePaths.go)   
[270. Closest Binary Search Tree Value](./leetcode/270-ClosestBinarySearchTreeValue.go)   
[272. Closest Binary Search Tree Value II](./leetcode/272-ClosestBinarySearchTreeValueII.go)   
[285. Inorder Successor in BST](./leetcode/285-InorderSuccessorInBST.go)   
[298. Binary Tree Longest Consecutive Sequence](./leetcode/298-BinaryTreeLongestConsecutiveSequence.go)   
[314. Binary Tree Vertical Order Traversal](./leetcode/314-BinaryTreeVerticalOrderTraversal.go)   
[331. Verify Preorder Serialization of a Binary Tree](./leetcode/331-VerifyPreorderSerializationOfABinaryTree.go)   
[333. Largest BST Subtree](./leetcode/333-LargestBSTSubtree.go)   
[337. House Robber III](./leetcode/337-HouseRobberIII.go)   
[366. Find Leaves of Binary Tree](./leetcode/366-FindLeavesOfBinaryTree.go)   
[404. Sum of Left Leaves](./leetcode/404-SumOfLeftLeaves.go)   
[426. Convert Binary Search Tree to Sorted Doubly Linked List](./leetcode/426-ConvertBinarySearchTreeToSortedDoublyLinkedList.go)   
[427. Construct Quad Tree](./leetcode/427-ConstructQuadTree.go)   
[429. N-ary Tree Level Order Traversal](./leetcode/429-N-aryTreeLevelOrderTraversal.go)   
[437. Path Sum III](./leetcode/437-PathSumIII.go)   
[449. Serialize and Deserialize BST](./leetcode/449-SerializeAndDeserializeBST.go)   
[450. Delete Node in a BST](./leetcode/450-DeleteNodeInABST.go)   
[501. Find Mode in Binary Search Tree](./leetcode/501-FindModeInBinarySearchTree.go)   
[508. Most Frequent Subtree Sum](./leetcode/508-MostFrequentSubtreeSum.go)   
[510. Inorder Successor in BST II](./leetcode/510-InorderSuccessorInBSTII.go)   
[513. Find Bottom Left Tree Value](./leetcode/513-FindBottomLeftTreeValue.go)   
[515. Find Largest Value in Each Tree Row](./leetcode/515-FindLargestValueInEachTreeRow.go)   
[530. Minimum Absolute Difference in BST](./leetcode/530-MinimumAbsoluteDifferenceInBST.go)   
[538. Convert BST to Greater Tree](./leetcode/538-ConvertBSTtoGreaterTree.go)   
[543. Diameter of Binary Tree](./leetcode/543-DiameterOfBinaryTree.go)   
[545. Boundary of Binary Tree](./leetcode/545-BoundaryOfBinaryTree.go)   
[549. Binary Tree Longest Consecutive Sequence II](./leetcode/549-BinaryTreeLongestConsecutiveSequenceII.go)   
[558. Logical OR of Two Binary Grids Represented as Quad-Trees](./leetcode/558-LogicalOROfTwoBinaryGridsRepresentedAsQuad-Trees.go)   
[559. Maximum Depth of N-ary Tree](./leetcode/559-MaximumDepthOfN-AryTree.go)   
[563. Binary Tree Tilt](./leetcode/563-BinaryTreeTilt.go)   
[572. Subtree of Another Tree](./leetcode/572-SubtreeOfAnotherTree.go)   
[582. Kill Process](./leetcode/582-KillProcess.go)   
[589. N-ary Tree Preorder Traversal](./leetcode/589-N-aryTreePreorderTraversal.go)   
[590. N-ary Tree Postorder Traversal](./leetcode/590-N-aryTreePostorderTraversal.go)   
[606. Construct String from Binary Tree](./leetcode/606-ConstructStringFromBinaryTree.go)   
[617. Merge Two Binary Trees](./leetcode/617-MergeTwoBinaryTrees.go)   
[623. Add One Row to Tree](./leetcode/623-AddOneRowToTree.go)   
[637. Average of Levels in Binary Tree](./leetcode/637-AverageOfLevelsInBinaryTree.go)   
[652. Find Duplicate Subtrees](./leetcode/652-FindDuplicateSubtrees.go)   
[653. Two Sum IV - Input is a BST](./leetcode/653-TwoSumIV-InputIsABST.go)   
[654. Maximum Binary Tree](./leetcode/654-MaximumBinaryTree.go)   
[655. Print Binary Tree](./leetcode/655-PrintBinaryTree.go)   
[662. Maximum Width of Binary Tree](./leetcode/662-MaximumWidthOfBinaryTree.go)   
[663. Equal Tree Partition](./leetcode/663-EqualTreePartition.go)   
[669. Trim a Binary Search Tree](./leetcode/669-TrimABinarySearchTree.go)   
[671. Second Minimum Node In a Binary Tree](./leetcode/671-SecondMinimumNodeInABinaryTree.go)   
[687. Longest Univalue Path](./leetcode/687-LongestUnivaluePath.go)   
[700. Search in a Binary Search Tree](./leetcode/700-SearchInABinarySearchTree.go)   
[701. Insert into a Binary Search Tree](./leetcode/701-InsertIntoABinarySearchTree.go)   
[742. Closest Leaf in a Binary Tree](./leetcode/742-ClosestLeafInABinaryTree.go)   
[776. Split BST](./leetcode/776-SplitBST.go)   
[783. Minimum Distance Between BST Nodes](./leetcode/783-MinimumDistanceBetweenBSTNodes.go)   
[814. Binary Tree Pruning](./leetcode/814-BinaryTreePruning.go)   
[834. Sum of Distances in Tree](./leetcode/834-SumOfDistancesInTree.go)   
[863. All Nodes Distance K in Binary Tree](./leetcode/863-AllNodesDistanceKInBinaryTree.go)   
[865. Smallest Subtree with all the Deepest Nodes](./leetcode/865-SmallestSubtreeWithAllTheDeepestNodes.go)   
[872. Leaf-Similar Trees](./leetcode/872-Leaf-SimilarTrees.go)   
[889. Construct Binary Tree from Preorder and Postorder Traversal ](./leetcode/889-ConstructBinaryTreeFromPreorderAndPostorderTraversal.go)   
[894. All Possible Full Binary Trees](./leetcode/894-AllPossibleFullBinaryTrees.go)   
[897. Increasing Order Search Tree](./leetcode/897-IncreasingOrderSearchTree.go)   
[919. Complete Binary Tree Inserter](./leetcode/919-CompleteBinaryTreeInserter.go)   
[938. Range Sum of BST](./leetcode/938-RangeSumOfBST.go)   
[951. Flip Equivalent Binary Trees](./leetcode/951-FlipEquivalentBinaryTrees.go)   
[958. Check Completeness of a Binary Tree](./leetcode/958-CheckCompletenessOfABinaryTree.go)   
[965. Univalued Binary Tree](./leetcode/965-UnivaluedBinaryTree.go)   
[968. Binary Tree Cameras](./leetcode/968-BinaryTreeCameras.go)   
[971. Flip Binary Tree To Match Preorder Traversal](./leetcode/971-FlipBinaryTreeToMatchPreorderTraversal.go)   
[979. Distribute Coins in Binary Tree](./leetcode/979-DistributeCoinsInBinaryTree.go)   
[987. Vertical Order Traversal of a Binary Tree](./leetcode/987-VerticalOrderTraversalOfABinaryTree.go)   
[988. Smallest String Starting From Leaf](./leetcode/988-SmallestStringStartingFromLeaf.go)   
[993. Cousins in Binary Tree](./leetcode/993-CousinsInBinaryTree.go)   
[998. Maximum Binary Tree II](./leetcode/998-MaximumBinaryTreeII.go)   
[1008. Construct Binary Search Tree from Preorder Traversal](./leetcode/1008-ConstructBinarySearchTreeFromPreorderTraversal.go)   
[1022. Sum of Root To Leaf Binary Numbers](./leetcode/1022-SumOfRootToLeafBinaryNumbers.go)   
[1026. Maximum Difference Between Node and Ancestor](./leetcode/1026-MaximumDifferenceBetweenNodeAndAncestor.go)   
[1028. Recover a Tree From Preorder Traversal](./leetcode/1028-RecoverATreeFromPreorderTraversal.go)   
[1038. Binary Search Tree to Greater Sum Tree](./leetcode/1038-BinarySearchTreeToGreaterSumTree.go)   
[1080. Insufficient Nodes in Root to Leaf Paths](./leetcode/1080-InsufficientNodesInRootToLeafPaths.go)   
[1110. Delete Nodes And Return Forest](./leetcode/1110-DeleteNodesAndReturnForest.go)   
[1120. Maximum Average Subtree](./leetcode/1120-MaximumAverageSubtree.go)   
[1123. Lowest Common Ancestor of Deepest Leaves](./leetcode/1123-LowestCommonAncestorOfDeepestLeaves.go)   
[1145. Binary Tree Coloring Game](./leetcode/1145-BinaryTreeColoringGame.go)   
[1161. Maximum Level Sum of a Binary Tree](./leetcode/1161-MaximumLevelSumOfABinaryTree.go)   
[1214. Two Sum BSTs](./leetcode/1214-TwoSumBSTs.go)   
[1261. Find Elements in a Contaminated Binary Tree](./leetcode/1261-FindElementsInAContaminatedBinaryTree.go)   
[1302. Deepest Leaves Sum](./leetcode/1302-DeepestLeavesSum.go)   
[1305. All Elements in Two Binary Search Trees](./leetcode/1305-AllElementsInTwoBinarySearchTrees.go)   
[1315. Sum of Nodes with Even-Valued Grandparent](./leetcode/1315-SumOfNodesWithEvenValuedGrandparent.go)   
[1325. Delete Leaves With a Given Value](./leetcode/1325-DeleteLeavesWithAGivenValue.go)   
[1339. Maximum Product of Splitted Binary Tree](./leetcode/1339-MaximumProductOfSplittedBinaryTree.go)   
[1361. Validate Binary Tree Nodes](./leetcode/1361-ValidateBinaryTreeNodes.go)   
[1367. Linked List in Binary Tree](./leetcode/1367-LinkedListInBinaryTree.go)   
[1372. Longest ZigZag Path in a Binary Tree](./leetcode/1372-LongestZigZagPathInABinaryTree.go)   
[1373. Maximum Sum BST in Binary Tree](./leetcode/1373-MaximumSumBSTInBinaryTree.go)   
[1376. Time Needed to Inform All Employees](./leetcode/1376-TimeNeededToInformAllEmployees.go)   
[1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree](./leetcode/1379-FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.go)   
[1382. Balance a Binary Search Tree](./leetcode/1382-BalanceABinarySearchTree.go)   
[1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](./leetcode/1430-CheckIfAStringIsAValidSequenceFromRootToLeavesPathInABinaryTree.go)   
[1448. Count Good Nodes in Binary Tree](./leetcode/1448-CountGoodNodesInBinaryTree.go)   
[1457. Pseudo-Palindromic Paths in a Binary Tree](./leetcode/1457-PseudoPalindromicPathsInABinaryTree.go)   
[1469. Find All The Lonely Nodes](./leetcode/1469-FindAllTheLonelyNodes.go)   
[1483. Kth Ancestor of a Tree Node](./leetcode/1483-KthAncestorOfATreeNode.go)   
[1485. Clone Binary Tree With Random Pointer](./leetcode/1485-CloneBinaryTreeWithRandomPointer.go)   
[1490. Clone N-ary Tree](./leetcode/1490-CloneN-AryTree.go)   
[1506. Find Root of N-Ary Tree](./leetcode/1506-FindRootOfN-AryTree.go)   
[1516. Move Sub-Tree of N-Ary Tree](./leetcode/1516-MoveSubTreeOfNAryTree.go)   
[1519. Number of Nodes in the Sub-Tree With the Same Label](./leetcode/1519-NumberOfNodesInTheSubTreeWithTheSameLabel.go)   
[1522. Diameter of N-Ary Tree](./leetcode/1522-DiameterOfN-AryTree.go)   
[1530. Number of Good Leaf Nodes Pairs](./leetcode/1530-NumberOfGoodLeafNodesPairs.go)   
[1569. Number of Ways to Reorder Array to Get Same BST](./leetcode/1569-NumberOfWaysToReorderArrayToGetSameBST.go)   
[1602. Find Nearest Right Node in Binary Tree](./leetcode/1602-FindNearestRightNodeInBinaryTree.go)   
[1609. Even Odd Tree](./leetcode/1609-EvenOddTree.go)   
[1612. Check If Two Expression Trees are Equivalent](./leetcode/1612-CheckIfTwoExpressionTreesAreEquivalent.go)   
[1617. Count Subtrees With Max Distance Between Cities](./leetcode/1617-CountSubtreesWithMaxDistanceBetweenCities.go)   
[1644. Lowest Common Ancestor of a Binary Tree II](./leetcode/1644-LowestCommonAncestorOfABinaryTreeII.go)   
[1650. Lowest Common Ancestor of a Binary Tree III](./leetcode/1650-LowestCommonAncestorOfABinaryTreeIII.go)   
[1660. Correct a Binary Tree](./leetcode/1660-CorrectABinaryTree.go)   
[1666. Change the Root of a Binary Tree](./leetcode/1666-ChangeTheRootOfABinaryTree.go)   
[1676. Lowest Common Ancestor of a Binary Tree IV](./leetcode/1676-LowestCommonAncestorOfABinaryTreeIV.go)   
[1740. Find Distance in a Binary Tree](./leetcode/1740-FindDistanceInABinaryTree.go)   
[1902. Depth of BST Given Insertion Order](./leetcode/1902-DepthOfBSTGivenInsertionOrder.go)   
[1932. Merge BSTs to Create Single BST](./leetcode/1932-MergeBSTsToCreateSingleBST.go)   
[1973. Count Nodes Equal to Sum of Descendants](./leetcode/1973-CountNodesEqualToSumOfDescendants.go)   
[2003. Smallest Missing Genetic Value in Each Subtree](./leetcode/2003-SmallestMissingGeneticValueInEachSubtree.go)   
[2005. Subtree Removal Game with Fibonacci Tree](./leetcode/2005-SubtreeRemovalGameWithFibonacciTree.go)   
[2096. Step-By-Step Directions From a Binary Tree Node to Another](./leetcode/2096-StepByStepDirectionsFromABinaryTreeNodeToAnother.go)   
[2196. Create Binary Tree From Descriptions](./leetcode/2196-CreateBinaryTreeFromDescriptions.go)   
[2236. Root Equals Sum of Children](./leetcode/2236-RootEqualsSumOfChildren.go)   
[2265. Count Nodes Equal to Average of Subtree](./leetcode/2265-CountNodesEqualToAverageOfSubtree.go)   
[2277. Closest Node to Path in Tree](./leetcode/2277-ClosestNodeToPathInTree.go)   
[2313. Minimum Flips in Binary Tree to Get Result](./leetcode/2313-MinimumFlipsInBinaryTreeToGetResult.go)   
[2331. Evaluate Boolean Binary Tree](./leetcode/2331-EvaluateBooleanBinaryTree.go)   
[2378. Choose Edges to Maximize Score in a Tree](./leetcode/2378-ChooseEdgesToMaximizeScoreInATree.go)   
[2385. Amount of Time for Binary Tree to Be Infected](./leetcode/2385-AmountOfTimeForBinaryTreeToBeInfected.go)   
[2415. Reverse Odd Levels of Binary Tree](./leetcode/2415-ReverseOddLevelsOfBinaryTree.go)   
[2421. Number of Good Paths](./leetcode/2421-NumberOfGoodPaths.go)   
[2445. Number of Nodes With Value One](./leetcode/2445-NumberOfNodesWithValueOne.go)   
[2458. Height of Binary Tree After Subtree Removal Queries](./leetcode/2458-HeightOfBinaryTreeAfterSubtreeRemovalQueries.go)   
[2467. Most Profitable Path in a Tree](./leetcode/2467-MostProfitablePathInATree.go)   
[2471. Minimum Number of Operations to Sort a Binary Tree by Level](./leetcode/2471-MinimumNumberOfOperationsToSortABinaryTreeByLevel.go)   
[2476. Closest Nodes Queries in a Binary Search Tree](./leetcode/2476-ClosestNodesQueriesInABinarySearchTree.go)   
[2509. Cycle Length Queries in a Tree](./leetcode/2509-CycleLengthQueriesInATree.go)   
[2581. Count Number of Possible Root Nodes](./leetcode/2581-CountNumberOfPossibleRootNodes.go)   
[2583. Kth Largest Sum in a Binary Tree](./leetcode/2583-KthLargestSumInABinaryTree.go)   
[2603. Collect Coins in a Tree](./leetcode/2603-CollectCoinsInATree.go)   
[2641. Cousins in Binary Tree II](./leetcode/2641-CousinsInBinaryTreeII.go)   
[2646. Minimize the Total Price of the Trips](./leetcode/2646-MinimizeTheTotalPriceOfTheTrips.go)   
[2673. Make Costs of Paths Equal in a Binary Tree](./leetcode/2673-MakeCostsOfPathsEqualInABinaryTree.go)   
[2689. Extract Kth Character From The Rope Tree](./leetcode/2689-ExtractKthCharacterFromTheRopeTree.go)   
[2709. Greatest Common Divisor Traversal](./leetcode/2709-GreatestCommonDivisorTraversal.go)   
[2764. Is Array a Preorder of Some ‌Binary Tree](./leetcode/2764-IsArrayAPreorderOfSomeBinaryTree.go)   
[2773. Height of Special Binary Tree](./leetcode/2773-HeightOfSpecialBinaryTree.go)   
[2791. Count Paths That Can Form a Palindrome in a Tree](./leetcode/2791-CountPathsThatCanFormAPalindromeInATree.go)   
[2792. Count Nodes That Are Great Enough](./leetcode/2792-CountNodesThatAreGreatEnough.go)   
[2846. Minimum Edge Weight Equilibrium Queries in a Tree](./leetcode/2846-MinimumEdgeWeightEquilibriumQueriesInATree.go)   
[2867. Count Valid Paths in a Tree](./leetcode/2867-CountValidPathsInATree.go)   
[2872. Maximum Number of K-Divisible Components](./leetcode/2872-MaximumNumberOfKDivisibleComponents.go)   
[2925. Maximum Score After Applying Operations on a Tree](./leetcode/2925-MaximumScoreAfterApplyingOperationsOnATree.go)   
[2973. Find Number of Coins to Place in Tree Nodes](./leetcode/2973-FindNumberOfCoinsToPlaceInTreeNodes.go)   
[3157. Find the Level of Tree with Minimum Sum](./leetcode/3157-FindTheLevelOfTreeWithMinimumSum.go)   
[3203. Find Minimum Diameter After Merging Two Trees](./leetcode/3203-FindMinimumDiameterAfterMergingTwoTrees.go)   
[3249. Count the Number of Good Nodes](./leetcode/3249-CountTheNumberOfGoodNodes.go)   
[3313. Find the Last Marked Nodes in Tree](./leetcode/3313-FindTheLastMarkedNodesInTree.go)   
[3319. K-th Largest Perfect Subtree Size in Binary Tree](./leetcode/3319-KthLargestPerfectSubtreeSizeInBinaryTree.go)   
[3331. Find Subtree Sizes After Changes](./leetcode/3331-FindSubtreeSizesAfterChanges.go)   
[3367. Maximize Sum of Weights after Edge Removals](./leetcode/3367-MaximizeSumOfWeightsAfterEdgeRemovals.go)   
[3425. Longest Special Path](./leetcode/3425-LongestSpecialPath.go)   
[3486. Longest Special Path II](./leetcode/3486-LongestSpecialPathII.go)   
[3544. Subtree Inversion Sum](./leetcode/3544-SubtreeInversionSum.go)   
[3831. Median of a Binary Search Tree Level](./leetcode/3831-MedianOfABinarySearchTreeLevel.go)    
[3879. Maximum Distinct Path Sum in a Binary Tree](./leetcode/3879-MaximumDistinctPathSumInABinaryTree.go)   
[3902. Zigzag Level Sum of Binary Tree](./leetcode/3902-ZigzagLevelSumOfBinaryTree.go)   
[3939. Count Non Adjacent Subsets in a Rooted Tree](./leetcode/3939-CountNonAdjacentSubsetsInARootedTree.go)   
[3949. Subtree Inversion Sum II](./leetcode/3949-SubtreeInversionSumII.go)   
[3997. Count Dominant Nodes in a Binary Tree](./leetcode/3997-CountDominantNodesInABinaryTree.go)   
[4015. Weighted Sum of a Tree](./leetcode/4015-WeightedSumOfATree.go)   

# Graph
[133. Clone Graph](./leetcode/133-CloneGraph.go)   
[210. Course Schedule II](./leetcode/210-CourseScheduleII.go)   
[261. Graph Valid Tree](./leetcode/261-GraphValidTree.go)   
[277. Find the Celebrity](./leetcode/277-FindTheCelebrity.go)   
[310. Minimum Height Trees](./leetcode/310-MinimumHeightTrees.go)   
[323. Number of Connected Components in an Undirected Graph](./leetcode/323-NumberOfConnectedComponentsInAnUndirectedGraph.go)   
[332. Reconstruct Itinerary](./leetcode/332-ReconstructItinerary.go)   
[490. The Maze](./leetcode/490-TheMaze.go)   
[499. The Maze III](./leetcode/499-TheMazeIII.go)   
[505. The Maze II](./leetcode/505-TheMazeII.go)   
[684. Redundant Connection](./leetcode/684-RedundantConnection.go)   
[685. Redundant Connection II](./leetcode/685-RedundantConnectionII.go)   
[743. Network Delay Time](./leetcode/743-NetworkDelayTime.go)   
[753. Cracking the Safe](./leetcode/753-CrackingTheSafe.go)   
[847. Shortest Path Visiting All Nodes](./leetcode/847-ShortestPathVisitingAllNodes.go)   
[882. Reachable Nodes In Subdivided Graph](./leetcode/882-ReachableNodesInSubdividedGraph.go)   
[886. Possible Bipartition](./leetcode/886-PossibleBipartition.go)   
[913. Cat and Mouse](./leetcode/913-CatAndMouse.go)   
[924. Minimize Malware Spread](./leetcode/924-MinimizeMalwareSpread.go)    
[928. Minimize Malware Spread II](./leetcode/928-MinimizeMalwareSpreadII.go)   
[1042. Flower Planting With No Adjacent](./leetcode/1042-FlowerPlantingWithNoAdjacent.go)   
[1059. All Paths from Source Lead to Destination](./leetcode/1059-AllPathsFromSourceLeadToDestination.go)   
[1129. Shortest Path with Alternating Colors](./leetcode/1129-ShortestPathWithAlternatingColors.go)   
[1135. Connecting Cities With Minimum Cost](./leetcode/1135-ConnectingCitiesWithMinimumCost.go)   
[1136. Parallel Courses](./leetcode/1136-ParallelCourses.go)   
[1168. Optimize Water Distribution in a Village](./leetcode/1168-OptimizeWaterDistributionInAVillage.go)   
[1203. Sort Items by Groups Respecting Dependencies](./leetcode/1203-SortItemsByGroupsRespectingDependencies.go)   
[1245. Tree Diameter](./leetcode/1245-TreeDiameter.go)   
[1319. Number of Operations to Make Network Connected](./leetcode/1319-NumberOfOperationsToMakeNetworkConnected.go)   
[1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](./leetcode/1334-FindTheCityWithTheSmallestNumberOfNeighborsAtAThresholdDistance.go)   
[1361. Validate Binary Tree Nodes](./leetcode/1361-ValidateBinaryTreeNodes.go)   
[1377. Frog Position After T Seconds](./leetcode/1377-FrogPositionAfterTSeconds.go)   
[1443. Minimum Time to Collect All Apples in a Tree](./leetcode/1443-MinimumTimeToCollectAllApplesInATree.go)   
[1462. Course Schedule IV](./leetcode/1462-CourseScheduleIV.go)   
[1466. Reorder Routes to Make All Paths Lead to the City Zero](./leetcode/1466-ReorderRoutesToMakeAllPathsLeadToTheCityZero.go)   
[1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](./leetcode/1489-FindCriticalAndPseudoCriticalEdgesInMinimumSpanningTree.go)   
[1494. Parallel Courses II](./leetcode/1494-ParallelCoursesII.go)   
[1514. Path with Maximum Probability](./leetcode/1514-PathWithMaximumProbability.go)   
[1548. The Most Similar Path in a Graph](./leetcode/1548-TheMostSimilarPathInAGraph.go)   
[1557. Minimum Number of Vertices to Reach All Nodes](./leetcode/1557-MinimumNumberOfVerticesToReachAllNodes.go)   
[1579. Remove Max Number of Edges to Keep Graph Fully Traversable](./leetcode/1579-RemoveMaxNumberOfEdgesToKeepGraphFullyTraversable.go)   
[1584. Min Cost to Connect All Points](./leetcode/1584-MinCostToConnectAllPoints.go)   
[1615. Maximal Network Rank](./leetcode/1615-MaximalNetworkRank.go)   
[1697. Checking Existence of Edge Length Limited Paths](./leetcode/1697-CheckingExistenceOfEdgeLengthLimitedPaths.go)   
[1719. Number Of Ways To Reconstruct A Tree](./leetcode/1719-NumberOfWaysToReconstructATree.go)   
[1761. Minimum Degree of a Connected Trio in a Graph](./leetcode/1761-MinimumDegreeOfAConnectedTrioInAGraph.go)   
[1782. Count Pairs Of Nodes](./leetcode/1782-CountPairsOfNodes.go)   
[1786. Number of Restricted Paths From First to Last Node](./leetcode/1786-NumberOfRestrictedPathsFromFirstToLastNode.go)   
[1791. Find Center of Star Graph](./leetcode/1791-FindCenterOfStarGraph.go)   
[1857. Largest Color Value in a Directed Graph](./leetcode/1857-LargestColorValueInADirectedGraph.go)   
[1916. Count Ways to Build Rooms in an Ant Colony](./leetcode/1916-CountWaysToBuildRoomsInAnAntColony.go)   
[1928. Minimum Cost to Reach Destination in Time](./leetcode/1928-MinimumCostToReachDestinationInTime.go)   
[1971. Find if Path Exists in Graph](./leetcode/1971-FindIfPathExistsInGraph.go)   
[1976. Number of Ways to Arrive at Destination](./leetcode/1976-NumberOfWaysToArriveAtDestination.go)   
[2039. The Time When the Network Becomes Idle](./leetcode/2039-TheTimeWhenTheNetworkBecomesIdle.go)   
[2045. Second Minimum Time to Reach Destination](./leetcode/2045-SecondMinimumTimeToReachDestination.go)   
[2050. Parallel Courses III](./leetcode/2050-ParallelCoursesIII.go)   
[2065. Maximum Path Quality of a Graph](./leetcode/2065-MaximumPathQualityOfAGraph.go)   
[2076. Process Restricted Friend Requests](./leetcode/2076-ProcessRestrictedFriendRequests.go)   
[2077. Paths in Maze That Lead to Same Room](./leetcode/2077-PathsInMazeThatLeadToSameRoom.go)   
[2092. Find All People With Secret](./leetcode/2092-FindAllPeopleWithSecret.go)   
[2097. Valid Arrangement of Pairs](./leetcode/2097-ValidArrangementOfPairs.go)   
[2192. All Ancestors of a Node in a Directed Acyclic Graph](./leetcode/2192-AllAncestorsOfANodeInADirectedAcyclicGraph.go)   
[2203. Minimum Weighted Subgraph With the Required Paths](./leetcode/2203-MinimumWeightedSubgraphWithTheRequiredPaths.go)   
[2204. Distance to a Cycle in Undirected Graph](./leetcode/2204-DistanceToACycleInUndirectedGraph.go)   
[2242. Maximum Score of a Node Sequence](./leetcode/2242-MaximumScoreOfANodeSequence.go)   
[2246. Longest Path With Different Adjacent Characters](./leetcode/2246-LongestPathWithDifferentAdjacentCharacters.go)   
[2247. Maximum Cost of Trip With K Highways](./leetcode/2247-MaximumCostOfTripWithKHighways.go)   
[2285. Maximum Total Importance of Roads](./leetcode/2285-MaximumTotalImportanceOfRoads.go)   
[2316. Count Unreachable Pairs of Nodes in an Undirected Graph](./leetcode/2316-CountUnreachablePairsOfNodesInAnUndirectedGraph.go)   
[2328. Number of Increasing Paths in a Grid](./leetcode/2328-NumberOfIncreasingPathsInAGrid.go)   
[2359. Find Closest Node to Given Two Nodes](./leetcode/2359-FindClosestNodeToGivenTwoNodes.go)   
[2360. Longest Cycle in a Graph](./leetcode/2360-LongestCycleInAGraph.go)   
[2374. Node With Highest Edge Score](./leetcode/2374-NodeWithHighestEdgeScore.go)   
[2467. Most Profitable Path in a Tree](./leetcode/2467-MostProfitablePathInATree.go)   
[2473. Minimum Cost to Buy Apples](./leetcode/2473-MinimumCostToBuyApples.go)   
[2477. Minimum Fuel Cost to Report to the Capital](./leetcode/2477-MinimumFuelCostToReportToTheCapital.go)   
[2479. Maximum XOR of Two Non-Overlapping Subtrees](./leetcode/2479-MaximumXOROfTwoNonOverlappingSubtrees.go)   
[2492. Minimum Score of a Path Between Two Cities](./leetcode/2492-MinimumScoreOfAPathBetweenTwoCities.go)   
[2493. Divide Nodes Into the Maximum Number of Groups](./leetcode/2493-DivideNodesIntoTheMaximumNumberOfGroups.go)   
[2497. Maximum Star Sum of a Graph](./leetcode/2497-MaximumStarSumOfAGraph.go)   
[2508. Add Edges to Make Degrees of All Nodes Even](./leetcode/2508-AddEdgesToMakeDegreesOfAllNodesEven.go)   
[2608. Shortest Cycle in a Graph](./leetcode/2608-ShortestCycleInAGraph.go)   
[2639. Find the Width of Columns of a Grid](./leetcode/2639-FindTheWidthOfColumnsOfAGrid.go)   
[2642. Design Graph With Shortest Path Calculator](./leetcode/2642-DesignGraphWithShortestPathCalculator.go)   
[2685. Count the Number of Complete Components](./leetcode/2685-CountTheNumberOfCompleteComponents.go)   
[2699. Modify Graph Edge Weights](./leetcode/2699-ModifyGraphEdgeWeights.go)   
[2714. Find Shortest Path with K Hops](./leetcode/2714-FindShortestPathWithKHops.go)   
[2737. Find the Closest Marked Node](./leetcode/2737-FindTheClosestMarkedNode.go)   
[2858. Minimum Edge Reversals So Every Node Is Reachable](./leetcode/2858-MinimumEdgeReversalsSoEveryNodeIsReachable.go)   
[2876. Count Visited Nodes in a Directed Graph](./leetcode/2876-CountVisitedNodesInADirectedGraph.go)   
[2959. Number of Possible Sets of Closing Branches](./leetcode/2959-NumberOfPossibleSetsOfClosingBranches.go)   
[3015. Count the Number of Houses at a Certain Distance I](./leetcode/3015-CountTheNumberOfHousesAtACertainDistanceI.go)   
[3017. Count the Number of Houses at a Certain Distance II](./leetcode/3017-CountTheNumberOfHousesAtACertainDistanceII.go)   
[3108. Minimum Cost Walk in Weighted Graph](./leetcode/3108-MinimumCostWalkInWeightedGraph.go)   
[3112. Minimum Time to Visit Disappearing Nodes](./leetcode/3112-MinimumTimeToVisitDisappearingNodes.go)   
[3123. Find Edges in Shortest Paths](./leetcode/3123-FindEdgesInShortestPaths.go)   
[3203. Find Minimum Diameter After Merging Two Trees](./leetcode/3203-FindMinimumDiameterAfterMergingTwoTrees.go)   
[3241. Time Taken to Mark All Nodes](./leetcode/3241-TimeTakenToMarkAllNodes.go)   
[3243. Shortest Distance After Road Addition Queries I](./leetcode/3243-ShortestDistanceAfterRoadAdditionQueriesI.go)   
[3310. Remove Methods From Project](./leetcode/3310-RemoveMethodsFromProject.go)   
[3311. Construct 2D Grid Matching Graph Layout](./leetcode/3311-Construct2DGridMatchingGraphLayout.go)   
[3372. Maximize the Number of Target Nodes After Connecting Trees I](./leetcode/3372-MaximizeTheNumberOfTargetNodesAfterConnectingTreesI.go)   
[3373. Maximize the Number of Target Nodes After Connecting Trees II](./leetcode/3373-MaximizeTheNumberOfTargetNodesAfterConnectingTreesII.go)   
[3383. Minimum Runes to Add to Cast Spell](./leetcode/3383-MinimumRunesToAddToCastSpell.go)   
[3419. Minimize the Maximum Edge Weight of Graph](./leetcode/3419-MinimizeTheMaximumEdgeWeightOfGraph.go)   
[3493. Properties Graph](./leetcode/3493-PropertiesGraph.go)   
[3515. Shortest Path in a Weighted Tree](./leetcode/3515-ShortestPathInAWeightedTree.go)   
[3530. Maximum Profit from Valid Topological Order in DAG](./leetcode/3530-MaximumProfitFromValidTopologicalOrderInDAG.go)   
[3532. Path Existence Queries in a Graph I](./leetcode/3532-PathExistenceQueriesInAGraphI.go)   
[3534. Path Existence Queries in a Graph II](./leetcode/3534-PathExistenceQueriesInAGraphII.go)   
[3528. Unit Conversion I](./leetcode/3528-UnitConversionI.go)   
[3535. Unit Conversion II](./leetcode/3535-UnitConversionII.go)   
[3543. Maximum Weighted K-Edge Path](./leetcode/3543-MaximumWeightedKEdgePath.go)   
[3547. Maximum Sum of Edge Values in a Graph](./leetcode/3547-MaximumSumOfEdgeValuesInAGraph.go)   
[3553. Minimum Weighted Subgraph With the Required Paths II](./leetcode/3553-MinimumWeightedSubgraphWithTheRequiredPathsII.go)   
[3585. Find Weighted Median Node in Tree](./leetcode/3585-FindWeightedMedianNodeInTree.go)   
[3593. Minimum Increments to Equalize Leaf Paths](./leetcode/3593-MinimumIncrementsToEqualizeLeafPaths.go)   
[3600. Maximize Spanning Tree Stability with Upgrades](./leetcode/3600-MaximizeSpanningTreeStabilityWithUpgrades.go)   
[3603. Minimum Cost Path with Alternating Directions II](./leetcode/3603-MinimumCostPathWithAlternatingDirectionsII.go)   
[3604. Minimum Time to Reach Destination in Directed Graph](./leetcode/3604-MinimumTimeToReachDestinationInDirectedGraph.go)   
[3607. Power Grid Maintenance](./leetcode/3607-PowerGridMaintenance.go)   
[3608. Minimum Time for K Connected Components](./leetcode/3608-MinimumTimeForKConnectedComponents.go)   
[3609. Minimum Moves to Reach Target in Grid](./leetcode/3609-MinimumMovesToReachTargetInGrid.go)   
[3610. Minimum Number of Primes to Sum to Target](./leetcode/3610-MinimumNumberOfPrimesToSumToTarget.go)   
[3613. Minimize Maximum Component Cost](./leetcode/3613-MinimizeMaximumComponentCost.go)   
[3615. Longest Palindromic Path in Graph](./leetcode/3615-LongestPalindromicPathInGraph.go)   
[3619. Count Islands With Total Value Divisible by K](./leetcode/3619-CountIslandsWithTotalValueDivisibleByK.go)   
[3620. Network Recovery Pathways](./leetcode/3620-NetworkRecoveryPathways.go)   
[3650. Minimum Cost Path with Edge Reversals](./leetcode/3650-MinimumCostPathWithEdgeReversals.go)   
[3715. Sum of Perfect Square Ancestors](./leetcode/3715-SumOfPerfectSquareAncestors.go)   
[3772. Maximum Subgraph Score in a Tree](./leetcode/3772-MaximumSubgraphScoreInATree.go)   
[3778. Minimum Distance Excluding One Maximum Weighted Edge](./leetcode/3778-MinimumDistanceExcludingOneMaximumWeightedEdge.go)   
[3786. Total Sum of Interaction Cost in Tree Groups](./leetcode/3786-TotalSumOfInteractionCostInTreeGroups.go)   
[3787. Find Diameter Endpoints of a Tree](./leetcode/3787-FindDiameterEndpointsOfATree.go)   
[3807. Minimum Cost to Repair Edges to Traverse a Graph](./leetcode/3807-MinimumCostToRepairEdgesToTraverseAGraph.go)   
[3812. Minimum Edge Toggles on a Tree](./leetcode/3812-MinimumEdgeTogglesOnATree.go)   
[3820. Pythagorean Distance Nodes in a Tree](./leetcode/3820-PythagoreanDistanceNodesInATree.go)   
[3841. Palindromic Path Queries in a Tree](./leetcode/3841-PalindromicPathQueriesInATree.go)   
[3887. Incremental Even-Weighted Cycle Queries](./leetcode/3887-IncrementalEvenWeightedCycleQueries.go)   
[3924. Minimum Threshold Path With Limited Heavy Edges](./leetcode/3924-MinimumThresholdPathWithLimitedHeavyEdges.go)   
[3928. Minimum Cost to Buy Apples II](./leetcode/3928-MinimumCostToBuyApplesII.go)    
[3965. Finish Time of Tasks I](./leetcode/3965-FinishTimeOfTasksI.go)   
[3967. Finish Time of Tasks II](./leetcode/3967-FinishTimeOfTasksII.go)   
[3970. Shortest Path With At Most K Consecutive Identical Characters](./leetcode/3970-ShortestPathWithAtMostKConsecutiveIdenticalCharacters.go)   
[3977. Minimum Time to Reach Target With Limited Power](./leetcode/3977-MinimumTimeToReachTargetWithLimitedPower.go)   
[4018. Total Sum of Interaction Cost in Tree Groups II](./leetcode/4018-TotalSumOfInteractionCostInTreeGroupsII.go)   

# Trie
[386. Lexicographical Numbers](./leetcode/386-LexicographicalNumbers.go)   
[440. K-th Smallest in Lexicographical Order](./leetcode/440-KthSmallestInLexicographicalOrder.go)   

# Breadth-First Search
[1197. Minimum Knight Moves](./leetcode/1197-MinimumKnightMoves.go)   

# Bit Manipulation
[136. Single Number](./leetcode/136-SingleNumber.go)   
[137. Single Number II](./leetcode/137-SingleNumberII.go)   
[190. Reverse Bits](./leetcode/190-ReverseBits.go)   
[191. Number of 1 Bits](./leetcode/191-NumberOf1Bits.go)   
[201. Bitwise AND of Numbers Range](./leetcode/201-BitwiseANDOfNumbersRange.go)   
[338. Counting Bits](./leetcode/338-CountingBits.go)   
[351. Android Unlock Patterns](./leetcode/351-AndroidUnlockPatterns.go)   
[397. Integer Replacement](./leetcode/397-IntegerReplacement.go)   
[401. Binary Watch](./leetcode/401-BinaryWatch.go)   
[461. Hamming Distance](./leetcode/461-HammingDistance.go)   
[476. Number Complement](./leetcode/476-NumberComplement.go)   
[693. Binary Number with Alternating Bits](./leetcode/693-BinaryNumberWithAlternatingBits.go)   
[868. Binary Gap](./leetcode/868-BinaryGap.go)   
[1009. Complement of Base 10 Integer](./leetcode/1009-ComplementOfBase10Integer.go)   
[1318. Minimum Flips to Make a OR b Equal to c](./leetcode/1318-MinimumFlipsToMakeAORBEqualToC.go)   
[1611. Minimum One Bit Operations to Make Integers Zero](./leetcode/1611-MinimumOneBitOperationsToMakeIntegersZero.go)   
[2220. Minimum Bit Flips to Convert Number](./leetcode/2220-MinimumBitFlipsToConvertNumber.go)   
[2429. Minimize XOR](./leetcode/2429-MinimizeXOR.go)   
[3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K](./leetcode/3007-MaximumNumberThatSumOfThePricesIsLessThanOrEqualToK.go)   
[3064. Guess the Number Using Bitwise Questions I](./leetcode/3064-GuessTheNumberUsingBitwiseQuestionsI.go)   
[3094. Guess the Number Using Bitwise Questions II](./leetcode/3094-GuessTheNumberUsingBitwiseQuestionsII.go)   
[3133. Minimum Array End](./leetcode/3133-MinimumArrayEnd.go)   
[3141. Maximum Hamming Distances](./leetcode/3141-MaximumHammingDistances.go)   
[3199. Count Triplets with Even XOR Set Bits I](./leetcode/3199-CountTripletsWithEvenXORSetBitsI.go)   
[3211. Generate Binary Strings Without Adjacent Zeros](./leetcode/3211-GenerateBinaryStringsWithoutAdjacentZeros.go)   
[3226. Number of Bit Changes to Make Two Integers Equal](./leetcode/3226-NumberOfBitChangesToMakeTwoIntegersEqual.go)   
[3344. Maximum Sized Array](./leetcode/3344-MaximumSizedArray.go)   

# Design
[146. LRU Cache](./leetcode/146-LRUCache.go)   
[155. Min Stack](./leetcode/155-MinStack.go)   
[170. Two Sum III - Data structure design](./leetcode/170-TwoSumIII-DataStructureDesign.go)   
[173. Binary Search Tree Iterator](./leetcode/173-BinarySearchTreeIterator.go)   
[208. Implement Trie (Prefix Tree)](./leetcode/208-ImplementTrie-PrefixTree.go)   
[211. Design Add and Search Words Data Structure](./leetcode/211-DesignAddAndSearchWordsDataStructure.go)   
[225. Implement Stack using Queues](./leetcode/225-ImplementStackUsingQueues.go)   
[232. Implement Queue using Stacks](./leetcode/232-ImplementQueueUsingStacks.go)   
[244. Shortest Word Distance II](./leetcode/244-ShortestWordDistanceII.go)   
[251. Flatten 2D Vector](./leetcode/251-Flatten2DVector.go)   
[271. Encode and Decode Strings](./leetcode/271-EncodeAndDecodeStrings.go)   
[281. Zigzag Iterator](./leetcode/281-ZigzagIterator.go)   
[284. Peeking Iterator](./leetcode/284-PeekingIterator.go)   
[288. Unique Word Abbreviation](./leetcode/288-UniqueWordAbbreviation.go)   
[295. Find Median from Data Stream](./leetcode/295-FindMedianFromDataStream.go)   
[297. Serialize and Deserialize Binary Tree](./leetcode/297-SerializeAndDeserializeBinaryTree.go)   
[303. Range Sum Query - Immutable](./leetcode/303-RangeSumQuery-Immutable.go)   
[304. Range Sum Query 2D - Immutable](./leetcode/304-RangeSumQuery2D-Immutable.go)   
[307. Range Sum Query - Mutable](./leetcode/307-RangeSumQuery-Mutable.go)   
[308. Range Sum Query 2D - Mutable](./leetcode/308-RangeSumQuery2D-Mutable.go)   
[341. Flatten Nested List Iterator](./leetcode/341-FlattenNestedListIterator.go)   
[346. Moving Average from Data Stream](./leetcode/346-MovingAverageFromDataStream.go)   
[348. Design Tic-Tac-Toe](./leetcode/348-DesignTicTacToe.go)   
[352. Data Stream as Disjoint Intervals](./leetcode/352-DataStreamAsDisjointIntervals.go)   
[353. Design Snake Game](./leetcode/353-DesignSnakeGame.go)   
[355. Design Twitter](./leetcode/355-DesignTwitter.go)   
[359. Logger Rate Limiter](./leetcode/359-LoggerRateLimiter.go)   
[362. Design Hit Counter](./leetcode/362-DesignHitCounter.go)   
[379. Design Phone Directory](./leetcode/379-DesignPhoneDirectory.go)   
[380. Insert Delete GetRandom O(1)](./leetcode/380-InsertDeleteGetRandomO1.go)   
[381. Insert Delete GetRandom O(1) - Duplicates allowed](./leetcode/381-InsertDeleteGetRandomO1-DuplicatesAllowed.go)   
[382. Linked List Random Node](./leetcode/382-LinkedListRandomNode.go)   
[384. Shuffle an Array](./leetcode/384-ShuffleAnArray.go)   
[398. Random Pick Index](./leetcode/398-RandomPickIndex.go)   
[428. Serialize and Deserialize N-ary Tree](./leetcode/428-SerializeAndDeserializeN-aryTree.go)   
[431. Encode N-ary Tree to Binary Tree](./leetcode/431-EncodeN-aryTreeToBinaryTree.go)   
[432. All O`one Data Structure](./leetcode/432-AllOoneDataStructure.go)   
[449. Serialize and Deserialize BST](./leetcode/449-SerializeAndDeserializeBST.go)   
[460. LFU Cache](./leetcode/460-LFUCache.go)   
[478. Generate Random Point in a Circle](./leetcode/478-GenerateRandomPointInACircle.go)   
[497. Random Point in Non-overlapping Rectangles](./leetcode/497-RandomPointInNonOverlappingRectangles.go)   
[526. Beautiful Arrangement](./leetcode/526-BeautifulArrangement.go)   
[528. Random Pick with Weight](./leetcode/528-RandomPickWithWeight.go)   
[535. Encode and Decode TinyURL](./leetcode/535-EncodeAndDecodeTinyURL.go)   
[588. Design In-Memory File System](./leetcode/588-DesignIn-MemoryFileSystem.go)   
[604. Design Compressed String Iterator](./leetcode/604-DesignCompressedStringIterator.go)   
[622. Design Circular Queue](./leetcode/622-DesignCircularQueue.go)   
[631. Design Excel Sum Formula](./leetcode/631-DesignExcelSumFormula.go)   
[635. Design Log Storage System](./leetcode/635-DesignLogStorageSystem.go)   
[641. Design Circular Deque](./leetcode/641-DesignCircularDeque.go)   
[642. Design Search Autocomplete System](./leetcode/642-DesignSearchAutocompleteSystem.go)   
[676. Implement Magic Dictionary](./leetcode/676-ImplementtMagicDictionary.go)   
[677. Map Sum Pairs](./leetcode/677-MapSumPairs.go)    
[703. Kth Largest Element in a Stream](./leetcode/703-KthLargestElementInAStream.go)    
[705. Design HashSet](./leetcode/705-DesignHashSet.go)    
[706. Design HashMap](./leetcode/706-DesignHashMap.go)    
[707. Design Linked List](./leetcode/707-DesignLinkedList.go)   
[710. Random Pick with Blacklist](./leetcode/710-RandomPickWithBlacklist.go)   
[715. Range Module](./leetcode/715-RangeModule.go)   
[716. Max Stack](./leetcode/716-MaxStack.go)   
[729. My Calendar I](./leetcode/729-MyCalendarI.go)   
[731. My Calendar II](./leetcode/731-MyCalendarII.go)   
[732. My Calendar III](./leetcode/732-MyCalendarIII.go)   
[745. Prefix and Suffix Search](./leetcode/745-PrefixAndSuffixSearch.go)   
[855. Exam Room](./leetcode/855-ExamRoom.go)   
[895. Maximum Frequency Stack](./leetcode/895-MaximumFrequencyStack.go)   
[900. RLE Iterator](./leetcode/900-RLEIterator.go)   
[901. Online Stock Span](./leetcode/901-OnlineStockSpan.go)   
[911. Online Election](./leetcode/911-OnlineElection.go)   
[919. Complete Binary Tree Inserter](./leetcode/919-CompleteBinaryTreeInserter.go)   
[933. Number of Recent Calls](./leetcode/933-NumberOfRecentCalls.go)   
[981. Time Based Key-Value Store](./leetcode/981-TimeBasedKeyValueStore.go)   
[1032. Stream of Characters](./leetcode/1032-StreamOfCharacters.go)   
[1146. Snapshot Array](./leetcode/1146-SnapshotArray.go)   
[1157. Online Majority Element In Subarray](./leetcode/1157-OnlineMajorityElementInSubarray.go)   
[1166. Design File System](./leetcode/1166-DesignFileSystem.go)   
[1172. Dinner Plate Stacks](./leetcode/1172-DinnerPlateStacks.go)   
[1206. Design Skiplist](./leetcode/1206-DesignSkiplist.go)   
[1244. Design A Leaderboard](./leetcode/1244-DesignALeaderboard.go)   
[1286. Iterator for Combination](./leetcode/1286-IteratorForCombination.go)   
[1348. Tweet Counts Per Frequency](./leetcode/1348-TweetCountsPerFrequency.go)   
[1352. Product of the Last K Numbers](./leetcode/1352-ProductOfTheLastKNumbers.go)   
[1357. Apply Discount Every n Orders](./leetcode/1357-ApplyDiscountEveryNOrders.go)   
[1381. Design a Stack With Increment Operation](./leetcode/1381-DesignAStackWithIncrementOperation.go)   
[1396. Design Underground System](./leetcode/1396-DesignUndergroundSystem.go)   
[1429. First Unique Number](./leetcode/1429-FirstUniqueNumber.go)   
[1472. Design Browser History](./leetcode/1472-DesignBrowserHistory.go)   
[1476. Subrectangle Queries](./leetcode/1476-SubrectangleQueries.go)   
[1483. Kth Ancestor of a Tree Node](./leetcode/1483-KthAncestorOfATreeNode.go)   
[1500. Design a File Sharing System](./leetcode/1500-DesignAFileSharingSystem.go)   
[1570. Dot Product of Two Sparse Vectors](./leetcode/1570-DotProductOfTwoSparseVectors.go)   
[1586. Binary Search Tree Iterator II](./leetcode/1586-BinarySearchTreeIteratorII.go)   
[1600. Throne Inheritance](./leetcode/1600-ThroneInheritance.go)   
[1603. Design Parking System](./leetcode/1603-DesignParkingSystem.go)   
[1622. Fancy Sequence](./leetcode/1622-FancySequence.go)   
[1628. Design an Expression Tree With Evaluate Function](./leetcode/1628-DesignanExpressionTreeWithEvaluateFunction.go)   
[1656. Design an Ordered Stream](./leetcode/1656-DesignAnOrderedStream.go)   
[1670. Design Front Middle Back Queue](./leetcode/1670-DesignFrontMiddleBackQueue.go)   
[1756. Design Most Recently Used Queue](./leetcode/1756-DesignMostRecentlyUsedQueue.go)   
[1797. Design Authentication Manager](./leetcode/1797-DesignAuthenticationManager.go)   
[1804. Implement Trie II (Prefix Tree)](./leetcode/1804-ImplementTrieII.go)   
[1825. Finding MK Average](./leetcode/1825-FindingMKAverage.go)   
[1845. Seat Reservation Manager](./leetcode/1845-SeatReservationManager.go)   
[1865. Finding Pairs With a Certain Sum](./leetcode/1865-FindingPairsWithACertainSum.go)   
[1912. Design Movie Rental System](./leetcode/1912-DesignMovieRentalSystem.go)   
[1993. Operations on Tree](./leetcode/1993-OperationsOnTree.go)   
[2013. Detect Squares](./leetcode/2013-DetectSquares.go)   
[2034. Stock Price Fluctuation](./leetcode/2034-StockPriceFluctuation.go)   
[2043. Simple Bank System](./leetcode/2043-SimpleBankSystem.go)   
[2069. Walking Robot Simulation II](./leetcode/2069-WalkingRobotSimulationII.go)   
[2080. Range Frequency Queries](./leetcode/2080-RangeFrequencyQueries.go)   
[2102. Sequentially Ordinal Rank Tracker](./leetcode/2102-SequentiallyOrdinalRankTracker.go)   
[2166. Design Bitset](./leetcode/2166-DesignBitset.go)   
[2227. Encrypt and Decrypt Strings](./leetcode/2227-EncryptAndDecryptStrings.go)   
[2241. Design an ATM Machine](./leetcode/2241-DesignAnATMMachine.go)   
[2254. Design Video Sharing Platform](./leetcode/2254-DesignVideoSharingPlatform.go)   
[2276. Count Integers in Intervals](./leetcode/2276-CountIntegersInIntervals.go)   
[2286. Booking Concert Tickets in Groups](./leetcode/2286-BookingConcertTicketsInGroups.go)   
[2296. Design a Text Editor](./leetcode/2296-DesignATextEditor.go)   
[2336. Smallest Number in Infinite Set](./leetcode/2336-SmallestNumberInInfiniteSet.go)   
[2349. Design a Number Container System](./leetcode/2349-DesignANumberContainerSystem.go)   
[2353. Design a Food Rating System](./leetcode/2353-DesignAFoodRatingSystem.go)   
[2408. Design SQL](./leetcode/2408-DesignSQL.go)   
[2424. Longest Uploaded Prefix](./leetcode/2424-LongestUploadedPrefix.go)   
[2502. Design Memory Allocator](./leetcode/2502-DesignMemoryAllocator.go)   
[2526. Find Consecutive Integers from a Data Stream](./leetcode/2526-FindConsecutiveIntegersFromADataStream.go)   
[2590. Design a Todo List](./leetcode/2590-DesignATodoList.go)   
[2642. Design Graph With Shortest Path Calculator](./leetcode/2642-DesignGraphWithShortestPathCalculator.go)   
[2671. Frequency Tracker](./leetcode/2671-FrequencyTracker.go)   
[3242. Design Neighbor Sum Service](./leetcode/3242-DesignNeighborSumService.go)   
[3369. Design an Array Statistics Tracker](./leetcode/3369-DesignAnArrayStatisticsTracker.go)   
[3391. Design a 3D Binary Matrix with Efficient Layer Tracking](./leetcode/3391-DesignA3DBinaryMatrixWithEfficientLayerTracking.go)   
[3408. Design Task Manager](./leetcode/3408-DesignTaskManager.go)   
[3484. Design Spreadsheet](./leetcode/3484-DesignSpreadsheet.go)   
[3508. Implement Router](./leetcode/3508-ImplementRouter.go)   
[3709. Design Exam Scores Tracker](./leetcode/3709-DesignExamScoresTracker.go)   
[3815. Design Auction System](./leetcode/3815-DesignAuctionSystem.go)   
[3822. Design Order Management System](./leetcode/3822-DesignOrderManagementSystem.go)   
[3829. Design Ride Sharing System](./leetcode/3829-DesignRideSharingSystem.go)   
[3885. Design Event Manager](./leetcode/3885-DesignEventManager.go)   

# Binary Search
[278. First Bad Version](./leetcode/278-FirstBadVersion.go)   
[374. Guess Number Higher or Lower](./leetcode/374-GuessNumberHigherOrLower.go)   
[1802. Maximum Value at a Given Index in a Bounded Array](./leetcode/1802-MaximumValueAtAGivenIndexInABoundedArray.go)   

# Interactive
[157. Read N Characters Given Read4](./leetcode/157-ReadNCharactersGivenRead4.go)   
[158. Read N Characters Given read4 II - Call Multiple Times](./leetcode/158-ReadNCharactersGivenRead4II-CallMultipleTimes.go)   
[277. Find the Celebrity](./leetcode/277-FindTheCelebrity.go)   
[278. First Bad Version](./leetcode/278-FirstBadVersion.go)   
[374. Guess Number Higher or Lower](./leetcode/374-GuessNumberHigherOrLower.go)   
[489. Robot Room Cleaner](./leetcode/489-RobotRoomCleaner.go)   
[702. Search in a Sorted Array of Unknown Size](./leetcode/702-SearchInASortedArrayOfUnknownSize.go)   
[843. Guess the Word](./leetcode/843-GuessTheWord.go)   
[1095. Find in Mountain Array](./leetcode/1095-FindInMountainArray.go)   
[1236. Web Crawler](./leetcode/1236-WebCrawler.go)   
[1237. Find Positive Integer Solution for a Given Equation](./leetcode/1237-FindPositiveIntegerSolutionForAGivenEquation.go)   
[1274. Number of Ships in a Rectangle](./leetcode/1274-NumberOfShipsInARectangle.go)   
[1428. Leftmost Column with at Least a One](./leetcode/1428-LeftmostColumnWithAtLeastAOne.go)   
[1533. Find the Index of the Large Integer](./leetcode/1533-FindTheIndexOfTheLargeInteger.go)   
[1618. Maximum Font to Fit a Sentence in a Screen](./leetcode/1618-MaximumFontToFitASentenceInAScreen.go)   
[1778. Shortest Path in a Hidden Grid](./leetcode/1778-ShortestPathInAHiddenGrid.go)   
[1810. Minimum Path Cost in a Hidden Grid](./leetcode/1810-MinimumPathCostInAHiddenGrid.go)   
2728. Count Houses in a Circular Street
[2782. Number of Unique Categories](./leetcode/2782-NumberOfUniqueCategories.go)   
2936. Number of Equal Numbers Blocks
[3064. Guess the Number Using Bitwise Questions I](./leetcode/3064-GuessTheNumberUsingBitwiseQuestionsI.go)   
[3094. Guess the Number Using Bitwise Questions II](./leetcode/3094-GuessTheNumberUsingBitwiseQuestionsII.go)   

# Backtracking
[52. N-Queens II](./leetcode/52-N-QueensII.go)   
[254. Factor Combinations](./leetcode/254-FactorCombinations.go)   
[489. Robot Room Cleaner](./leetcode/489-RobotRoomCleaner.go)   
[967. Numbers With Same Consecutive Differences](./leetcode/967-NumbersWithSameConsecutiveDifferences.go)   
[1215. Stepping Numbers](./leetcode/1215-SteppingNumbers.go)   
[1240. Tiling a Rectangle with the Fewest Squares](./leetcode/1240-TilingARectangleWithTheFewestSquares.go)   

# Merge Sort 归并排序
[23. Merge k Sorted Lists](./leetcode/23-MergeKSortedLists.go)   
[148. Sort List](./leetcode/148-SortList.go)   
[315. Count of Smaller Numbers After Self](./leetcode/315-CountOfSmallerNumbersAfterSelf.go)   
[327. Count of Range Sum](./leetcode/327-CountOfRangeSum.go)   
493
912


# Randomized 随机化
[380. Insert Delete GetRandom O(1)](./leetcode/380-InsertDeleteGetRandomO1.go)   
[381. Insert Delete GetRandom O(1) - Duplicates allowed](./leetcode/381-InsertDeleteGetRandomO1-DuplicatesAllowed.go)   
[382. Linked List Random Node](./leetcode/382-LinkedListRandomNode.go)   
[384. Shuffle an Array](./leetcode/384-ShuffleAnArray.go)    
[398. Random Pick Index](./leetcode/398-RandomPickIndex.go)   
[470. Implement Rand10() Using Rand7()](./leetcode/470-ImplementRand10UsingRand7.go)   
[478. Generate Random Point in a Circle](./leetcode/478-GenerateRandomPointInACircle.go)   
[519. Random Flip Matrix](./leetcode/519-RandomFlipMatrix.go)   
[528. Random Pick with Weight](./leetcode/528-RandomPickWithWeight.go)   
[710. Random Pick with Blacklist](./leetcode/710-RandomPickWithBlacklist.go)   
[1515. Best Position for a Service Centre](./leetcode/1515-BestPositionForAServiceCentre.go)   
[LCR 030. O(1) 时间插入、删除和获取随机元素](./leetcode/LCR030-InsertDeleteGetRandomO1.go)   
[LCR 071. 按权重随机选择](./leetcode/LCR071-RandomPickWithWeight.go)  

# QuickSelect 快速选择
[215. Kth Largest Element in an Array](./leetcode/215-KthLargestElementInAnArray.go)   
[324. Wiggle Sort II](./leetcode/324-WiggleSortII.go)   
[347. Top K Frequent Elements](./leetcode/347-TopKFrequentElements.go)   
[973. K Closest Points to Origin](./leetcode/973-KClosestPointsToOrigin.go)   
[1738. Find Kth Largest XOR Coordinate Value](./leetcode/1738-FindKthLargestXORCoordinateValue.go)   
[1985. Find the Kth Largest Integer in the Array](./leetcode/1985-FindTheKthLargestIntegerInTheArray.go)   
[2343. Query Kth Smallest Trimmed Number](./leetcode/2343-QueryKthSmallestTrimmedNumber.go)   
[3759. Count Elements With at Least K Greater Values](./leetcode/3759-CountElementsWithAtLeastKGreaterValues.go)   
[LCR 060. 前 K 个高频元素](./leetcode/LCR060-TopKFrequentElements.go)    
[LCR 076. 数组中的第 K 个最大元素](./leetcode/LCR076-KthLargestElementInAnArray.go)   
[LCR 159. 库存管理 III](./leetcode/LCR159-InventoryManagementIII.go)   
[面试题 17.14. Smallest K LCCI](./leetcode/LCCI1714-SmallestK.go)  

# Counting Sort 计数排序
[274. H-Index](./leetcode/274-H-Index.go)   
[561. Array Partition](./leetcode/561-ArrayPartition.go)   
[912. Sort an Array](./leetcode/912-SortAnArray.go)   
[1051. Height Checker](./leetcode/1051-HeightChecker.go)   
[1122. Relative Sort Array](./leetcode/1122-RelativeSortArray.go)   
[1365. How Many Numbers Are Smaller Than the Current Number](./leetcode/1365-HowManyNumbersAreSmallerThanTheCurrentNumber.go)   
[1833. Maximum Ice Cream Bars](./leetcode/1833-MaximumIceCreamBars.go)   
[2037. Minimum Number of Moves to Seat Everyone](./leetcode/2037-MinimumNumberOfMovesToSeatEveryone.go)   
[3088. Make String Anti-palindrome](./leetcode/3088-MakeStringAntiPalindrome.go)   
[3189. Minimum Moves to Get a Peaceful Board](./leetcode/3189-MinimumMovesToGetAPeacefulBoard.go)   
[3517. Smallest Palindromic Rearrangement I](./leetcode/3517-SmallestPalindromicRearrangementI.go)   
[LCR 075. 数组的相对排序](./leetcode/LCR075-RelativeSortArray.go)   

# Iterator 迭代器
[173. Binary Search Tree Iterator](./leetcode/173-BinarySearchTreeIterator.go)   
[251. Flatten 2D Vector](./leetcode/251-Flatten2DVector.go)   
[281. Zigzag Iterator](./leetcode/281-ZigzagIterator.go)   
[284. Peeking Iterator](./leetcode/284-PeekingIterator.go)   
[341. Flatten Nested List Iterator](./leetcode/341-FlattenNestedListIterator.go)   
[604. Design Compressed String Iterator](./leetcode/604-DesignCompressedStringIterator.go)   
[900. RLE Iterator](./leetcode/900-RLEIterator.go)   
[1286. Iterator for Combination](./leetcode/1286-IteratorForCombination.go)   
[1586. Binary Search Tree Iterator II](./leetcode/1586-BinarySearchTreeIteratorII.go)   
[LCR 055. 二叉搜索树迭代器](./leetcode/LCR055-BinarySearchTreeIterator.go)   

# Probability & Statistics 概率与统计
[470. Implement Rand10() Using Rand7()](./leetcode/470-ImplementRand10UsingRand7.go)   
[808. Soup Servings](./leetcode/808-SoupServings.go)   
[837. New 21 Game](./leetcode/837-New21Game.go)   	
[1093. Statistics from a Large Sample](./leetcode/1093-StatisticsFromALargeSample.go)   
[1227. Airplane Seat Assignment Probability](./leetcode/1227-AirplaneSeatAssignmentProbability.go)   
[1230. Toss Strange Coins](./leetcode/1230-TossStrangeCoins.go)   
[1467. Probability of a Two Boxes Having The Same Number of Distinct Balls](./leetcode/1467-ProbabilityOfATwoBoxesHavingTheSameNumberOfDistinctBalls.go)   
[LCP 11. 期望个数统计](./leetcode/LCP11-ExpectedQuantityStatistics.go)   
[LCR 185. 统计结果概率](./leetcode/LCR185-StatisticsProbability.go)   

# Line Sweep 扫描线
[218. The Skyline Problem](./leetcode/218-TheSkylineProblem.go)   
[391. Perfect Rectangle](./leetcode/391-PerfectRectangle.go)   
[795. Number of Subarrays with Bounded Maximum](./leetcode/795-NumberOfSubarraysWithBoundedMaximum.go)   
[850. Rectangle Area II](./leetcode/850-RectangleAreaII.go)   
[986. Interval List Intersections](./leetcode/986-IntervalListIntersections.go)   
[1851. Minimum Interval to Include Eac](./leetcode/1851-MinimumIntervalToIncludeEac.go)   
[3009. Maximum Number of Intersections on the Chart](./leetcode/3009-MaximumNumberOfIntersectionsOnTheChart.go)   
[3454. Separate Squares II](./leetcode/3454-SeparateSquaresII.go)   

# Suffix Array 后缀数组
[1044. Longest Duplicate Substring](./leetcode/1044-LongestDuplicateSubstring.go)   
[1062. Longest Repeating Substring](./leetcode/1062-LongestRepeatingSubstring.go)   
[1698. Number of Distinct Substrings in a String](./leetcode/1698-NumberOfDistinctSubstringsInAString.go)   
[1923. Longest Common Subpath](./leetcode/1923-LongestCommonSubpath.go)   
[2223. Sum of Scores of Built Strings](./leetcode/2223-SumOfScoresOfBuiltStrings.go)   
[3213. Construct String with Minimum Cost](./leetcode/3213-ConstructStringWithMinimumCost.go)   
[3735. Lexicographically Smallest String After Reverse II](./leetcode/3735-LexicographicallySmallestStringAfterReverseII.go)   
[3934. Smallest Unique Subarray](./leetcode/3934-SmallestUniqueSubarray.go)    

# Bucket Sort 桶排序
[164. Maximum Gap](./leetcode/164-MaximumGap.go)   
[220. Contains Duplicate III](./leetcode/220-ContainsDuplicateIII.go)   
[347. Top K Frequent Elements](./leetcode/347-TopKFrequentElements.go)   
[451. Sort Characters By Frequency](./leetcode/451-SortCharactersByFrequency.go)   
[692. Top K Frequent Words](./leetcode/692-TopKFrequentWords.go)   
[912. Sort an Array](./leetcode/912-SortAnArray.go)   
[LCR 057. 存在重复元素 III](./leetcode/LCR057-ContainsDuplicateIII.go)   
[LCR 060. 前 K 个高频元素](./leetcode/LCR060-TopKFrequentWords.go)   

# Minimum Spanning Tree 最小生成树
[1135. Connecting Cities With Minimum Cost](./leetcode/1135-ConnectingCitiesWithMinimumCost.go)   
[1168. Optimize Water Distribution in a Village](./leetcode/1168-OptimizeWaterDistributionInAVillage.go)   
[1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](./leetcode/1489-FindCriticalAndPseudoCriticalEdgesInMinimumSpanningTree.go)   
[1584. Min Cost to Connect All Points](./leetcode/1584-MinCostToConnectAllPoints.go)   
[1724. Checking Existence of Edge Length Limited Paths II](./leetcode/1724-CheckingExistenceOfEdgeLengthLimitedPathsII.go)   

# Reservoir Sampling 水塘抽样
[382. Linked List Random Node](./leetcode/382-LinkedListRandomNode.go)   
[398. Random Pick Index](./leetcode/398-RandomPickIndex.go)   
[497. Random Point in Non-overlapping Rectangles](./leetcode/497-RandomPointInNonOverlappingRectangles.go)   
[519. Random Flip Matrix](./leetcode/519-RandomFlipMatrix.go)   

# Eulerian Circuit 欧拉回路
[332. Reconstruct Itinerary](./leetcode/332-ReconstructItinerary.go)   
[753. Cracking the Safe](./leetcode/753-CrackingTheSafe.go)   
[2097. Valid Arrangement of Pairs](./leetcode/2097-ValidArrangementOfPairs.go)   

# Radix Sort 基数排序
[164. Maximum Gap](./leetcode/164-MaximumGap.go)   
[912. Sort an Array](./leetcode/912-SortAnArray.go)   
[2343. Query Kth Smallest Trimmed Number](./leetcode/2343-QueryKthSmallestTrimmedNumber.go)   

# Strongly Connected Component 强连通分量
[1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](./leetcode/1489-FindCriticalAndPseudoCriticalEdgesInMinimumSpanningTree.go)   
[1568. Minimum Number of Days to Disconnect Island](./leetcode/1568-MinimumNumberOfDaysToDisconnectIsland.go)    

# Biconnected Component 双连通分量
[1192. Critical Connections in a Network](./leetcode/1192-CriticalConnectionsInANetwork.go)   
[LCP 54. 夺回据点](./leetcode/LCP54-RetrieveTheStronghold.go)   

# Rejection Sampling 拒绝采样
[470. Implement Rand10() Using Rand7()](./leetcode/470-ImplementRand10UsingRand7.go)   
[478. Generate Random Point in a Circle](./leetcode/478-GenerateRandomPointInACircle.go)   

# Database
[175. Combine Two Tables](./leetcode/175-CombineTwoTables.sql)   
[176. Second Highest Salary](./leetcode/176-SecondHighestSalary.sql)   
[177. Nth Highest Salary](./leetcode/177-NthHighestSalary.sql)   
[178. Rank Scores](./leetcode/178-RankScores.sql)   
[180. Consecutive Numbers](./leetcode/180-ConsecutiveNumbers.sql)   
[181. Employees Earning More Than Their Managers](./leetcode/181-EmployeesEarningMoreThanTheirManagers.sql)   
[182. Duplicate Emails](./leetcode/182-DuplicateEmails.sql)   
[183. Customers Who Never Order](./leetcode/183-CustomersWhoNeverOrder.sql)   
[184. Department Highest Salary](./leetcode/184-DepartmentHighestSalary.sql)   
[185. Department Top Three Salaries](./leetcode/185-DepartmentTopThreeSalaries.sql)   
[196. Delete Duplicate Emails](./leetcode/196-DeleteDuplicateEmails.sql)   
[197. Rising Temperature](./leetcode/197-RisingTemperature.sql)   
[262. Trips and Users](./leetcode/262-TripsAndUsers.sql)   
[511. Game Play Analysis I](./leetcode/511-GamePlayAnalysisI.sql)   
[512. Game Play Analysis II](./leetcode/512-GamePlayAnalysisII.sql)   
[534. Game Play Analysis III](./leetcode/534-GamePlayAnalysisIII.sql)   
[550. Game Play Analysis IV](./leetcode/550-GamePlayAnalysisIV.sql)   
[569. Median Employee Salary](./leetcode/569-MedianEmployeeSalary.sql)   
[570. Managers with at Least 5 Direct Reports](./leetcode/570-ManagersWithAtLeast5DirectReports.sql)   
[571. Find Median Given Frequency of Numbers](./leetcode/571-FindMedianGivenFrequencyOfNumbers.sql)   
[574. Winning Candidate](./leetcode/574-WinningCandidate.sql)   
[577. Employee Bonus](./leetcode/577-EmployeeBonus.sql)   
[578. Get Highest Answer Rate Question](./leetcode/578-GetHighestAnswerRateQuestion.sql)   
[579. Find Cumulative Salary of an Employee](./leetcode/579-FindCumulativeSalaryOfAnEmployee.sql)   
[580. Count Student Number in Departments](./leetcode/580-CountStudentNumberInDepartments.sql)   
[584. Find Customer Referee](./leetcode/584-FindCustomerReferee.sql)   
[585. Investments in 2016](./leetcode/585-InvestmentsIn2016.sql)   
[586. Customer Placing the Largest Number of Orders](./leetcode/586-CustomerPlacingtheLargestNumberofOrders.sql)   
[595. Big Countries](./leetcode/595-BigCountries.sql)   
[596. Classes More Than 5 Students](./leetcode/596-ClassesMoreThan5Students.sql)   
[597. Friend Requests I: Overall Acceptance Rate](./leetcode/597-FriendRequestsI-OverallAcceptanceRate.sql)   
[601. Human Traffic of Stadium](./leetcode/601-HumanTrafficofStadium.sql)    
[602. Friend Requests II: Who Has the Most Friends](./leetcode/602-FriendRequestsII-WhoHasTheMostFriends.sql)    
[603. Consecutive Available Seats](./leetcode/603-ConsecutiveAvailableSeats.sql)   
[607. Sales Person](./leetcode/607-SalesPerson.sql)   
[608. Tree Node](./leetcode/608-TreeNode.sql)   
[610. Triangle Judgement](./leetcode/610-TriangleJudgement.sql)   
[612. Shortest Distance in a Plane](./leetcode/612-ShortestDistanceInAPlane.sql)   
[613. Shortest Distance in a Line](./leetcode/613-ShortestDistanceInALine.sql)   
[614. Second Degree Follower](./leetcode/614-SecondDegreeFollower.sql)   
[615. Average Salary: Departments VS Company](./leetcode/615-AverageSalary-DepartmentsVSCompany.sql)   
[618. Students Report By Geography](./leetcode/618-StudentsReportByGeography.sql)   
[619. Biggest Single Number](./leetcode/619-BiggestSingleNumber.sql)   
[620. Not Boring Movies](./leetcode/620-NotBoringMovies.sql)   
[626. Exchange Seats](./leetcode/626-ExchangeSeats.sql)   
[627. Swap Salary](./leetcode/627-SwapSalary.sql)   
[1045. Customers Who Bought All Products](./leetcode/1045-CustomersWhoBoughtAllProducts.sql)   
[1050. Actors and Directors Who Cooperated At Least Three Times](./leetcode/1050-ActorsandDirectorsWhoCooperatedAtLeastThreeTimes.sql)   
[1068. Product Sales Analysis I](./leetcode/1068-ProductSalesAnalysisI.sql)   
[1069. Product Sales Analysis II](./leetcode/1069-ProductSalesAnalysisII.sql)   
[1070. Product Sales Analysis III](./leetcode/1070-ProductSalesAnalysisIII.sql)   
[1075. Project Employees I](./leetcode/1075-ProjectEmployeesI.sql)   
[1076. Project Employees II](./leetcode/1076-ProjectEmployeesII.sql)   
[1077. Project Employees III](./leetcode/1077-ProjectEmployeesIII.sql)   
[1082. Sales Analysis I](./leetcode/1082-SalesAnalysisI.sql)   
[1083. Sales Analysis II](./leetcode/1083-SalesAnalysisII.sql)   
[1084. Sales Analysis III](./leetcode/1084-SalesAnalysisIII.sql)   
[1097. Game Play Analysis V](./leetcode/1097-GamePlayAnalysisV.sql)   
[1098. Unpopular Books](./leetcode/1098-UnpopularBooks.sql)   
[1107. New Users Daily Count](./leetcode/1107-NewUsersDailyCount.sql)   
[1112. Highest Grade For Each Student](./leetcode/1112-HighestGradeForEachStudent.sql)   
[1113. Reported Posts](./leetcode/1113-ReportedPosts.sql)   
[1126. Active Businesses](./leetcode/1126-ActiveBusinesses.sql)   
[1127. User Purchase Platform](./leetcode/1127-UserPurchasePlatform.sql)   
[1132. Reported Posts II](./leetcode/1132-ReportedPostsII.sql)   
[1141. User Activity for the Past 30 Days I](./leetcode/1141-UserActivityforthePast30DaysI.sql)   
[1142. User Activity for the Past 30 Days II](./leetcode/1142-UserActivityForThePast30DaysII.sql)   
[1148. Article Views I](./leetcode/1148-ArticleViewsI.sql)   
[1149. Article Views II](./leetcode/1149-ArticleViewsII.sql)   
[1158. Market Analysis I](./leetcode/1158-MarketAnalysisI.sql)   
[1159. Market Analysis II](./leetcode/1159-MarketAnalysisII.sql)   
[1164. Product Price at a Given Date](./leetcode/1164-ProductPriceAtAGivenDate.sql)  
[1173. Immediate Food Delivery I](./leetcode/1173-ImmediateFoodDeliveryI.sql)   
[1174. Immediate Food Delivery II](./leetcode/1174-ImmediateFoodDeliveryII.sql)   
[1179. Reformat Department Table](./leetcode/1179-ReformatDepartmentTable.sql)   
[1193. Monthly Transactions I](./leetcode/1193-MonthlyTransactionsI.sql)   
[1194. Tournament Winners](./leetcode/1194-TournamentWinners.sql)   
[1204. Last Person to Fit in the Bus](./leetcode/1204-LastPersonToFitInTheBus.sql)   
[1205. Monthly Transactions II](./leetcode/1205-MonthlyTransactionsII.sql)   
[1211. Queries Quality and Percentage](./leetcode/1211-QueriesQualityAndPercentage.sql)   
[1212. Team Scores in Football Tournament](./leetcode/1212-TeamScoresInFootballTournament.sql)   
[1225. Report Contiguous Dates](./leetcode/1225-ReportContiguousDates.sql)   
[1241. Number of Comments per Post](./leetcode/1241-NumberOfCommentsPerPost.sql)   
[1251. Average Selling Price](./leetcode/1251-AverageSellingPrice.sql)   
[1264. Page Recommendations](./leetcode/1264-PageRecommendations.sql)   
[1270. All People Report to the Given Manager](./leetcode/1270-AllPeopleReportToTheGivenManager.sql)   
[1280. Students and Examinations](./leetcode/1280-StudentsAndExaminations.sql)   
[1285. Find the Start and End Number of Continuous Ranges](./leetcode/1285-FindTheStartAndEndNumberOfContinuousRanges.sql)   
[1294. Weather Type in Each Country](./leetcode/1294-WeatherTypeInEachCountry.sql)   
[1303. Find the Team Size](./leetcode/1303-FindTheTeamSize.sql)   
[1308. Running Total for Different Genders](./leetcode/1308-RunningTotalForDifferentGenders.sql)   
[1321. Restaurant Growth](./leetcode/1321-RestaurantGrowth.sql)  
[1322. Ads Performance](./leetcode/1322-AdsPerformance.sql)   
[1327. List the Products Ordered in a Period](./leetcode/1327-ListTheProductsOrderedInAPeriod.sql)   
[1336. Number of Transactions per Visit](./leetcode/1336-NumberOfTransactionsPerVisit.sql)   
[1341. Movie Rating](./leetcode/1341-MovieRating.sql)   
[1350. Students With Invalid Departments](./leetcode/1350-StudentsWithInvalidDepartments.sql)   
[1355. Activity Participants](./leetcode/1355-ActivityParticipants.sql)   
[1364. Number of Trusted Contacts of a Customer](./leetcode/1364-NumberOfTrustedContactsOfACustomer.sql)   
[1369. Get the Second Most Recent Activity](./leetcode/1369-GetTheSecondMostRecentActivity.sql)   
[1378. Replace Employee ID With The Unique Identifier](./leetcode/1378-ReplaceEmployeeIDWithTheUniqueIdentifier.sql)   
[1384. Total Sales Amount by Year](./leetcode/1384-TotalSalesAmountByYear.sql)   
[1393. Capital Gain/Loss](./leetcode/1393-CapitalGainOrLoss.sql)   
[1398. Customers Who Bought Products A and B but Not C](./leetcode/1398-CustomersWhoBoughtProductsAAndBButNotC.sql) 
[1407. Top Travellers](./leetcode/1407-TopTravellers.sql)   
[1412. Find the Quiet Students in All Exams](./leetcode/1412-FindTheQuietStudentsInAllExams.sql)   
[1421. NPV Queries](./leetcode/1421-NPVQueries.sql)   
[1435. Create a Session Bar Chart](./leetcode/1435-CreateASessionBarChart.sql)   
[1440. Evaluate Boolean Expression](./leetcode/1440-EvaluateBooleanExpression.sql)   
[1445. Apples & Oranges](./leetcode/1445-ApplesAndOranges.sql)   
[1454. Active Users](./leetcode/1454-ActiveUsers.sql)   
[1459. Rectangles Area](./leetcode/1459-RectanglesArea.sql)   
[1468. Calculate Salaries](./leetcode/1468-CalculateSalaries.sql)   
[1479. Sales by Day of the Week](./leetcode/1479-SalesByDayOfTheWeek.sql)   
[1484. Group Sold Products By The Date](./leetcode/1484-GroupSoldProductsByTheDate.sql)   
[1495. Friendly Movies Streamed Last Month](./leetcode/1495-FriendlyMoviesStreamedLastMonth.sql)   
[1501. Countries You Can Safely Invest In](./leetcode/1501-CountriesYouCanSafelyInvestIn.sql)   
[1511. Customer Order Frequency](./leetcode/1511-CustomerOrderFrequency.sql)   
[1517. Find Users With Valid E-Mails](./leetcode/1517-FindUsersWithValidE-Mails.sql)   
[1527. Patients With a Condition](./leetcode/1527-PatientsWithaCondition.sql)   
[1532. The Most Recent Three Orders](./leetcode/1532-TheMostRecentThreeOrders.sql)   
[1543. Fix Product Name Format](./leetcode/1543-FixProductNameFormat.sql)   
[1549. The Most Recent Orders for Each Product](./leetcode/1549-TheMostRecentOrdersForEachProduct.sql)   
[1555. Bank Account Summary](./leetcode/1555-BankAccountSummary.sql)   
[1565. Unique Orders and Customers Per Month](./leetcode/1565-UniqueOrdersAndCustomersPerMonth.sql)   
[1571. Warehouse Manager](./leetcode/1571-WarehouseManager.sql)   
[1581. Customer Who Visited but Did Not Make Any Transactions](./leetcode/1581-CustomerWhoVisitedbutDidNotMakeAnyTransactions.sql)   
[1587. Bank Account Summary II](./leetcode/1587-BankAccountSummaryII.sql)   
[1596. The Most Frequently Ordered Products for Each Customer](./leetcode/1596-TheMostFrequentlyOrderedProductsForEachCustomer.sql)   
[1607. Sellers With No Sales](./leetcode/1607-SellersWithNoSales.sql)   
[1613. Find the Missing IDs](./leetcode/1613-FindTheMissingIDs.sql)   
[1623. All Valid Triplets That Can Represent a Country](./leetcode/1623-AllValidTripletsThatCanRepresentACountry.sql)   
[1633. Percentage of Users Attended a Contest](./leetcode/1633-PercentageOfUsersAttendedAContest.sql)   
[1635. Hopper Company Queries I](./leetcode/1635-HopperCompanyQueriesI.sql)   
[1645. Hopper Company Queries II](./leetcode/1645-HopperCompanyQueriesII.sql)   
[1651. Hopper Company Queries III](./leetcode/1651-HopperCompanyQueriesIII.sql)   
[1661. Average Time of Process per Machine](./leetcode/1661-AverageTimeOfProcessPerMachine.sql)   
[1667. Fix Names in a Table](./leetcode/1667-FixNamesinaTable.sql)   
[1677. Product's Worth Over Invoices](./leetcode/1677-ProductsWorthOverInvoices.sql)   
[1683. Invalid Tweets](./leetcode/1683-InvalidTweets.sql)   
[1693. Daily Leads and Partners](./leetcode/1693-DailyLeadsandPartners.sql)   
[1699. Number of Calls Between Two Persons](./leetcode/1699-NumberOfCallsBetweenTwoPersons.sql)   
[1709. Biggest Window Between Visits](./leetcode/1709-BiggestWindowBetweenVisits.sql)   
[1715. Count Apples and Oranges](./leetcode/1715-CountApplesAndOranges.sql)   
[1729. Find Followers Count](./leetcode/1729-FindFollowersCount.sql)   
[1731. The Number of Employees Which Report to Each Employee](./leetcode/1731-TheNumberOfEmployeesWhichReportToEachEmployee.sql)   
[1741. Find Total Time Spent by Each Employee](./leetcode/1741-FindTotalTimeSpentbyEachEmployee.sql)   
[1747. Leetflex Banned Accounts](./leetcode/1747-LeetflexBannedAccounts.sql)   
[1757. Recyclable and Low Fat Products](./leetcode/1757-RecyclableandLowFatProducts.sql)   
[1767. Find the Subtasks That Did Not Execute](./leetcode/1767-FindTheSubtasksThatDidNotExecute.sql)   
[1777. Product's Price for Each Store](./leetcode/1777-ProductsPriceForEachStore.sql)   
[1783. Grand Slam Titles](./leetcode/1783-GrandSlamTitles.sql)   
[1795. Rearrange Products Table](./leetcode/1795-RearrangeProductsTable.sql)   
[1809. Ad-Free Sessions](./leetcode/1809-Ad-FreeSessions.sql)   
[1811. Find Interview Candidates](./leetcode/1811-FindInterviewCandidates.sql)   
[1821. Find Customers With Positive Revenue this Year](./leetcode/1821-FindCustomersWithPositiveRevenueThisYear.sql)   
[1831. Maximum Transaction Each Day](./leetcode/1831-MaximumTransactionEachDay.sql)   
[1841. League Statistics](./leetcode/1841-LeagueStatistics.sql)   
[1843. Suspicious Bank Accounts](./leetcode/1843-SuspiciousBankAccounts.sql)   
[1853. Convert Date Format](./leetcode/1853-ConvertDateFormat.sql)   
[1867. Orders With Maximum Quantity Above Average](./leetcode/1867-OrdersWithMaximumQuantityAboveAverage.sql)   
[1873. Calculate Special Bonus](./leetcode/1873-CalculateSpecialBonus.sql)   
[1875. Group Employees of the Same Salary](./leetcode/1875-GroupEmployeesOfTheSameSalary.sql)   
[1890. The Latest Login in 2020](./leetcode/1890-TheLatestLoginin2020.sql)   
[1892. Page Recommendations II](./leetcode/1892-PageRecommendationsII.sql)   
[1907. Count Salary Categories](./leetcode/1907-CountSalaryCategories.sql)   
[1917. Leetcodify Friends Recommendations](./leetcode/1917-LeetcodifyFriendsRecommendations.sql)   
[1919. Leetcodify Similar Friends](./leetcode/1919-LeetcodifySimilarFriends.sql)   
[1934. Confirmation Rate](./leetcode/1934-ConfirmationRate.sql)   
[1939. Users That Actively Request Confirmation Messages](./leetcode/1939-UsersThatActivelyRequestConfirmationMessages.sql)   
[1949. Strong Friendship](./leetcode/1949-StrongFriendship.sql)   
[1951. All the Pairs With the Maximum Number of Common Followers](./leetcode/1951-AllThePairsWithTheMaximumNumberOfCommonFollowers.sql)   
[1965. Employees With Missing Information](./leetcode/1965-EmployeesWithMissingInformation.sql)   
[1972. First and Last Call On the Same Day](./leetcode/1972-FirstAndLastCallOnTheSameDay.sql)   
[1978. Employees Whose Manager Left the Company](./leetcode/1978-EmployeesWhoseManagerLeftTheCompany.sql)   
[1988. Find Cutoff Score for Each School](./leetcode/1988-FindCutoffScoreForEachSchool.sql)   
[1990. Count the Number of Experiments](./leetcode/1990-CountTheNumberOfExperiments.sql)   
[2004. The Number of Seniors and Juniors to Join the Company](./leetcode/2004-TheNumberOfSeniorsAndJuniorsToJoinTheCompany.sql)   
[2010. The Number of Seniors and Juniors to Join the Company II](./leetcode/2010-TheNumberOfSeniorsAndJuniorsToJoinTheCompanyII.sql)   
[2020. Number of Accounts That Did Not Stream](./leetcode/2020-NumberOfAccountsThatDidNotStream.sql)   
[2026. Low-Quality Problems](./leetcode/2026-LowQualityProblems.sql)   
[2041. Accepted Candidates From the Interviews](./leetcode/2041-AcceptedCandidatesFromtheInterviews.sql)   
[2051. The Category of Each Member in the Store](./leetcode/2051-TheCategoryOfEachMemberInTheStore.sql)   
[2066. Account Balance](./leetcode/2066-AccountBalance.sql)   
[2072. The Winner University](./leetcode/2072-TheWinnerUniversity.sql)   
[2082. The Number of Rich Customers](./leetcode/2082-TheNumberOfRichCustomers.sql)   
[2084. Drop Type 1 Orders for Customers With Type 0 Orders](./leetcode/2084-DropType1OrdersForCustomersWithType0Orders.sql)   
[2112. The Airport With the Most Traffic](./leetcode/2112-TheAirportWithTheMostTraffic.sql)   
[2118. Build the Equation](./leetcode/2118-BuildTheEquation.sql)   
[2142. The Number of Passengers in Each Bus I](./leetcode/2142-TheNumberOfPassengersInEachBusI.sql)   
[2153. The Number of Passengers in Each Bus II](./leetcode/2153-TheNumberOfPassengersInEachBusII.sql)   
[2159. Order Two Columns Independently](./leetcode/2159-OrderTwoColumnsIndependently.sql)   
[2173. Longest Winning Streak](./leetcode/2173-LongestWinningStreak.sql)   
[2175. The Change in Global Rankings](./leetcode/2175-TheChangeInGlobalRankings.sql)   
[2199. Finding the Topic of Each Post](./leetcode/2199-FindingTheTopicOfEachPost.sql)   
[2205. The Number of Users That Are Eligible for Discount](./leetcode/2205-TheNumberOfUsersThatAreEligibleForDiscount.sql)    
[2228. Users With Two Purchases Within Seven Days](./leetcode/2228-UsersWithTwoPurchasesWithinSevenDays.sql)   
[2230. The Users That Are Eligible for Discount](./leetcode/2230-TheUsersThatAreEligibleForDiscount.sql)   
[2238. Number of Times a Driver Was a Passenger](./leetcode/2238-NumberOfTimesADriverWasAPassenger.sql)   
[2252. Dynamic Pivoting of a Table](./leetcode/2252-DynamicPivotingOfATable.sql)   
[2253. Dynamic Unpivoting of a Table](./leetcode/2253-DynamicUnpivotingOfATable.sql)   
[2292. Products With Three or More Orders in Two Consecutive Years](./leetcode/2292-ProductsWithThreeOrMoreOrdersInTwoConsecutiveYears.sql)   
[2298. Tasks Count in the Weekend](./leetcode/2298-TasksCountInTheWeekend.sql)   
[2308. Arrange Table by Gender](./leetcode/2308-ArrangeTableByGender.sql)   
[2314. The First Day of the Maximum Recorded Degree in Each City](./leetcode/2314-TheFirstDayOfTheMaximumRecordedDegreeInEachCity.sql)   
[2324. Product Sales Analysis IV](./leetcode/2324-ProductSalesAnalysisIV.sql)   
[2329. Product Sales Analysis V](./leetcode/2329-ProductSalesAnalysisV.sql)   
[2339. All the Matches of the League](./leetcode/2339-AllTheMatchesOfTheLeague.sql)   
[2346. Compute the Rank as a Percentage](./leetcode/2346-ComputeTheRankAsAPercentage.sql)   
[2356. Number of Unique Subjects Taught by Each Teacher](./leetcode/2356-NumberofUniqueSubjectsTaughtbyEachTeacher.sql)   
[2362. Generate the Invoice](./leetcode/2362-GenerateTheInvoice.sql)   
[2372. Calculate the Influence of Each Salesperson](./leetcode/2372-CalculateTheInfluenceOfEachSalesperson.sql)   
[2377. Sort the Olympic Table](./leetcode/2377-SortTheOlympicTable.sql)   
[2388. Change Null Values in a Table to the Previous Value](./leetcode/2388-ChangeNullValuesInATableToThePreviousValue.sql)   
[2394. Employees With Deductions](./leetcode/2394-EmployeesWithDeductions.sql)   
[2474. Customers With Strictly Increasing Purchases](./leetcode/2474-CustomersWithStrictlyIncreasingPurchases.sql)   
[2480. Form a Chemical Bond](./leetcode/2480-FormAChemicalBond.sql)   
[2494. Merge Overlapping Events in the Same Hall](./leetcode/2494-MergeOverlappingEventsInTheSameHall.sql)   
[2504. Concatenate the Name and the Profession](./leetcode/2504-ConcatenateTheNameAndTheProfession.sql)   
[2668. Find Latest Salaries](./leetcode/2668-FindLatestSalaries.sql)   
[2669. Count Artist Occurrences On Spotify Ranking List](./leetcode/2669-CountArtistOccurrencesOnSpotifyRankingList.sql)   
[2686. Immediate Food Delivery III](./leetcode/2686-ImmediateFoodDeliveryIII.sql)   
[2687. Bikes Last Time Used](./leetcode/2687-BikesLastTimUsed.sql)   
[2688. Find Active Users](./leetcode/2688-FindActiveUsers.sql)   
[2701. Consecutive Transactions with Increasing Amounts](./leetcode/2701-ConsecutiveTransactionswithIncreasingAmounts.sql)   
[2720. Popularity Percentage](./leetcode/2720-PopularityPercentage.sql)   
[2738. Count Occurrences in Text](./leetcode/2738-CountOccurrencesInText.sql)   
[2752. Customers with Maximum Number of Transactions on Consecutive Days](./leetcode/2752-CustomersWithMaximumNumberOfTransactionsOnConsecutiveDays.sql)   
[2783. Flight Occupancy and Waitlist Analysis](./leetcode/2783-FlightOccupancyAndWaitlistAnalysis.sql)   
[2793. Status of Flight Tickets](./leetcode/2793-StatusOfFlightTickets.sql)   
[2820. Election Results](./leetcode/2820-ElectionResults.sql)   
[2837. Total Traveled Distance](./leetcode/2837-TotalTraveledDistance.sql)   
[2853. Highest Salaries Difference](./leetcode/2853-HighestSalariesDifference.sql)   
[2854. Rolling Average Steps](./leetcode/2854-RollingAverageSteps.sql)   
[2893. Calculate Orders Within Each Interval](./leetcode/2893-CalculateOrdersWithinEachInterval.sql)   
[2922. Market Analysis III](./leetcode/2922-MarketAnalysisIII.sql)   
[2978. Symmetric Coordinates](./leetcode/2978-SymmetricCoordinates.sql)   
[2984. Find Peak Calling Hours for Each City](./leetcode/2984-FindPeakCallingHoursForEachCity.sql)   
[2985. Calculate Compressed Mean](./leetcode/2985-CalculateCompressedMean.sql)   
[2986. Find Third Transaction](./leetcode/2986-FindThirdTransaction.sql)   
[2987. Find Expensive Cities](./leetcode/2987-FindExpensiveCities.sql)   
[2988. Manager of the Largest Department](./leetcode/2988-ManagerOfTheLargestDepartment.sql)   
[2989. Class Performance](./leetcode/2989-ClassPerformance.sql)   
[2990. Loan Types](./leetcode/2990-LoanTypes.sql)   
[2991. Top Three Wineries](./leetcode/2991-TopThreeWineries.sql)   
[2993. Friday Purchases I](./leetcode/2993-FridayPurchasesI.sql)   
[2994. Friday Purchases II](./leetcode/2994-FridayPurchasesII.sql)   
[2995. Viewers Turned Streamers](./leetcode/2995-ViewersTurnedStreamers.sql)   
[3050. Pizza Toppings Cost Analysis](./leetcode/3050-PizzaToppingsCostAnalysis.sql)   
[3051. Find Candidates for Data Scientist Position](./leetcode/3051-FindCandidatesForDataScientistPosition.sql)   
[3052. Maximize Items](./leetcode/3052-MaximizeItems.sql)   
[3053. Classifying Triangles by Lengths](./leetcode/3053-ClassifyingTrianglesByLengths.sql)   
[3054. Binary Tree Nodes](./leetcode/3054-BinaryTreeNodes.sql)   
[3055. Top Percentile Fraud](./leetcode/3055-TopPercentileFraud.sql)   
[3056. Snaps Analysis](./leetcode/3056-SnapsAnalysis.sql)   
[3057. Employees Project Allocation](./leetcode/3057-EmployeesProjectAllocation.sql)   
[3058. Friends With No Mutual Friends](./leetcode/3058-FriendsWithNoMutualFriends.sql)   
[3059. Find All Unique Email Domains](./leetcode/3059-FindAllUniqueEmailDomains.sql)   
[3060. User Activities within Time Bounds](./leetcode/3060-UserActivitiesWithinTimeBounds.sql)   
[3061. Calculate Trapping Rain Water](./leetcode/3061-CalculateTrappingRainWater.sql)   
[3087. Find Trending Hashtags](./leetcode/3087-FindTrendingHashtags.sql)   
[3089. Find Bursty Behavior](./leetcode/3089-FindBurstyBehavior.sql)   
[3103. Find Trending Hashtags II](./leetcode/3103-FindTrendingHashtagsII.sql)   
[3118. Friday Purchase III](./leetcode/3118-FridayPurchaseIII.sql)   
[3124. Find Longest Calls](./leetcode/3124-FindLongestCalls.sql)   
[3126. Server Utilization Time](./leetcode/3126-ServerUtilizationTime.sql)   
[3140. Consecutive Available Seats II](./leetcode/3140-ConsecutiveAvailableSeatsII.sql)   
[3150. Invalid Tweets II](./leetcode/3150-InvalidTweetsII.sql)   
[3156. Employee Task Duration and Concurrent Tasks](./leetcode/3156-EmployeeTaskDurationAndConcurrentTasks.sql)   
[3166. Calculate Parking Fees and Duration](./leetcode/3166-CalculateParkingFeesAndDuration.sql)   
[3172. Second Day Verification](./leetcode/3172-SecondDayVerification.sql)   
[3182. Find Top Scoring Students](./leetcode/3182-FindTopScoringStudents.sql)   
[3188. Find Top Scoring Students II](./leetcode/3188-FindTopScoringStudentsII.sql)   
[3198. Find Cities in Each State](./leetcode/3198-FindCitiesInEachState.sql)   
[3204. Bitwise User Permissions Analysis](./leetcode/3204-BitwiseUserPermissionsAnalysis.sql)   
[3214. Year on Year Growth Rate](./leetcode/3214-YearOnYearGrowthRate.sql)   
[3220. Odd and Even Transactions](./leetcode/3220-OddAndEvenTransactions.sql)   
[3230. Customer Purchasing Behavior Analysis](./leetcode/3230-CustomerPurchasingBehaviorAnalysis.sql)   
[3236. CEO Subordinate Hierarchy](./leetcode/3236-CEOSubordinateHierarchy.sql)   
[3246. Premier League Table Ranking](./leetcode/3246-PremierLeagueTableRanking.sql)   
[3252. Premier League Table Ranking II](./leetcode/3252-PremierLeagueTableRankingII.sql)   
[3262. Find Overlapping Shifts](./leetcode/3262-FindOverlappingShifts.sql)   
[3268. Find Overlapping Shifts II](./leetcode/3268-FindOverlappingShiftsII.sql)   
[3278. Find Candidates for Data Scientist Position II](./leetcode/3278-FindCandidatesForDataScientistPositionII.sql)   
[3293. Calculate Product Final Price](./leetcode/3293-CalculateProductFinalPrice.sql)   
[3308. Find Top Performing Driver](./leetcode/3308-FindTopPerformingDriver.sql)   
[3322. Premier League Table Ranking III](./leetcode/3322-PremierLeagueTableRankingIII.sql)   
[3328. Find Cities in Each State II](./leetcode/3328-FindCitiesInEachStateII.sql)   
[3338. Second Highest Salary II](./leetcode/3338-SecondHighestSalaryII.sql)   
[3358. Books with NULL Ratings](./leetcode/3358-BooksWithNULLRatings.sql)   
[3368. First Letter Capitalization](./leetcode/3368-FirstLetterCappaitalization.sql)   
[3374. First Letter Capitalization II](./leetcode/3374-FirstLetterCapitalizationII.sql)   
[3384. Team Dominance by Pass Success](./leetcode/3384-TeamDominanceByPassSuccess.sql)   
[3390. Longest Team Pass Streak](./leetcode/3390-LongestTeamPassStreak.sql)   
[3401. Find Circular Gift Exchange Chains](./leetcode/3401-FindCircularGiftExchangeChains.sql)   
[3415. Find Products with Three Consecutive Digits](./leetcode/3415-FindProductsWithThreeConsecutiveDigits.sql)   
[3421. Find Students Who Improved](./leetcode/3421-FindStudentsWhoImproved.sql)   
[3436. Find Valid Emails](./leetcode/3436-FindValidEmails.sql)   
[3451. Find Invalid IP Addresses](./leetcode/3451-FindInvalidIPAddresses.sql)   
[3465. Find Products with Valid Serial Numbers](./leetcode/3465-FindProductsWithValidSerialNumbers.sql)   
[3475. DNA Pattern Recognition](./leetcode/3475-DNAPatternRecognition.sql)   
[3482. Analyze Organization Hierarchy](./leetcode/3482-AnalyzeOrganizationHierarchy.sql)   
[3497. Analyze Subscription Conversion](./leetcode/3497-AnalyzeSubscriptionConversion.sql)   
[3521. Find Product Recommendation Pairs](./leetcode/3521-FindProductRecommendationPairs.sql)   
[3554. Find Category Recommendation Pairs](./leetcode/3554-FindCategoryRecommendationPairs.sql)   
[3564. Seasonal Sales Analysis](./leetcode/3564-SeasonalSalesAnalysis.sql)   
[3570. Find Books with No Available Copies](./leetcode/3570-FindBooksWithNoAvailableCopies.sql)   
[3580. Find Consistently Improving Employees](./leetcode/3580-FindConsistentlyImprovingEmployees.sql)   
[3586. Find COVID Recovery Patients](./leetcode/3586-FindCOVIDRecoveryPatients.sql)   
[3601. Find Drivers with Improved Fuel Efficiency](./leetcode/3601-FindDriversWithImprovedFuelEfficiency.sql)   
[3611. Find Overbooked Employees](./leetcode/3611-FindOverbookedEmployees.sql)   
[3617. Find Students with Study Spiral Pattern](./leetcode/3617-FindStudentsWithStudySpiralPattern.sql)   
[3626. Find Stores with Inventory Imbalance](./leetcode/3626-FindStoresWithInventoryImbalance.sql)   
[3642. Find Books with Polarized Opinions](./leetcode/3642-FindBooksWithPolarizedOpinions.sql)   
[3673. Find Zombie Sessions](./leetcode/3673-FindZombieSessions.sql)   
[3705. Find Golden Hour Customers](./leetcode/3705-FindGoldenHourCustomers.sql)   
[3716. Find Churn Risk Customers](./leetcode/3716-FindChurnRiskCustomers.sql)   
[3764. Most Common Course Pairs](./leetcode/3764-MostCommonCoursePairs.sql)   
[3793. Find Users with High Token Usage](./leetcode/3793-FindUsersWithHighTokenUsage.sql)   
[3808. Find Emotionally Consistent Users](./leetcode/3808-FindEmotionallyConsistentUsers.sql)   
[3832. Find Users with Persistent Behavior Patterns](./leetcode/3832-FindUsersWithPersistentBehaviorPatterns.sql)   

# Shell
[192. Word Frequency](./leetcode/192-WordFrequency.sh)      
[193. Valid Phone Numbers](./leetcode/193-ValidPhoneNumbers.sh)    
[194. Transpose File)](./leetcode/194-TransposeFile.sh)   
[195. Tenth Line](./leetcode/195-TenthLine.sh)   

# Concurrency
[1114. Print in Order](./leetcode/1114-PrintInOrder.java)   
[1115. Print FooBar Alternately](./leetcode/1115-PrintFooBarAlternately.java)   
[1116. Print Zero Even Odd](./leetcode/1116-PrintZeroEvenOdd.java)   
[1117. Building H2O](./leetcode/1117-BuildingH2O.java)   
[1188. Design Bounded Blocking Queue](./leetcode/1188-DesignBoundedBlockingQueue.java)   
[1195. Fizz Buzz Multithreaded](./leetcode/1195-FizzBuzzMultithreaded.java)   
[1226. The Dining Philosophers](./leetcode/1226-TheDiningPhilosophers.java)   
[1242. Web Crawler Multithreaded](./leetcode/1242-WebCrawlerMultithreaded.java)   
[1279. Traffic Light Controlled Intersection](./leetcode/1279-TrafficLightControlledIntersection.java)   

# Javascript
[2618. Check if Object Instance of Class](./leetcode/2618-CheckIfObjectInstanceOfClass.js)   
[2619. Array Prototype Last](./leetcode/2619-Array-Prototype-Last.js)    
[2620. Counter](./leetcode/2620-counter.js)    
[2621. Sleep](./leetcode/2621-Sleep.js)    
[2622. Cache With Time Limit](./leetcode/2622-CacheWithTimeLimit.js)    
[2623. Memoize](./leetcode/2623-Memoize.js)    
[2624. Snail Traversal](./leetcode/2624-SnailTraversal.js)    
[2625. Flatten Deeply Nested Array](./leetcode/2625-FlattenDeeplyNestedArray.js)    
[2626. Array Reduce Transformation](./leetcode/2626-ArrayReduceTransformation.js)   
[2627. Debounce](./leetcode/2627-Debounce.js)    
[2628. JSON Deep Equal](./leetcode/2628-JSONDeepEqual.js)    
[2629. Function Composition](./leetcode/2629-FunctionComposition.js)    
[2630. Memoize II](./leetcode/2630-MemoizeII.js)   
[2631. Group By](./leetcode/2631-GroupBy.js)   
[2632. Curry](./leetcode/2632-Curry.js)   
[2633. Convert Object to JSON String](./leetcode/2633-ConvertObjectToJSONString.js)   
[2634. Filter Elements from Array](./leetcode/2634-FilterElementsFromArray.js)   
[2635. Apply Transform Over Each Element in Array](./leetcode/2635-ApplyTransformOverEachElementInArray.js)   
[2636. Promise Pool](./leetcode/2636-PromisePool.js)   
[2637. Promise Time Limit](./leetcode/2637-PromiseTimeLimit.js)   
[2648. Generate Fibonacci Sequence](./leetcode/2648-GenerateFibonacciSequence.js)   
[2649. Nested Array Generator](./leetcode/2649-NestedArrayGenerator.js)   
[2650. Design Cancellable Function](./leetcode/2650-DesignCancellableFunction.js)   
[2665. Counter II](./leetcode/2665-CounterII.js)   
[2666. Allow One Function Call](./leetcode/2666-AllowOneFunctionCall.js)   
[2667. Create Hello World Function](./leetcode/2667-CreateHelloWorldFunction.js)    
[2675. Array of Objects to Matrix](./leetcode/2675-ArrayOfObjectsToMatrix.js)    
[2676. Throttle](./leetcode/2676-Throttle.js)    
[2677. Chunk Array](./leetcode/2677-ChunkArray.js)    
[2690. Infinite Method Object](./leetcode/2690-InfiniteMethodObject.js)    
[2691. Immutability Helper](./leetcode/2691-ImmutabilityHelper.js)    
[2692. Make Object Immutable](./leetcode/2692-MakeObjectImmutable.js)    
[2693. Call Function with Custom Context](./leetcode/2693-CallFunctionWithCustomContext.js)    
[2694. Event Emitter](./leetcode/2694-EventEmitter.js)   
[2695. Array Wrapper](./leetcode/2695-ArrayWrapper.js)   
[2700. Differences Between Two Objects](./leetcode/2700-DifferencesBetweenTwoObjects.js)   
[2703. Return Length of Arguments Passed](./leetcode/2703-ReturnLengthOfArgumentsPassed.js)   
[2704. To Be Or Not To Be](./leetcode/2704-ToBeOrNotToBe.js)   
[2705. Compact Object](./leetcode/2705-CompactObject.js)   
[2715. Timeout Cancellation](./leetcode/2715-TimeoutCancellation.js)   
[2721. Execute Asynchronous Functions in Parallel](./leetcode/2721-ExecuteAsynchronousFunctionsInParallel.js)   
[2722. Join Two Arrays by ID](./leetcode/2722-JoinTwoArraysByID.js)   
[2723. Add Two Promises](./leetcode/2723-AddTwoPromises.js)   
[2724. Sort By](./leetcode/2724-SortBy.js)   
[2725. Interval Cancellation](./leetcode/2725-IntervalCancellation.js)   
[2726. Calculator with Method Chaining](./leetcode/2726-CalculatorWithMethodChaining.js)   
[2727. Is Object Empty](./leetcode/2727-IsObjectEmpty.js)    
[2754. Bind Function to Context](./leetcode/2754-BindFunctionToContext.js)    
[2755. Deep Merge of Two Objects](./leetcode/2755-DeepMergeOfTwoObjects.js)    
[2756. Query Batching](./leetcode/2756-QueryBatching.js)    
[2757. Generate Circular Array Values](./leetcode/2757-GenerateCircularArrayValues.js)    
[2758. Next Day](./leetcode/2758-NextDay.js)    
[2759. Convert JSON String to Object](./leetcode/2759-ConvertJSONStringToObject.js)    
[2774. Array Upper Bound](./leetcode/2774-ArrayUpperBound.js)    
[2775. Undefined to Null](./leetcode/2775-UndefinedToNull.js)    
[2776. Convert Callback Based Function to Promise Based Function](./leetcode/2776-ConvertCallbackBasedFunctionToPromiseBasedFunction.js)    
[2777. Date Range Generator](./leetcode/2777-DateRangeGenerator.js)    
[2794. Create Object from Two Arrays](./leetcode/2794-CreateObjectFromTwoArrays.js)    
[2795. Parallel Execution of Promises for Individual Results Retrieval](./leetcode/2795-ParallelExecutionOfPromisesForIndividualResultsRetrieval.js)    
[2796. Repeat String](./leetcode/2796-RepeatString.js)    
[2797. Partial Function with Placeholders](./leetcode/2797-PartialFunctionWithPlaceholders.js)    
[2803. Factorial Generator](./leetcode/2803-FactorialGenerator.js)    
[2804. Array Prototype ForEach](./leetcode/2804-ArrayPrototypeForEach.js)    
[2805. Custom Interval](./leetcode/2805-CustomInterval.js)    
[2821. Delay the Resolution of Each Promise](./leetcode/2821-DelayTheResolutionOfEachPromise.js)    
[2822. Inversion of Object](./leetcode/2822-InversionOfObject.js)    
[2823. Deep Object Filter](./leetcode/2823-DeepObjectFilter.js)    

# Pandas
[175. Combine Two Tables](./leetcode/175-CombineTwoTables.py)   
[176. Second Highest Salary](./leetcode/176-SecondHighestSalary.py)   
[177. Nth Highest Salary](./leetcode/177-NthHighestSalary.py)   
[178. Rank Scores](./leetcode/178-RankScores.py)   
[183. Customers Who Never Order](./leetcode/183-CustomersWhoNeverOrder.py)   
[184. Department Highest Salary](./leetcode/184-DepartmentHighestSalary.py)   
[196. Delete Duplicate Emails](./leetcode/196-DeleteDuplicateEmails.py)   
[511. Game Play Analysis I](./leetcode/511-GamePlayAnalysisI.py)   
[570. Managers with at Least 5 Direct Reports](./leetcode/570-ManagersWithAtLeast5DirectReports.py)   
[586. Customer Placing the Largest Number of Orders](./leetcode/586-CustomerPlacingtheLargestNumberofOrders.py)   
[595. Big Countries](./leetcode/595-BigCountries.py)   
[596. Classes More Than 5 Students](./leetcode/596-ClassesMoreThan5Students.py)   
[607. Sales Person](./leetcode/607-SalesPerson.py)   
[1050. Actors and Directors Who Cooperated At Least Three Times](./leetcode/1050-ActorsandDirectorsWhoCooperatedAtLeastThreeTimes.py)   
[1173. Immediate Food Delivery I](./leetcode/1173-ImmediateFoodDeliveryI.py)   
[1148. Article Views I](./leetcode/1148-ArticleViewsI.py)   
[1280. Students and Examinations](./leetcode/1280-StudentsAndExaminations.py)   
[1322. Ads Performance](./leetcode/1322-AdsPerformance.py)   
[1378. Replace Employee ID With The Unique Identifier](./leetcode/1378-ReplaceEmployeeIDWithTheUniqueIdentifier.py)   
[1484. Group Sold Products By The Date](./leetcode/1484-GroupSoldProductsByTheDate.py)   
[1517. Find Users With Valid E-Mails](./leetcode/1517-FindUsersWithValidEMails.py)   
[1527. Patients With a Condition](./leetcode/1527-PatientsWithaCondition.py)   
[1667. Fix Names in a Table](./leetcode/1667-FixNamesinaTable.py)   
[1683. Invalid Tweets](./leetcode/1683-InvalidTweets.py)   
[1693. Daily Leads and Partners](./leetcode/1693-DailyLeadsandPartners.py)   
[1741. Find Total Time Spent by Each Employee](./leetcode/1741-FindTotalTimeSpentbyEachEmployee.py)   
[1757. Recyclable and Low Fat Products](./leetcode/1757-RecyclableAndLowFatProducts.py)   
[1795. Rearrange Products Table](./leetcode/1795-RearrangeProductsTable.py)   
[1873. Calculate Special Bonus](./leetcode/1873-CalculateSpecialBonus.py)   
[1907. Count Salary Categories](./leetcode/1907-CountSalaryCategories.py)   
[2041. Accepted Candidates From the Interviews](./leetcode/2041-AcceptedCandidatesFromtheInterviews.py)   
[2082. The Number of Rich Customers](./leetcode/2082-TheNumberOfRichCustomers.py)   
[2356. Number of Unique Subjects Taught by Each Teacher](./leetcode/2356-NumberofUniqueSubjectsTaughtbyEachTeacher.py)   
[2738. Count Occurrences in Text](./leetcode/2738-CountOccurrencesInText.py)   
[2877. Create a DataFrame from List](./leetcode/2877-CreateADataFrameFromList.py)   
[2878. Get the Size of a DataFrame](./leetcode/2878-GetTheSizeOfADataFrame.py)   
[2879. Display the First Three Rows](./leetcode/2879-DisplayTheFirstThreeRows.py)   
[2880. Select Data](./leetcode/2880-SelectData.py)   
[2881. Create a New Column](./leetcode/2881-CreateANewColumn.py)   
[2882. Drop Duplicate Rows](./leetcode/2882-DropDuplicateRows.py)   
[2883. Drop Missing Data](./leetcode/2883-DropMissingData.py)   
[2884. Modify Columns](./leetcode/2884-ModifyColumns.py)   
[2885. Rename Columns](./leetcode/2885-RenameColumns.py)   
[2886. Change Data Type](./leetcode/2886-ChangeDataType.py)   
[2887. Fill Missing Data](./leetcode/2887-FillMissingData.py)   
[2888. Reshape Data: Concatenate](./leetcode/2888-ReshapeDataConcatenate.py)   
[2889. Reshape Data: Pivot](./leetcode/2889-ReshapeDataPivot.py)   
[2890. Reshape Data: Melt](./leetcode/2890-ReshapeDataMelt.py)   
[2891. Method Chaining](./leetcode/2891-MethodChaining.py)   

# LCR
[LCR 001. 两数相除](./leetcode/LCR001-DividingTwoNumbers.go)   
[LCR 002. 二进制求和](./leetcode/LCR002-BinarySummation.go)   
[LCR 003. 比特位计数](./leetcode/LCR003-BitCount.go)   
[LCR 004. 只出现一次的数字 II](./leetcode/LCR004-SingleNumberII.go)   
[LCR 005. 最大单词长度乘积](./leetcode/LCR005-ProductOfMaximumWordLength.go)   
[LCR 006. 两数之和 II - 输入有序数组](./leetcode/LCR006-TwoSumII.go)   
[LCR 007. 三数之和](./leetcode/LCR007-ThreeSum.go)   
[LCR 008. 长度最小的子数组](./leetcode/LCR008-MinimumSizeSubarraySum.go)   
[LCR 009. 乘积小于 K 的子数组](./leetcode/LCR009-SubarrayProductLessThanK.go)   
[LCR 010. 和为 K 的子数组](./leetcode/LCR010-SubarraySumEqualsK.go)   
[LCR 011. 连续数组](./leetcode/LCR011-ContiguousArray.go)   
[LCR 012. 寻找数组的中心下标](./leetcode/LCR012-FindPivotIndex.go)   
[LCR 013. 二维区域和检索 - 矩阵不可变](./leetcode/LCR013-RangeSumQuery2DImmutable.go)   
[LCR 014. 字符串的排列](./leetcode/LCR014-PermutationInString.go)   
[LCR 015. 找到字符串中所有字母异位词](./leetcode/LCR015-FindAllAnagramsInAString.go)   
[LCR 016. 无重复字符的最长子串](./leetcode/LCR016-LongestSubstringWithoutRepeatingCharacters.go)   
[LCR 017. 最小覆盖子串](./leetcode/LCR017-MinimumWindowSubstring.go)   
[LCR 018. 验证回文串](./leetcode/LCR018-ValidPalindrome.go)   
[LCR 019. 验证回文串 II](./leetcode/LCR019-ValidPalindromeII.go)   
[LCR 020. 回文子串](./leetcode/LCR020-PalindromicSubstrings.go)   
[LCR 021. 删除链表的倒数第 N 个结点](./leetcode/LCR021-RemoveNthNodeFromEndOfList.go)   
[LCR 022. 环形链表 II](./leetcode/LCR022-LinkedListCycleII.go)   
[LCR 023. 相交链表](./leetcode/LCR023-IntersectionOfTwoLinkedLists.go)   
[LCR 024. 反转链表](./leetcode/LCR024-ReverseLinkedList.go)   
[LCR 025. 两数相加 II](./leetcode/LCR025-AddTwoNumbersII.go)   
[LCR 026. 重排链表](./leetcode/LCR026-ReorderList.go)   
[LCR 027. 回文链表](./leetcode/LCR027-PalindromeLinkedList.go)   
[LCR 028. 扁平化多级双向链表](./leetcode/LCR028-FlattenAMultilevelDoublyLinkedList.go)   
[LCR 029. 循环有序列表的插入](./leetcode/LCR029-InsertIntoAAortedCircularLinkedList.go)   
[LCR 030. O(1) 时间插入、删除和获取随机元素](./leetcode/LCR030-InsertDeleteGetRandomO1.go)   
[LCR 031. LRU 缓存](./leetcode/LCR031-LRUCache.go)   
[LCR 032. 有效的字母异位词](./leetcode/LCR032-ValidAnagram.go)   
[LCR 033. 字母异位词分组](./leetcode/LCR033-GroupAnagrams.go)   
[LCR 034. 验证外星语词典](./leetcode/LCR034-VerifyingAnAlienDictionary.go)   
[LCR 035. 最小时间差](./leetcode/LCR035-MinimumTimeDifference.go)   
[LCR 036. 逆波兰表达式求值](./leetcode/LCR036-EvaluateReversePolishNotation.go)   
[LCR 037. 行星碰撞](./leetcode/LCR037-AsteroidCollision.go)   
[LCR 038. 每日温度](./leetcode/LCR038-DailyTemperatures.go)   
[LCR 039. 柱状图中最大的矩形](./leetcode/LCR039-LargestRectangleInHistogram.go)   
[LCR 040. 最大矩形](./leetcode/LCR040-MaximalRectangle.go)   
[LCR 041. 数据流中的移动平均值](./leetcode/LCR041-MovingAverageFromDataStream.go)   
[LCR 042. 最近的请求次数](./leetcode/LCR042-NumberOfRecentCalls.go)   
[LCR 043. 完全二叉树插入器](./leetcode/LCR043-CompleteBinaryTreeInserter.go)   
[LCR 044. 在每个树行中找最大值](./leetcode/LCR044-FindLargestValueInEachTreeRow.go)   
[LCR 045. 找树左下角的值](./leetcode/LCR045-FindBottomLeftTreeValue.go)   
[LCR 046. 二叉树的右视图](./leetcode/LCR046-BinaryTreeRightSideView.go)   
[LCR 047. 二叉树剪枝](./leetcode/LCR047-BinaryTreePruning.go)   
[LCR 048. 二叉树的序列化与反序列化](./leetcode/LCR048-SerializeAndDeserializeBinaryTree.go)   
[LCR 049. 求根节点到叶节点数字之和](./leetcode/LCR049-SumRootToLeafNumbers.go)   
[LCR 050. 路径总和 III](./leetcode/LCR050-PathSumIII.go)   
[LCR 051. 二叉树中的最大路径和](./leetcode/LCR051-BinaryTreeMaximumPathSum.go)   
[LCR 052. 递增顺序搜索树](./leetcode/LCR052-IncreasingOrderSearchTree.go)   
[LCR 053. 二叉搜索树中的中序后继](./leetcode/LCR053-InorderSuccessorInBinarySearchTree.go)   
[LCR 054. 把二叉搜索树转换为累加树](./leetcode/LCR054-BinarySearchTreeToGreaterSumTree.go)   
[LCR 055. 二叉搜索树迭代器](./leetcode/LCR055-BinarySearchTreeIterator.go)   
[LCR 056. 两数之和 IV - 输入二叉搜索树](./leetcode/LCR056-TwoSumIV-InputBinarySearchTree.go)   
[LCR 057. 存在重复元素 III](./leetcode/LCR057-ContainsDuplicateIII.go)   
[LCR 058. 我的日程安排表 I](./leetcode/LCR058-MyCalendarI.go)   
[LCR 059. 数据流中的第 K 大元素](./leetcode/LCR059-KthLargestElementInAStream.go)   
[LCR 060. 前 K 个高频元素](./leetcode/LCR060-TopKFrequentElements.go)   
[LCR 061. 查找和最小的 K 对数字](./leetcode/LCR061-FindKPairsWithSmallestSums.go)   
[LCR 062. 实现 Trie (前缀树)](./leetcode/LCR062-ImplementTriePrefixTree.go)   
[LCR 063. 单词替换](./leetcode/LCR063-ReplaceWords.go)   
[LCR 064. 实现一个魔法字典](./leetcode/LCR064-ImplementMagicDictionary.go)   
[LCR 065. 单词的压缩编码](./leetcode/LCR065-ShortEncodingOfWords.go)   
[LCR 066.  键值映射](./leetcode/LCR066-MapSumPairs.go)   
[LCR 067. 数组中两个数的最大异或值](./leetcode/LCR067-MaximumXOROfTwoNumbersInAnArray.go)   
[LCR 068. 搜索插入位置](./leetcode/LCR068-SearchInsertPosition.go)   
[LCR 069. 山脉数组的峰顶索引](./leetcode/LCR069-PeakIndexInAMountainArray.go)   
[LCR 070. 有序数组中的单一元素](./leetcode/LCR070-SingleElementInASortedArray.go)   
[LCR 071. 按权重随机选择](./leetcode/LCR071-RandomPickWithWeight.go)   
[LCR 072. x 的平方根](./leetcode/LCR072-SqrtX.go)   
[LCR 073. 爱吃香蕉的狒狒](./leetcode/LCR073-KokoEatingBananas.go)   
[LCR 074. 合并区间](./leetcode/LCR074-MergeIntervals.go)   
[LCR 075. 数组的相对排序](./leetcode/LCR075-RelativeSortArray.go)   
[LCR 076. 数组中的第 K 个最大元素](./leetcode/LCR076-KthLargestElementInAnArray.go)   
[LCR 077. 排序链表](./leetcode/LCR077-SortList.go)   
[LCR 078. 合并 K 个升序链表](./leetcode/LCR078-MergeKSortedLists.go)   
[LCR 079. 子集](./leetcode/LCR079-Subsets.go)   
[LCR 080. 组合](./leetcode/LCR080-Combinations.go)   
[LCR 081. 组合总和](./leetcode/LCR081-CombinationSum.go)   
[LCR 082. 组合总和 II](./leetcode/LCR082-CombinationSumII.go)   
[LCR 083. 全排列](./leetcode/LCR083-Permutations.go)   
[LCR 084. 全排列 II](./leetcode/LCR084-PermutationsII.go)   
[LCR 085. 括号生成](./leetcode/LCR085-GenerateParentheses.go)   
[LCR 086. 分割回文串](./leetcode/LCR086-PalindromePartitioning.go)   
[LCR 087. 复原 IP 地址](./leetcode/LCR087-RestoreIPAddresses.go)   
[LCR 088. 使用最小花费爬楼梯](./leetcode/LCR088-MincostClimbingStairs.go)   
[LCR 089. 打家劫舍](./leetcode/LCR089-HouseRobber.go)   
[LCR 090. 打家劫舍 II](./leetcode/LCR090-HouseRobberII.go)   
[LCR 091. 粉刷房子](./leetcode/LCR091-PaintHouse.go)   
[LCR 092. 将字符串翻转到单调递增](./leetcode/LCR092-FlipStringToMonotoneIncreasing.go)   
[LCR 093. 最长的斐波那契子序列的长度](./leetcode/LCR093-LengthOfLongestFibonacciSubsequence.go)   
[LCR 094. 分割回文串 II](./leetcode/LCR094-PalindromePartitioningII.go)   
[LCR 095. 最长公共子序列](./leetcode/LCR095-LongestCommonSubsequence.go)   
[LCR 096. 交错字符串](./leetcode/LCR096-InterleavingString.go)   
[LCR 097. 不同的子序列](./leetcode/LCR097-DistinctSubsequences.go)   
[LCR 098. 不同路径](./leetcode/LCR098-UniquePaths.go)   
[LCR 099. 最小路径和](./leetcode/LCR099-MinimumPathSum.go)   
[LCR 100. 三角形最小路径和](./leetcode/LCR100-Triangle.go)   
[LCR 101. 分割等和子集](./leetcode/LCR101-PartitionEqualSubsetSum.go)   
[LCR 102. 目标和](./leetcode/LCR102-TargetSum.go)   
[LCR 103. 零钱兑换](./leetcode/LCR103-CoinChange.go)   
[LCR 104. 组合总和 Ⅳ](./leetcode/LCR104-CombinationSumIV.go)   
[LCR 105. 岛屿的最大面积](./leetcode/LCR105-MaxAreaOfIsland.go)   
[LCR 106. 判断二分图](./leetcode/LCR106-IsGraphBipartite.go)   
[LCR 107. 01 矩阵](./leetcode/LCR107-01matrix.go)   
[LCR 108. 单词接龙](./leetcode/LCR108-WordLadder.go)   
[LCR 109. 打开转盘锁](./leetcode/LCR109-OpenSwingLock.go)   
[LCR 110. 所有可能的路径](./leetcode/LCR-110-AllPathsFromSourceToTarget.go)   
[LCR 111. 除法求值](./leetcode/LCR-111-EvaluateDivision.go)   
[LCR 112. 矩阵中的最长递增路径](./leetcode/LCR112-LongestIncreasingPathInAMatrix.go)   
[LCR 113. 课程表 II](./leetcode/LCR113-CourseScheduleII.go)   
[LCR 114. 火星词典](./leetcode/LCR114-AlienDictionary.go)   
[LCR 115. 序列重建](./leetcode/LCR115-SequenceReconstruction.go)   
[LCR 116. 省份数量](./leetcode/LCR116-NumberOfProvinces.go)   
[LCR 117. 相似字符串组](./leetcode/LCR117-SimilarStringGroups.go)   
[LCR 118. 冗余连接](./leetcode/LCR118-RedundantConnection.go)   
[LCR 119. 最长连续序列](./leetcode/LCR119-LongestConsecutiveSequence.go)   
[LCR 120. 寻找文件副本](./leetcode/LCR120-FindRepeatDocument.go)   
[LCR 121. 寻找目标值 - 二维数组](./leetcode/LCR121-FindTargetInMatrix.go)   
[LCR 122. 路径加密](./leetcode/LCR122-PathEncryption.go)   
[LCR 123. 图书整理 I](./leetcode/LCR123-ReverseBookList.go)   
[LCR 124. 推理二叉树](./leetcode/LCR124-DeduceBinaryTree.go)   
[LCR 125. 图书整理 II](./leetcode/LCR125-BookQueue.go)   
[LCR 126. 斐波那契数](./leetcode/LCR126-Fibonacci.go)   
[LCR 127. 跳跃训练](./leetcode/LCR127-TrainWays.go)   
[LCR 128. 库存管理 I](./leetcode/LCR128-StockManagementI.go)   
[LCR 129. 字母迷宫](./leetcode/LCR129-WordPuzzle.go)   
[LCR 130. 衣橱整理](./leetcode/LCR130-WardrobeFinishing.go)   
[LCR 131. 砍竹子 I](./leetcode/LCR131-CuttingBamboo.go)   
[LCR 132. 砍竹子 II](./leetcode/LCR132-CuttingBambooII.go)   
[LCR 133. 位 1 的个数](./leetcode/LCR133-NumberOfOneBits.go)   
[LCR 134. Pow(x, n)](./leetcode/LCR134-PowXN.go)   
[LCR 135. 报数](./leetcode/LCR135-CountNumbers.go)   
[LCR 136. 删除链表的节点](./leetcode/LCR136-DeleteNode.go)   
[LCR 137. 模糊搜索验证](./leetcode/LCR137-RegularExpressionMatching.go)   
[LCR 138. 有效数字](./leetcode/LCR138-ValidNumber.go)   
[LCR 139. 训练计划 I](./leetcode/LCR139-TrainningPlanI.go)   
[LCR 140. 训练计划 II](./leetcode/LCR140-TrainningPlanII.go)   
[LCR 141. 训练计划 III](./leetcode/LCR141-TrainningPlanIII.go)   
[LCR 142. 训练计划 IV](./leetcode/LCR142-TrainningPlanIV.go)   
[LCR 143. 子结构判断](./leetcode/LCR143-IsSubStructure.go)   
[LCR 144. 翻转二叉树](./leetcode/LCR144-InvertBinaryTree.go)   
[LCR 145. 判断对称二叉树](./leetcode/LCR145-SymmetricTree.go)   
[LCR 146. 螺旋遍历二维数组](./leetcode/LCR146-SpiralMatrix.go)   
[LCR 147. 最小栈](./leetcode/LCR147-MinStack.go)   
[LCR 148. 验证图书取出顺序](./leetcode/LCR148-ValidateStackSequences.go)   
[LCR 149. 彩灯装饰记录 I](./leetcode/LCR149-DecorateRecord.go)   
[LCR 150. 彩灯装饰记录 II](./leetcode/LCR150-DecorateRecordII.go)   
[LCR 151. 彩灯装饰记录 III](./leetcode/LCR151-DecorateRecordIII.go)   
[LCR 152. 验证二叉搜索树的后序遍历序列](./leetcode/LCR152-VerifyBinarySearchTreePostorderTraversalOrder.go)   
[LCR 153. 二叉树中和为目标值的路径](./leetcode/LCR153-BinaryTreePathSum.go)   
[LCR 154. 复杂链表的复制](./leetcode/LCR154-CopyListWithRandomPointer.go)   
[LCR 155. 将二叉搜索树转化为排序的双向链表](./leetcode/LCR155-ConvertBinarySearchTreeToSortedDoublyLinkedList.go)   
[LCR 156. 序列化与反序列化二叉树](./leetcode/LCR156-SerializeAndDeserializeBinaryTree.go)   
[LCR 157. 套餐内商品的排列顺序](./leetcode/LCR157-GoodsOrder.go)   
[LCR 158. 库存管理 II](./leetcode/LCR158-InventoryManagementII.go)   
[LCR 159. 库存管理 III](./leetcode/LCR159-InventoryManagementIII.go)   
[LCR 160. 数据流中的中位数](./leetcode/LCR160-FindMedianFromDataStream.go)   
[LCR 161. 连续天数的最高销售额](./leetcode/LCR161-MaximumSales.go)   
[LCR 162. 数字 1 的个数](./leetcode/LCR162-NumberOfDigitOne.go)   
[LCR 163. 找到第 k 位数字](./leetcode/LCR163-NthDigit.go)   
[LCR 164. 破解闯关密码](./leetcode/LCR164-CrackPassword.go)   
[LCR 165. 解密数字](./leetcode/LCR165-CrackNumber.go)   
[LCR 166. 珠宝的最高价值](./leetcode/LCR166-JewelleryValue.go)   
[LCR 167. 招式拆解 I](./leetcode/LCR167-DismantlingActionI.go)   
[LCR 168. 丑数](./leetcode/LCR168-UglyNumber.go)   
[LCR 169. 招式拆解 II](./leetcode/LCR169-DismantlingActionII.go)   
[LCR 170. 交易逆序对的总数](./leetcode/LCR170-TotalNumberOfReverseTradingPairs.go)   
[LCR 171. 训练计划 V](./leetcode/LCR171-TrainningPlanV.go)   
[LCR 172. 统计目标成绩的出现次数](./leetcode/LCR172-CountTarget.go)   
[LCR 173. 点名](./leetcode/LCR173-TakeAttendance.go)   
[LCR 174. 寻找二叉搜索树中的目标节点](./leetcode/LCR174-FindSearchBinaryTreeTargetNode.go)   
[LCR 175. 计算二叉树的深度](./leetcode/LCR175-CalculateBinaryTreeDepth.go)   
[LCR 176. 判断是否为平衡二叉树](./leetcode/LCR176-BalancedBinaryTree.go)   
[LCR 177. 撞色搭配](./leetcode/LCR177-SockCollocation.go)   
[LCR 178. 训练计划 VI](./leetcode/LCR178-TrainningPlanVI.go)   
[LCR 179. 查找总价格为目标值的两个商品](./leetcode/LCR179-TwoSum.go)   
[LCR 180. 文件组合](./leetcode/LCR180-FileCombination.go)   
[LCR 182. 动态口令](./leetcode/LCR182-DynamicPassword.go)   
[LCR 181. 字符串中的单词反转](./leetcode/LCR181-ReverseWordsInAString.go)   
[LCR 183. 望远镜中最高的海拔](./leetcode/LCR183-SlidingWindowMaximum.go)   
[LCR 184. 设计自助结算系统](./leetcode/LCR184-DesignCheckoutSystem.go)   
[LCR 185. 统计结果概率](./leetcode/LCR185-StatisticsProbability.go)   
[LCR 186. 文物朝代判断](./leetcode/LCR186-CheckDynasty.go)   
[LCR 187. 破冰游戏](./leetcode/LCR187-IceBreakingGame.go)   
[LCR 188. 买卖芯片的最佳时机](./leetcode/LCR188-BestTiming.go)   
[LCR 189. 设计机械累加器](./leetcode/LCR189-MechanicalAccumulator.go)   
[LCR 190. 加密运算](./leetcode/LCR190-EncryptionCalculate.go)   
[LCR 191. 按规则计算统计结果](./leetcode/LCR191-StatisticalResult.go)   
[LCR 192. 把字符串转换成整数 (atoi)](./leetcode/LCR192-StringToInteger.go)   
[LCR 193. 二叉搜索树的最近公共祖先](./leetcode/LCR193-LowestCommonAncestorOfBinarySearchTree.go)   
[LCR 194. 二叉树的最近公共祖先](./leetcode/LCR194-LowestCommonAncestorOfBinaryTree.go)   

# LCP
[LCP 01. 猜数字](./leetcode/LCP01-GuessNumbers.go)   
[LCP 02. 分式化简](./leetcode/LCP02-DeepDarkFraction.go)   
[LCP 03. 机器人大冒险](./leetcode/LCP03-RobotAdventure.go)   
[LCP 04. 覆盖](./leetcode/LCP04-Domino.go)   
[LCP 05. 发 LeetCoin](./leetcode/LCP05-LeetCoinIssuance.go)   
[LCP 06. 拿硬币](./leetcode/LCP06-TakeCoin.go)   
[LCP 07. 传递信息](./leetcode/LCP07-PassMessage.go)   
[LCP 08. 剧情触发时间](./leetcode/LCP08-PlotTriggerTime.go)   
[LCP 09. 最小跳跃次数](./leetcode/LCP09-MinJump.go)   
[LCP 10. 二叉树任务调度](./leetcode/LCP10-BinaryTreeTaskScheduling.go)   
[LCP 11. 期望个数统计](./leetcode/LCP11-ExpectedQuantityStatistics.go)   
[LCP 12. 小张刷题计划](./leetcode/LCP12-BrushingQuestionsPlan.go)   
[LCP 13. 寻宝](./leetcode/LCP13-TreasureHunt.go)   
[LCP 14. 切分数组](./leetcode/LCP14-SplitArray.go)   
[LCP 15. 游乐园的迷宫](./leetcode/LCP15-MazeOfAmusementPark.go)   
[LCP 16. 游乐园的游览计划](./leetcode/LCP16-TourPlanForAmusementParks.go)   
[LCP 17. 速算机器人](./leetcode/LCP17-CalculateRobot.go)   
[LCP 18. 早餐组合](./leetcode/LCP18-BreakfastCombination.go)   
[LCP 19. 秋叶收藏集](./leetcode/LCP19-LeavesCollections.go)   
[LCP 20. 快速公交](./leetcode/LCP20-BusRapidTransit.go)   
[LCP 21. 追逐游戏](./leetcode/LCP21-ChaseGame.go)   
[LCP 22. 黑白方格画](./leetcode/LCP22-BlackAndWhiteCheckeredPainting.go)   
[LCP 23. 魔术排列](./leetcode/LCP23-MagicArrangement.go)   
[LCP 24. 数字游戏](./leetcode/LCP24-NumberGame.go)   
[LCP 25. 古董键盘](./leetcode/LCP25-AntiqueKeyboard.go)   
[LCP 26. 导航装置](./leetcode/LCP26-NavigationDevice.go)   
[LCP 27. 黑盒光线反射](./leetcode/LCP27-BlackBox.go)   
[LCP 28. 采购方案](./leetcode/LCP28-PurchasePlans.go)   
[LCP 29. 乐团站位](./leetcode/LCP29-BandPositioning.go)   
[LCP 30. 魔塔游戏](./leetcode/LCP30-MagicTowerGame.go)   
[LCP 31. 变换的迷宫](./leetcode/LCP31-TransformationalMaze.go)   
[LCP 32. 批量处理任务](./leetcode/LCP32-BatchProcessingTasks.go)   
[LCP 33. 蓄水](./leetcode/LCP33-StoreWater.go)   
[LCP 34. 二叉树染色](./leetcode/LCP34-BinaryTreeStaining.go)   
[LCP 35. 电动车游城市](./leetcode/LCP35-ElectricCarPlan.go)   
[LCP 36. 最多牌组数](./leetcode/LCP36-MaxGroupNumber.go)   
[LCP 37. 最小矩形面积](./leetcode/LCP37-MinimumRectangularArea.go)   
[LCP 38. 守卫城堡](./leetcode/LCP38-GuardCastle.go)   
[LCP 39. 无人机方阵](./leetcode/LCP39-DroneArray.go)   
[LCP 40. 心算挑战](./leetcode/LCP40-MaxmiumScore.go)   
[LCP 41. 黑白翻转棋](./leetcode/LCP41-ReversiDeluxe.go)   
[LCP 42. 玩具套圈](./leetcode/LCP42-CircleGame.go)   
[LCP 43. 十字路口的交通](./leetcode/LCP43-TrafficAtCrossroads.go)   
[LCP 44. 开幕式焰火](./leetcode/LCP44-TheOpeningCeremonyFireworks.go)   
[LCP 45. 自行车炫技赛场](./leetcode/LCP45-BicycleYard.go)   
[LCP 46. 志愿者调配](./leetcode/LCP46-VolunteerDeployment.go)   
[LCP 47. 入场安检](./leetcode/LCP47-SecurityCheck.go)   
[LCP 48. 无限棋局](./leetcode/LCP48-InfiniteGobang.go)   
[LCP 49. 环形闯关游戏](./leetcode/LCP49-RingGame.go)   
[LCP 50. 宝石补给](./leetcode/LCP50-GemSupply.go)   
[LCP 51. 烹饪料理](./leetcode/LCP51-Cook.go)   
[LCP 52. 二叉搜索树染色](./leetcode/LCP52-BinarySearchTreeStaining.go)   
[LCP 53. 守护太空城](./leetcode/LCP53-DefendSpaceCity.go)   
[LCP 54. 夺回据点](./leetcode/LCP54-RetrieveTheStronghold.go)   
[LCP 55. 采集果实](./leetcode/LCP55-CollectFruits.go)   
[LCP 56. 信物传送](./leetcode/LCP56-ConveyorBelt.go)   
[LCP 57. 打地鼠](./leetcode/LCP57-WhackAMole.go)   
[LCP 58. 积木拼接](./leetcode/LCP58-BuildingBlockSplicing.go)   
[LCP 59. 搭桥过河](./leetcode/LCP59-BuildBridge.go)   
[LCP 60. 力扣泡泡龙](./leetcode/LCP60-LeetcodePuzzleBobble.go)   
[LCP 61. 气温变化趋势](./leetcode/LCP61-TemperatureTrend.go)   
[LCP 62. 交通枢纽](./leetcode/LCP62-TransportationHub.go)   
[LCP 63. 弹珠游戏](./leetcode/LCP63-MarblesGame.go)   
[LCP 64. 二叉树灯饰](./leetcode/LCP64-BinaryTreeLighting.go)   
[LCP 65. 舒适的湿度](./leetcode/LCP65-ComfortableHumidity.go)   
[LCP 66. 最小展台数量](./leetcode/LCP66-MinimumNumberOfExhibitionBooths.go)   
[LCP 67. 装饰树](./leetcode/LCP67-DecoratedTree.go)   
[LCP 68. 美观的花束](./leetcode/LCP68-BeautifulFlowers.go)   
[LCP 69. Hello LeetCode!](./leetcode/LCP69-HelloLeetCode.go)   
[LCP 70. 沙地治理](./leetcode/LCP70-SandyLandManagement.go)   
[LCP 71. 集水器](./leetcode/LCP71-Reservoir.go)   
[LCP 72. 补给马车](./leetcode/LCP72-SupplyWagon.go)   
[LCP 73. 探险营地](./leetcode/LCP73-AdventureCamp.go)   
[LCP 74. 最强祝福力场](./leetcode/LCP74-FieldOfGreatestBlessing.go)   
[LCP 75. 传送卷轴](./leetcode/LCP75-PortalScroll.go)   
[LCP 76. 魔法棋盘](./leetcode/LCP76-MagicBoard.go)   
[LCP 77. 符文储备](./leetcode/LCP77-RuneReserve.go)   
[LCP 78. 城墙防线](./leetcode/LCP78-RampartDefense.go)   
[LCP 79. 提取咒文](./leetcode/LCP79-ExtractMantra.go)   
[LCP 80. 生物进化录](./leetcode/LCP80-EvolutionaryRecord.go)   
[LCP 81. 与非的谜题](./leetcode/LCP81-NAndPuzzle.go)   
[LCP 82. 万灵之树](./leetcode/LCP82-TheTreeOfAllSouls.go)   

# LCS
[LCS 01. 下载插件](./leetcode/LCS01-DownloadPlugins.go)   
[LCS 02. 完成一半题目](./leetcode/LCS02-HalfQuestions.go)   
[LCS 03. 主题空间](./leetcode/LCS03-LargestArea.go)   

# LCCI
[面试题 01.01. Is Unique LCCI](./leetcode/LCCI0101-IsUnique.go)   
[面试题 01.02. Check Permutation LCCI](./leetcode/LCCI0102-CheckPermutation.go)   
[面试题 01.03. String to URL LCCI](./leetcode/LCCI0103-StringToURL.go)   
[面试题 01.04. Palindrome Permutation LCCI](./leetcode/LCCI0104-PalindromePermutation.go)   
[面试题 01.05. One Away LCCI](./leetcode/LCCI0105-OneAway.go)   
[面试题 01.06. Compress String LCCI](./leetcode/LCCI0106-CompressString.go)   
[面试题 01.06. Compress String LCCI](./leetcode/LCCI0106-CompressString.go)   
[面试题 01.07. Rotate Matrix LCCI](./leetcode/LCCI0107-RotateMatrix.go)   
[面试题 01.08. Zero Matrix LCCI](./leetcode/LCCI0108-ZeroMatrix.go)   
[面试题 01.09. String Rotation LCCI](./leetcode/LCCI0109-StringRotation.go)   
[面试题 02.01. Remove Duplicate Node LCCI](./leetcode/LCCI0201-RemoveDuplicateNode.go)   
[面试题 02.02. Kth Node From End of List LCCI](./leetcode/LCCI0202-KthNodeFromEndOfList.go)   
[面试题 02.03. Delete Middle Node LCCI](./leetcode/LCCI0203-DeleteMiddleNode.go)   
[面试题 02.04. Partition List LCCI](./leetcode/LCCI0204-PartitionList.go)   
[面试题 02.05. Sum Lists LCCI](./leetcode/LCCI0205-SumLists.go)   
[面试题 02.06. Palindrome Linked List LCCI](./leetcode/LCCI0206-PalindromeLinkedList.go)   
[面试题 02.07. Intersection of Two Linked Lists LCCI](./leetcode/LCCI0207-IntersectionOfTwoLinkedLists.go)   
[面试题 02.08. Linked List Cycle LCCI](./leetcode/LCCI0208-LinkedListCycle.go)   
[面试题 03.01. Three in One LCCI](./leetcode/LCCI0301-ThreeInOne.go)   
[面试题 03.02. Min Stack LCCI](./leetcode/LCCI0302-MinStack.go)   
[面试题 03.03. Stack of Plates LCCI](./leetcode/LCCI0303-StackOfPlates.go)   
[面试题 03.04. Implement Queue using Stacks LCCI](./leetcode/LCCI0304-ImplementQueueUsingStacks.go)   
[面试题 03.05. Sort of Stacks LCCI](./leetcode/LCCI0305-SortOfStacks.go)   
[面试题 03.06. Animal Shelter LCCI](./leetcode/LCCI0306-AnimalShelter.go)   
[面试题 04.01. Route Between Nodes LCCI](./leetcode/LCCI0401-RouteBetweenNodes.go)   
[面试题 04.02. Minimum Height Tree LCCI](./leetcode/LCCI0402-MinimumHeightTree.go)   
[面试题 04.03. List of Depth LCCI](./leetcode/LCCI0403-ListOfDepth.go)   
[面试题 04.04. Check Balance LCCI](./leetcode/LCCI0404-CheckBalance.go)   
[面试题 04.05. Legal Binary Search Tree LCCI](./leetcode/LCCI0405-LegalBinarySearchTree.go)   
[面试题 04.06. Successor LCCI](./leetcode/LCCI0406-Successor.go)   
[面试题 04.08. First Common Ancestor LCCI](./leetcode/LCCI0408-FirstCommonAncestor.go)   
[面试题 04.09. BST Sequences LCCI](./leetcode/LCCI0409-BSTSequences.go)   
[面试题 04.10. Check SubTree LCCI](./leetcode/LCCI0410-CheckSubTree.go)   
[面试题 04.12. Paths with Sum LCCI](./leetcode/LCCI0412-PathsWithSum.go)   
[面试题 05.01. Insert Into Bits LCCI](./leetcode/LCCI0501-InsertIntoBits.go)   
[面试题 05.02. Binary Number to String LCCI](./leetcode/LCCI0502-BinaryNumberToString.go)   
[面试题 05.03. Reverse Bits LCCI](./leetcode/LCCI0503-ReverseBits.go)   
[面试题 05.04. Closed Number LCCI](./leetcode/LCCI0504-ClosedNumber.go)   
[面试题 05.06. Convert Integer LCCI](./leetcode/LCCI0506-ConvertInteger.go)   
[面试题 05.07. Exchange LCCI](./leetcode/LCCI0507-Exchange.go)   
[面试题 05.08. Draw Line LCCI](./leetcode/LCCI0508-DrawLine.go)   
[面试题 08.01. Three Steps Problem LCCI](./leetcode/LCCI0801-ThreeStepsProblem.go)   
[面试题 08.02. Robot in a Grid LCCI](./leetcode/LCCI0802-RobotInAGrid.go)   
[面试题 08.03. Magic Index LCCI](./leetcode/LCCI0803-MagicIndex.go)   
[面试题 08.04. Power Set LCCI](./leetcode/LCCI0804-PowerSet.go)   
[面试题 08.05. Recursive Mulitply LCCI](./leetcode/LCCI0805-RecursiveMulitply.go)   
[面试题 08.06. Hanota LCCI](./leetcode/LCCI0806-Hanota.go)   
[面试题 08.07. Permutation I LCCI](./leetcode/LCCI0807-PermutationI.go)   
[面试题 08.08. Permutation II LCCI](./leetcode/LCCI0808-PermutationII.go)   
[面试题 08.09. Bracket LCCI](./leetcode/LCCI0809-Bracket.go)   
[面试题 08.10. Color Fill LCCI](./leetcode/LCCI0810-ColorFill.go)   
[面试题 08.11. Coin LCCI](./leetcode/LCCI0811-Coin.go)   
[面试题 08.12. Eight Queens LCCI](./leetcode/LCCI0812-EightQueens.go)   
[面试题 08.13. Pile Box LCCI](./leetcode/LCCI0813-PileBox.go)   
[面试题 08.14. Boolean Evaluation LCCI](./leetcode/LCCI0814-BooleanEvaluation.go)   
[面试题 10.01. Sorted Merge LCCI](./leetcode/LCCI1001-SortedMerge.go)   
[面试题 10.02. Group Anagrams LCCI](./leetcode/LCCI1002-GroupAnagrams.go)   
[面试题 10.03. Search Rotate Array LCCI](./leetcode/LCCI1003-SearchRotateArray.go)   
[面试题 10.03. Search Rotate Array LCCI](./leetcode/LCCI1003-SearchRotateArray.go)   
[面试题 10.05. Sparse Array Search LCCI](./leetcode/LCCI1005-SparseArraySearch.go)   
[面试题 10.09. Sorted Matrix Search LCCI](./leetcode/LCCI1009-SortedMatrixSearch.go)   
[面试题 10.10. Rank from Stream LCCI](./leetcode/LCCI1010-RankFromStream.go)   
[面试题 10.11. Peaks and Valleys LCCI](./leetcode/LCCI1011-PeaksAndValleys.go)   
[面试题 16.01. Swap Numbers LCCI](./leetcode/LCCI1601-SwapNumbers.go)   
[面试题 16.02. Words Frequency LCCI](./leetcode/LCCI1602-WordsFrequency.go)   
[面试题 16.03. Intersection LCCI](./leetcode/LCCI1603-Intersection.go)   
[面试题 16.04. Tic-Tac-Toe LCCI](./leetcode/LCCI1604-TicTacToe.go)   
[面试题 16.05. Factorial Zeros LCCI](./leetcode/LCCI1605-FactorialZeros.go)   
[面试题 16.06. Smallest Difference LCCI](./leetcode/LCCI1606-SmallestDifference.go)   
[面试题 16.07. Maximum LCCI](./leetcode/LCCI1607-Maximum.go)   
[面试题 16.08. English Int LCCI](./leetcode/LCCI1608-EnglishInt.go)   
[面试题 16.09. Operations LCCI](./leetcode/LCCI1609-Operations.go)   
[面试题 16.10. Living People LCCI](./leetcode/LCCI1610-LivingPeople.go)   
[面试题 16.11. Diving Board LCCI](./leetcode/LCCI1611-DivingBoard.go)   
[面试题 16.13. Bisect Squares LCCI](./leetcode/LCCI1613-BisectSquares.go)   
[面试题 16.14. Best Line LCCI](./leetcode/LCCI1614-BestLine.go)   
[面试题 16.15. Master Mind LCCI](./leetcode/LCCI1615-MasterMind.go)   
[面试题 16.16. Sub Sort LCCI](./leetcode/LCCI1606-SubSort.go)   
[面试题 16.17. Contiguous Sequence LCCI](./leetcode/LCCI1617-ContiguousSequence.go)   
[面试题 16.18. Pattern Matching LCCI](./leetcode/LCCI1618-PatternMatching.go)   
[面试题 16.19. Pond Sizes LCCI](./leetcode/LCCI1619-PondSizes.go)   
[面试题 16.20. T9 LCCI](./leetcode/LCCI1620-T9.go)   
[面试题 16.21. Sum Swap LCCI](./leetcode/LCCI1621-SumSwap.go)   
[面试题 16.22. Langtons Ant LCCI](./leetcode/LCCI1622-LangtonsAnt.go)   
[面试题 16.24. Pairs With Sum LCCI](./leetcode/LCCI1624-PairsWithSum.go)   
[面试题 16.25. LRU Cache LCCI](./leetcode/LCCI1625-LRUCache.go)   
[面试题 16.26. Calculator LCCI](./leetcode/LCCI1626-Calculator.go)   
[面试题 17.01. Add Without Plus LCCI](./leetcode/LCCI1701-AddWithoutPlus.go)   
[面试题 17.04. Missing Number LCCI](./leetcode/LCCI1704-MissingNumber.go)   
[面试题 17.05. Find Longest Subarray LCCI](./leetcode/LCCI1705-FindLongestSubarray.go)   
[面试题 17.06. Number Of 2s In Range LCCI](./leetcode/LCCI1706-NumberOf2sInRange.go)   
[面试题 17.07. Baby Names LCCI](./leetcode/LCCI1707-BabyNames.go)   
[面试题 17.08. Circus Tower LCCI](./leetcode/LCCI1708-CircusTower.go)   
[面试题 17.09. Get Kth Magic Number LCCI](./leetcode/LCCI1709-GetKthMagicNumber.go)   
[面试题 17.10. Find Majority Element LCCI](./leetcode/LCCI1710-FindMajorityElement.go)   
[面试题 17.11. Find Closest LCCI](./leetcode/LCCI1711-FindClosest.go)   
[面试题 17.12. BiNode LCCI](./leetcode/LCCI1712-BiNode.go)   
[面试题 17.13. Re-Space LCCI](./leetcode/LCCI1713-ReSpace.go)   
[面试题 17.14. Smallest K LCCI](./leetcode/LCCI1714-SmallestK.go)   
[面试题 17.15. Longest Word LCCI](./leetcode/LCCI1715-LongestWord.go)   
[面试题 17.16. The Masseuse LCCI](./leetcode/LCCI1716-TheMasseuse.go)   
[面试题 17.17. Multi Search LCCI](./leetcode/LCCI1717-MultiSearch.go)   
[面试题 17.18. Shortest Supersequence LCCI](./leetcode/LCCI1718-ShortestSupersequence.go)   
[面试题 17.19. Missing Two LCCI](./leetcode/LCCI1719-MissingTwo.go)   
[面试题 17.20. Continuous Median LCCI](./leetcode/LCCI1720-ContinuousMedian.go)   
[面试题 17.21. Volume of Histogram LCCI](./leetcode/LCCI1721-VolumeOfHistogram.go)   
[面试题 17.22. Word Transformer LCCI](./leetcode/LCCI1722-WordTransformer.go)   
[面试题 17.23. Max Black Square LCCI](./leetcode/LCCI1723-MaxBlackSquare.go)   
[面试题 17.24. Max Submatrix LCCI](./leetcode/LCCI1724-MaxSubmatrix.go)   
[面试题 17.25. Word Rectangle LCCI](./leetcode/LCCI1725-WordRectangle.go)   
[面试题 17.26. Sparse Similarity LCCI](./leetcode/LCCI1726-SparseSimilarity.go)