# Weekly Contest

- [Weekly Contest 274](/cracking-leetcode/weekly-contest/weekly-contest-274.md)
- [2124. Check if All A's Appears Before All B's](/cracking-leetcode/weekly-contest/weekly-contest-274/2124.-check-if-all-as-appears-before-all-bs.md)
- [2125. Number of Laser Beams in a Bank](/cracking-leetcode/weekly-contest/weekly-contest-274/2125.-number-of-laser-beams-in-a-bank.md)
- [2126. Destroying Asteroids](/cracking-leetcode/weekly-contest/weekly-contest-274/2126.-destroying-asteroids.md)
- [2127. Maximum Employees to Be Invited to a Meeting](/cracking-leetcode/weekly-contest/weekly-contest-274/2127.-maximum-employees-to-be-invited-to-a-meeting.md)
- [Weekly Contest 275](/cracking-leetcode/weekly-contest/weekly-contest-275.md)
- [2133. Check if Every Row and Column Contains All Numbers](/cracking-leetcode/weekly-contest/weekly-contest-275/2133.-check-if-every-row-and-column-contains-all-numbers.md)
- [2134. Minimum Swaps to Group All 1's Together II](/cracking-leetcode/weekly-contest/weekly-contest-275/2134.-minimum-swaps-to-group-all-1s-together-ii.md)
- [2135. Count Words Obtained After Adding a Letter](/cracking-leetcode/weekly-contest/weekly-contest-275/2135.-count-words-obtained-after-adding-a-letter.md)
- [Weekly Contest 276](/cracking-leetcode/weekly-contest/weekly-contest-276.md)
- [2138. Divide a String Into Groups of Size k](/cracking-leetcode/weekly-contest/weekly-contest-276/2138.-divide-a-string-into-groups-of-size-k.md)
- [2139. Minimum Moves to Reach Target Score](/cracking-leetcode/weekly-contest/weekly-contest-276/2139.-minimum-moves-to-reach-target-score.md)
- [2140. Solving Questions With Brainpower](/cracking-leetcode/weekly-contest/weekly-contest-276/2140.-solving-questions-with-brainpower.md)
- [Page 4](/cracking-leetcode/weekly-contest/weekly-contest-276/page-4.md)
- [Weekly Contest 279](/cracking-leetcode/weekly-contest/weekly-contest-279.md)
- [2164. Sort Even and Odd Indices Independently](/cracking-leetcode/weekly-contest/weekly-contest-279/2164.-sort-even-and-odd-indices-independently.md)
- [2165. Smallest Value of the Rearranged Number](/cracking-leetcode/weekly-contest/weekly-contest-279/2165.-smallest-value-of-the-rearranged-number.md)
- [2166. Design Bitset](/cracking-leetcode/weekly-contest/weekly-contest-279/2166.-design-bitset.md)
- [Weekly Contest 339](/cracking-leetcode/weekly-contest/weekly-contest-339.md)
- [2609. Find the Longest Balanced Substring of a Binary String](/cracking-leetcode/weekly-contest/weekly-contest-339/2609.-find-the-longest-balanced-substring-of-a-binary-string.md)
- [2610. Convert an Array Into a 2D Array With Conditions](/cracking-leetcode/weekly-contest/weekly-contest-339/2610.-convert-an-array-into-a-2d-array-with-conditions.md)
- [2611. Mice and Cheese](/cracking-leetcode/weekly-contest/weekly-contest-339/2611.-mice-and-cheese.md)
- [Weekly Contest 340](/cracking-leetcode/weekly-contest/weekly-contest-340.md)
- [2614. Prime In Diagonal](/cracking-leetcode/weekly-contest/2614.-prime-in-diagonal.md)
- [2615. Sum of Distances (same as 2121. Intervals Between Identical Elements)](/cracking-leetcode/weekly-contest/2615.-sum-of-distances-same-as-2121.-intervals-between-identical-elements.md)
- [2616. Minimize the Maximum Difference of Pairs (binary search idea](/cracking-leetcode/weekly-contest/2616.-minimize-the-maximum-difference-of-pairs-binary-search-idea.md)
- [TreeMap or TreeSet](/cracking-leetcode/weekly-contest/treemap-or-treeset.md)
- [432. All O\`one Data Structure](/cracking-leetcode/weekly-contest/432.-all-o-one-data-structure.md)
- [2353. Design a Food Rating System](/cracking-leetcode/weekly-contest/2353.-design-a-food-rating-system.md)
- [2817. Minimum Absolute Difference Between Elements With Constraint](/cracking-leetcode/weekly-contest/2817.-minimum-absolute-difference-between-elements-with-constraint.md)
- [Pratical](/cracking-leetcode/weekly-contest/pratical.md)
- [2437. Number of Valid Clock Times](/cracking-leetcode/weekly-contest/2437.-number-of-valid-clock-times.md)
- [681. Next Closest Time](/cracking-leetcode/weekly-contest/681.-next-closest-time.md)
- [Min Max](/cracking-leetcode/weekly-contest/min-max.md)
- [2905. Find Indices With Index and Value Difference II](/cracking-leetcode/weekly-contest/2905.-find-indices-with-index-and-value-difference-ii.md)
- [2910. Minimum Number of Groups to Create a Valid Assignment](/cracking-leetcode/weekly-contest/2910.-minimum-number-of-groups-to-create-a-valid-assignment.md)
- [Min or Max Prefix Suffix](/cracking-leetcode/weekly-contest/min-or-max-prefix-suffix.md)
- [2012. Sum of Beauty in the Array](/cracking-leetcode/weekly-contest/2012.-sum-of-beauty-in-the-array.md)
- [2874. Maximum Value of an Ordered Triplet II](/cracking-leetcode/weekly-contest/2874.-maximum-value-of-an-ordered-triplet-ii.md)
- [2909. Minimum Sum of Mountain Triplets II](/cracking-leetcode/weekly-contest/2909.-minimum-sum-of-mountain-triplets-ii.md)
- [Greedy](/cracking-leetcode/weekly-contest/greedy.md)
- [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](/cracking-leetcode/weekly-contest/2918.-minimum-equal-sum-of-two-arrays-after-replacing-zeros.md)
- [1921. Eliminate Maximum Number of Monsters](/cracking-leetcode/weekly-contest/1921.-eliminate-maximum-number-of-monsters.md)
- [2147. Number of Ways to Divide a Long Corridor](/cracking-leetcode/weekly-contest/2147.-number-of-ways-to-divide-a-long-corridor.md)
- [DFS](/cracking-leetcode/weekly-contest/dfs.md)
- [814. Binary Tree Pruning](/cracking-leetcode/weekly-contest/814.-binary-tree-pruning.md)
- [2925. Maximum Score After Applying Operations on a Tree](/cracking-leetcode/weekly-contest/2925.-maximum-score-after-applying-operations-on-a-tree.md)
- [(re-root) 834. Sum of Distances in Tree](/cracking-leetcode/weekly-contest/re-root-834.-sum-of-distances-in-tree.md)
- [Math, Geometry](/cracking-leetcode/weekly-contest/math-geometry.md)
- [1266. Minimum Time Visiting All Points](/cracking-leetcode/weekly-contest/1266.-minimum-time-visiting-all-points.md)
- [2849. Determine if a Cell Is Reachable at a Given Time](/cracking-leetcode/weekly-contest/2849.-determine-if-a-cell-is-reachable-at-a-given-time.md)
- [1759. Count Number of Homogenous Substrings](/cracking-leetcode/weekly-contest/1759.-count-number-of-homogenous-substrings.md)
- [2 pointers](/cracking-leetcode/weekly-contest/2-pointers.md)
- [1578. Minimum Time to Make Rope Colorful](/cracking-leetcode/weekly-contest/1578.-minimum-time-to-make-rope-colorful.md)
- [2332. The Latest Time to Catch a Bus](/cracking-leetcode/weekly-contest/2332.-the-latest-time-to-catch-a-bus.md)
- [Brainteaser](/cracking-leetcode/weekly-contest/brainteaser.md)
- [1503. Last Moment Before All Ants Fall Out of a Plank](/cracking-leetcode/weekly-contest/1503.-last-moment-before-all-ants-fall-out-of-a-plank.md)
- [1535. Find the Winner of an Array Game](/cracking-leetcode/weekly-contest/1535.-find-the-winner-of-an-array-game.md)
- [Good Qestions](/cracking-leetcode/weekly-contest/good-qestions.md)
- [2948. Make Lexicographically Smallest Array by Swapping Elements](/cracking-leetcode/weekly-contest/2948.-make-lexicographically-smallest-array-by-swapping-elements.md)
- [1930. Unique Length-3 Palindromic Subsequences](/cracking-leetcode/weekly-contest/1930.-unique-length-3-palindromic-subsequences.md)
- [1980. Find Unique Binary String - Cantor's Diagonalization](/cracking-leetcode/weekly-contest/1980.-find-unique-binary-string-cantors-diagonalization.md)
- [1727. Largest Submatrix With Rearrangements](/cracking-leetcode/weekly-contest/1727.-largest-submatrix-with-rearrangements.md)
- [Backtracking practice](/cracking-leetcode/weekly-contest/backtracking-practice.md)
- [2664. The Knight’s Tour](/cracking-leetcode/weekly-contest/2664.-the-knights-tour.md)
- [Matrix](/cracking-leetcode/weekly-contest/matrix.md)
- [1582. Special Positions in a Binary Matrix](/cracking-leetcode/weekly-contest/1582.-special-positions-in-a-binary-matrix.md)
- [531. Lonely Pixel I](/cracking-leetcode/weekly-contest/531.-lonely-pixel-i.md)