├── .github ├── ISSUE_TEMPLATE │ ├── bug_report.md │ └── feature_request.md └── KNOCKCATFUNDING.yml ├── .gitignore ├── 0001-two-sum ├── 0001-two-sum.cpp ├── NOTES.md └── README.md ├── 0001. Two sum.cpp ├── 0002. Add Two Numbers.cpp ├── 0003-longest-substring-without-repeating-characters ├── 0003-longest-substring-without-repeating-characters.cpp └── README.md ├── 0003. Longest Substring Without Repeating Characters.cpp ├── 0004-median-of-two-sorted-arrays ├── 0004-median-of-two-sorted-arrays.cpp ├── NOTES.md └── README.md ├── 0004. Median of Two Sorted Arrays.cpp ├── 0005-longest-palindromic-substring ├── 0005-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 0005. Longest Palindromic Substring.cpp ├── 0006-zigzag-conversion ├── 0006-zigzag-conversion.cpp └── README.md ├── 0007. Reverse Integer.cpp ├── 0008. String to Integer (atoi).cpp ├── 0009-palindrome-number ├── 0009-palindrome-number.cpp ├── NOTES.md └── README.md ├── 0009. Palindrome Number.cpp ├── 0011-container-with-most-water ├── 0011-container-with-most-water.cpp ├── NOTES.md └── README.md ├── 0011. Container With Most Water.cpp ├── 0012. Integer to Roman.cpp ├── 0013. Roman to Integer.cpp ├── 0014. Longest Common Prefix.cpp ├── 0015-3sum ├── 0015-3sum.cpp ├── NOTES.md └── README.md ├── 0015. 3Sum.cpp ├── 0016. 3Sum Closest.cpp ├── 0017-letter-combinations-of-a-phone-number ├── 0017-letter-combinations-of-a-phone-number.cpp ├── NOTES.md └── README.md ├── 0017. Letter Combinations of a Phone Number.cpp ├── 0018-4sum ├── 0018-4sum.cpp ├── NOTES.md └── README.md ├── 0018. 4Sum.cpp ├── 0019-remove-nth-node-from-end-of-list ├── 0019-remove-nth-node-from-end-of-list.cpp ├── NOTES.md └── README.md ├── 0019. Remove Nth Node From End of List.cpp ├── 0020-valid-parentheses ├── 0020-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 0020. Valid Parentheses.cpp ├── 0021-merge-two-sorted-lists ├── 0021-merge-two-sorted-lists.cpp ├── NOTES.md └── README.md ├── 0021. Merge Two Sorted Lists.cpp ├── 0022-generate-parentheses ├── 0022-generate-parentheses.cpp └── README.md ├── 0022. Generate Parentheses.cpp ├── 0023-merge-k-sorted-lists ├── 0023-merge-k-sorted-lists.cpp ├── NOTES.md └── README.md ├── 0023. Merge k Sorted Lists.cpp ├── 0024. Swap Nodes in Pairs.cpp ├── 0025-reverse-nodes-in-k-group ├── 0025-reverse-nodes-in-k-group.cpp ├── NOTES.md └── README.md ├── 0026-remove-duplicates-from-sorted-array ├── 0026-remove-duplicates-from-sorted-array.cpp ├── NOTES.md └── README.md ├── 0026. Remove Duplicates from Sorted Array.cpp ├── 0027. Remove Element.cpp ├── 0028-find-the-index-of-the-first-occurrence-in-a-string ├── 0028-find-the-index-of-the-first-occurrence-in-a-string.cpp ├── NOTES.md └── README.md ├── 0028. Implement strStr().cpp ├── 0031-next-permutation ├── 0031-next-permutation.cpp ├── NOTES.md └── README.md ├── 0031. Next Permutation.cpp ├── 0033-search-in-rotated-sorted-array ├── 0033-search-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 0033. Search in Rotated Sorted Array.cpp ├── 0034-find-first-and-last-position-of-element-in-sorted-array ├── 0034-find-first-and-last-position-of-element-in-sorted-array.cpp └── README.md ├── 0034. Find First and Last Position of Element in Sorted Array.cpp ├── 0035. Search Insert Position.cpp ├── 0036. Valid Sudoku.cpp ├── 0039. Combination Sum.cpp ├── 0040-combination-sum-ii ├── 0040-combination-sum-ii.cpp └── README.md ├── 0040. Combination Sum II.cpp ├── 0041-first-missing-positive ├── 0041-first-missing-positive.cpp └── README.md ├── 0041. First Missing Positive.cpp ├── 0042-trapping-rain-water ├── 0042-trapping-rain-water.cpp ├── NOTES.md └── README.md ├── 0044-wildcard-matching ├── 0044-wildcard-matching.cpp ├── NOTES.md └── README.md ├── 0046-permutations ├── 0046-permutations.cpp ├── NOTES.md └── README.md ├── 0046. Permutations.cpp ├── 0047. Permutations II.cpp ├── 0048-rotate-image ├── 0048-rotate-image.cpp ├── NOTES.md └── README.md ├── 0049-group-anagrams ├── 0049-group-anagrams.cpp ├── NOTES.md └── README.md ├── 0050-powx-n ├── 0050-powx-n.cpp ├── NOTES.md └── README.md ├── 0050. Pow(x, n).cpp ├── 0053-maximum-subarray ├── NOTES.md └── README.md ├── 0053. Maximum Subarray.cpp ├── 0054-spiral-matrix ├── 0054-spiral-matrix.cpp ├── NOTES.md └── README.md ├── 0054. Spiral Matrix.cpp ├── 0055-jump-game ├── 0055-jump-game.cpp ├── NOTES.md └── README.md ├── 0056-merge-intervals ├── 0056-merge-intervals.cpp └── README.md ├── 0056. Merge Intervals.cpp ├── 0057-insert-interval ├── 0057-insert-interval.cpp ├── NOTES.md └── README.md ├── 0058-length-of-last-word ├── 0058-length-of-last-word.cpp ├── NOTES.md └── README.md ├── 0058. Length of Last Word.cpp ├── 0059. Spiral Matrix II.cpp ├── 0060. Permutation Sequence.cpp ├── 0061. Rotate List.cpp ├── 0062-unique-paths ├── 0062-unique-paths.cpp ├── NOTES.md └── README.md ├── 0062. Unique Paths.cpp ├── 0063-unique-paths-ii ├── 0063-unique-paths-ii.cpp └── NOTES.md ├── 0066. Plus One.cpp ├── 0067-add-binary ├── 0067-add-binary.cpp ├── NOTES.md └── README.md ├── 0067. Add Binary.cpp ├── 0068-text-justification ├── 0068-text-justification.cpp └── README.md ├── 0069-sqrtx ├── 0069-sqrtx.cpp ├── NOTES.md └── README.md ├── 0069. Sqrt(x).cpp ├── 0070-climbing-stairs ├── 0070-climbing-stairs.cpp └── README.md ├── 0070. Climbing Stairs.cpp ├── 0071-simplify-path ├── 0071-simplify-path.cpp └── README.md ├── 0071. Simplify Path.cpp ├── 0072-edit-distance ├── 0072-edit-distance.cpp ├── NOTES.md └── README.md ├── 0073-set-matrix-zeroes ├── 0073-set-matrix-zeroes.cpp ├── NOTES.md └── README.md ├── 0073. Set Matrix Zeroes.cpp ├── 0074-search-a-2d-matrix ├── 0074-search-a-2d-matrix.cpp ├── NOTES.md └── README.md ├── 0074. Search a 2D Matrix.cpp ├── 0075-sort-colors ├── 0075-sort-colors.cpp ├── NOTES.md └── README.md ├── 0075. Sort Colors.cpp ├── 0076-minimum-window-substring ├── 0076-minimum-window-substring.cpp └── README.md ├── 0076. Minimum Window Substring.cpp ├── 0077-combinations ├── 0077-combinations.cpp └── NOTES.md ├── 0078-subsets ├── 0078-subsets.cpp ├── NOTES.md └── README.md ├── 0078. Subsets.cpp ├── 0079-word-search ├── 0079-word-search.cpp ├── NOTES.md └── README.md ├── 0080. Remove Duplicates from Sorted Array II.cpp ├── 0081-search-in-rotated-sorted-array-ii ├── 0081-search-in-rotated-sorted-array-ii.cpp └── NOTES.md ├── 0081. Search in Rotated Sorted Array II.cpp ├── 0082. Remove Duplicates from Sorted List II.cpp ├── 0083. Remove Duplicates from Sorted List.cpp ├── 0084-largest-rectangle-in-histogram ├── 0084-largest-rectangle-in-histogram.cpp ├── NOTES.md └── README.md ├── 0085-maximal-rectangle ├── 0085-maximal-rectangle.cpp ├── NOTES.md └── README.md ├── 0086-partition-list ├── 0086-partition-list.cpp ├── NOTES.md └── README.md ├── 0086. Partition List.cpp ├── 0087-scramble-string ├── 0087-scramble-string.cpp ├── NOTES.md └── README.md ├── 0088-merge-sorted-array ├── 0088-merge-sorted-array.cpp ├── NOTES.md └── README.md ├── 0088. Merge Sorted Array.cpp ├── 0090-subsets-ii ├── 0090-subsets-ii.cpp ├── NOTES.md └── README.md ├── 0091-decode-ways ├── 0091-decode-ways.cpp ├── NOTES.md └── README.md ├── 0092-reverse-linked-list-ii ├── 0092-reverse-linked-list-ii.cpp └── README.md ├── 0092. Reverse Linked List II.cpp ├── 0093-restore-ip-addresses ├── 0093-restore-ip-addresses.cpp ├── NOTES.md └── README.md ├── 0094-binary-tree-inorder-traversal ├── 0094-binary-tree-inorder-traversal.cpp ├── NOTES.md └── README.md ├── 0094. Binary Tree Inorder Traversal.cpp ├── 0095-unique-binary-search-trees-ii ├── 0095-unique-binary-search-trees-ii.cpp └── NOTES.md ├── 0096-unique-binary-search-trees ├── 0096-unique-binary-search-trees.cpp ├── NOTES.md └── README.md ├── 0097-interleaving-string ├── 0097-interleaving-string.cpp ├── NOTES.md └── README.md ├── 0097. Interleaving String.cpp ├── 0098. Validate Binary Search Tree.cpp ├── 0100-same-tree ├── 0100-same-tree.cpp ├── NOTES.md └── README.md ├── 0100. Same Tree.cpp ├── 0101-symmetric-tree ├── 0101-symmetric-tree.cpp ├── NOTES.md └── README.md ├── 0101. Symmetric Tree.cpp ├── 0102. Binary Tree Level Order Traversal.cpp ├── 0103-binary-tree-zigzag-level-order-traversal ├── 0103-binary-tree-zigzag-level-order-traversal.cpp └── README.md ├── 0104-maximum-depth-of-binary-tree ├── 0104-maximum-depth-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 0104. Maximum Depth of Binary Tree.cpp ├── 0105-construct-binary-tree-from-preorder-and-inorder-traversal ├── 0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp └── README.md ├── 0106-construct-binary-tree-from-inorder-and-postorder-traversal └── README.md ├── 0108. Convert Sorted Array to Binary Search Tree.cpp ├── 0109-convert-sorted-list-to-binary-search-tree ├── 0109-convert-sorted-list-to-binary-search-tree.cpp └── README.md ├── 0109. Convert Sorted List to Binary Search Tree.cpp ├── 0110-balanced-binary-tree ├── 0110-balanced-binary-tree.cpp ├── NOTES.md └── README.md ├── 0110. Balanced Binary Tree.cpp ├── 0111. Minimum Depth of Binary Tree.cpp ├── 0112-path-sum ├── 0112-path-sum.cpp ├── NOTES.md └── README.md ├── 0112. Path Sum.cpp ├── 0113-path-sum-ii ├── 0113-path-sum-ii.cpp └── README.md ├── 0114. Flatten Binary Tree to Linked List.cpp ├── 0115-distinct-subsequences ├── 0115-distinct-subsequences.cpp ├── NOTES.md └── README.md ├── 0116. Populating Next Right Pointers in Each Node.cpp ├── 0117. Populating Next Right Pointers in Each Node II.cpp ├── 0118-pascals-triangle ├── 0118-pascals-triangle.cpp ├── NOTES.md └── README.md ├── 0118. Pascal's Triangle.cpp ├── 0119-pascals-triangle-ii ├── 0119-pascals-triangle-ii.cpp ├── NOTES.md └── README.md ├── 0119. Pascal's Triangle II.cpp ├── 0120. Triangle.cpp ├── 0121-best-time-to-buy-and-sell-stock ├── 0121-best-time-to-buy-and-sell-stock.cpp ├── NOTES.md └── README.md ├── 0121. Best Time to Buy and Sell Stock.cpp ├── 0122-best-time-to-buy-and-sell-stock-ii ├── 0122-best-time-to-buy-and-sell-stock-ii.cpp ├── NOTES.md └── README.md ├── 0122. Best Time to Buy and Sell Stock II.cpp ├── 0123-best-time-to-buy-and-sell-stock-iii ├── 0123-best-time-to-buy-and-sell-stock-iii.cpp ├── NOTES.md └── README.md ├── 0124-binary-tree-maximum-path-sum ├── 0124-binary-tree-maximum-path-sum.cpp └── NOTES.md ├── 0125. Valid Palindrome.cpp ├── 0126-word-ladder-ii ├── 0126-word-ladder-ii.cpp └── README.md ├── 0128-longest-consecutive-sequence ├── 0128-longest-consecutive-sequence.cpp ├── NOTES.md └── README.md ├── 0128. Longest Consecutive Sequence.cpp ├── 0129-sum-root-to-leaf-numbers ├── 0129-sum-root-to-leaf-numbers.cpp ├── NOTES.md └── README.md ├── 0129. Sum Root to Leaf Numbers.cpp ├── 0130-surrounded-regions ├── 0130-surrounded-regions.cpp └── README.md ├── 0131-palindrome-partitioning ├── 0131-palindrome-partitioning.cpp ├── NOTES.md └── README.md ├── 0132-palindrome-partitioning-ii ├── 0132-palindrome-partitioning-ii.cpp ├── NOTES.md └── README.md ├── 0133-clone-graph ├── 0133-clone-graph.cpp ├── NOTES.md └── README.md ├── 0133. Clone Graph.cpp ├── 0134-gas-station ├── 0134-gas-station.cpp └── README.md ├── 0135-candy ├── 0135-candy.cpp ├── NOTES.md └── README.md ├── 0135. Candy.cpp ├── 0136. Single Number.cpp ├── 0137-single-number-ii ├── 0137-single-number-ii.cpp ├── NOTES.md └── README.md ├── 0137. Single Number II.cpp ├── 0138-copy-list-with-random-pointer ├── 0138-copy-list-with-random-pointer.cpp ├── NOTES.md └── README.md ├── 0138. Copy List with Random Pointer.cpp ├── 0139-word-break ├── 0139-word-break.cpp ├── NOTES.md └── README.md ├── 0141-linked-list-cycle ├── 0141-linked-list-cycle.cpp ├── NOTES.md └── README.md ├── 0141. Linked List Cycle.cpp ├── 0142-linked-list-cycle-ii ├── 0142-linked-list-cycle-ii.cpp ├── NOTES.md └── README.md ├── 0142. Linked List Cycle II.cpp ├── 0143-reorder-list ├── 0143-reorder-list.cpp └── README.md ├── 0143. Reorder List.cpp ├── 0144 leetcode preorder traversal.cpp ├── 0144-binary-tree-preorder-traversal ├── 0144-binary-tree-preorder-traversal.cpp ├── NOTES.md └── README.md ├── 0145-binary-tree-postorder-traversal ├── 0145-binary-tree-postorder-traversal.cpp ├── NOTES.md └── README.md ├── 0145. Binary Tree Postorder Traversal.cpp ├── 0146-lru-cache ├── 0146-lru-cache.cpp ├── NOTES.md └── README.md ├── 0147. Insertion Sort List.cpp ├── 0148-sort-list ├── 0148-sort-list.cpp └── README.md ├── 0148. Sort List.cpp ├── 0149-max-points-on-a-line ├── 0149-max-points-on-a-line.cpp └── README.md ├── 0150-evaluate-reverse-polish-notation ├── 0150-evaluate-reverse-polish-notation.cpp ├── NOTES.md └── README.md ├── 0152-maximum-product-subarray ├── 0152-maximum-product-subarray.cpp ├── NOTES.md └── README.md ├── 0152. Maximum Product Subarray.cpp ├── 0153. Find Minimum in Rotated Sorted Array.cpp ├── 0154. Find Minimum in Rotated Sorted Array II.cpp ├── 0160-intersection-of-two-linked-lists └── README.md ├── 0160. Intersection of Two Linked Lists.cpp ├── 0162-find-peak-element ├── 0162-find-peak-element.cpp ├── NOTES.md └── README.md ├── 0162. Find Peak Element.cpp ├── 0165-compare-version-numbers ├── 0165-compare-version-numbers.cpp └── README.md ├── 0165. Compare Version Numbers.cpp ├── 0167. Two Sum II - Input Array Is Sorted.cpp ├── 0168-excel-sheet-column-title ├── 0168-excel-sheet-column-title.cpp ├── NOTES.md └── README.md ├── 0168. Excel Sheet Column Title.cpp ├── 0169-majority-element ├── 0169-majority-element.cpp ├── NOTES.md └── README.md ├── 0169. Majority Element.cpp ├── 0171. Excel Sheet Column Number.cpp ├── 0173. Binary Search Tree Iterator.cpp ├── 0179. Largest Number.cpp ├── 0187. Repeated DNA Sequences.cpp ├── 0189-rotate-array ├── 0189-rotate-array.cpp └── NOTES.md ├── 0189. Rotate Array.cpp ├── 0190. Reverse Bits.cpp ├── 0191. Number of 1 Bits.cpp ├── 0198-house-robber ├── 0198-house-robber.cpp ├── NOTES.md └── README.md ├── 0198. House Robber.cpp ├── 0199. Binary Tree Right Side View.cpp ├── 0200-number-of-islands ├── 0200-number-of-islands.cpp ├── NOTES.md └── README.md ├── 0201-bitwise-and-of-numbers-range ├── 0201-bitwise-and-of-numbers-range.cpp ├── NOTES.md └── README.md ├── 0202. Happy Number.cpp ├── 0203. Remove Linked List Elements.cpp ├── 0205-isomorphic-strings ├── 0205-isomorphic-strings.cpp ├── NOTES.md └── README.md ├── 0206-reverse-linked-list ├── 0206-reverse-linked-list.cpp └── NOTES.md ├── 0206. Reverse Linked List.cpp ├── 0207-course-schedule ├── 0207-course-schedule.cpp ├── NOTES.md └── README.md ├── 0207. Course Schedule.cpp ├── 0208-implement-trie-prefix-tree ├── 0208-implement-trie-prefix-tree.cpp ├── NOTES.md └── README.md ├── 0209-minimum-size-subarray-sum ├── 0209-minimum-size-subarray-sum.cpp ├── NOTES.md └── README.md ├── 0210-course-schedule-ii ├── 0210-course-schedule-ii.cpp ├── NOTES.md └── README.md ├── 0210. Course Schedule II.cpp ├── 0211-design-add-and-search-words-data-structure ├── 0211-design-add-and-search-words-data-structure.cpp └── README.md ├── 0214-shortest-palindrome ├── 0214-shortest-palindrome.cpp └── NOTES.md ├── 0215-kth-largest-element-in-an-array ├── 0215-kth-largest-element-in-an-array.cpp ├── NOTES.md └── README.md ├── 0215. Kth Largest Element in an Array.cpp ├── 0216. Combination Sum III.cpp ├── 0217. Contains Duplicate.cpp ├── 0221-maximal-square ├── 0221-maximal-square.cpp ├── NOTES.md └── README.md ├── 0225-implement-stack-using-queues ├── 0225-implement-stack-using-queues.cpp ├── NOTES.md └── README.md ├── 0225. Implement Stack using Queues.cpp ├── 0226-invert-binary-tree ├── 0226-invert-binary-tree.cpp ├── NOTES.md └── README.md ├── 0226. Invert Binary Tree.cpp ├── 0228-summary-ranges ├── 0228-summary-ranges.cpp ├── NOTES.md └── README.md ├── 0228. Summary Ranges.cpp ├── 0229. Majority Element II.cpp ├── 0230. Kth Smallest Element in a BST.cpp ├── 0231-power-of-two ├── 0231-power-of-two.cpp ├── NOTES.md └── README.md ├── 0231. Power of Two.cpp ├── 0232-implement-queue-using-stacks ├── 0232-implement-queue-using-stacks.cpp ├── NOTES.md └── README.md ├── 0234-palindrome-linked-list ├── 0234-palindrome-linked-list.cpp └── README.md ├── 0234. Palindrome Linked List.cpp ├── 0235. Lowest Common Ancestor of a Binary Search Tree.cpp ├── 0236-lowest-common-ancestor-of-a-binary-tree ├── 0236-lowest-common-ancestor-of-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 0236. Lowest Common Ancestor of a Binary Tree.cpp ├── 0237-delete-node-in-a-linked-list ├── 0237-delete-node-in-a-linked-list.cpp ├── NOTES.md └── README.md ├── 0237. Delete Node in a Linked List.cpp ├── 0238-product-of-array-except-self ├── 0238-product-of-array-except-self.cpp └── README.md ├── 0239-sliding-window-maximum ├── 0239-sliding-window-maximum.cpp ├── NOTES.md └── README.md ├── 0240. Search a 2D Matrix II.cpp ├── 0242-valid-anagram ├── 0242-valid-anagram.cpp ├── NOTES.md └── README.md ├── 0242. Valid Anagram.cpp ├── 0257. Binary Tree Paths.cpp ├── 0258-add-digits ├── 0258-add-digits.cpp ├── NOTES.md └── README.md ├── 0258. Add Digits.cpp ├── 0260-single-number-iii ├── 0260-single-number-iii.cpp └── README.md ├── 0260. Single Number III.cpp ├── 0263. Ugly Number.cpp ├── 0264-ugly-number-ii ├── 0264-ugly-number-ii.cpp └── README.md ├── 0264. Ugly Number II.cpp ├── 0268-missing-number ├── 0268-missing-number.cpp ├── NOTES.md └── README.md ├── 0268. Missing Number.cpp ├── 0273-integer-to-english-words ├── 0273-integer-to-english-words.cpp └── README.md ├── 0278. First Bad Version.cpp ├── 0279-perfect-squares ├── 0279-perfect-squares.cpp ├── NOTES.md └── README.md ├── 0283-move-zeroes ├── 0283-move-zeroes.cpp ├── NOTES.md └── README.md ├── 0283. Move Zeroes.cpp ├── 0284. Peeking Iterator.cpp ├── 0287-find-the-duplicate-number ├── 0287-find-the-duplicate-number.cpp ├── NOTES.md └── README.md ├── 0287. Find the Duplicate Number.cpp ├── 0289-game-of-life ├── 0289-game-of-life.cpp ├── NOTES.md └── README.md ├── 0289. Game of Life.cpp ├── 0290-word-pattern ├── 0290-word-pattern.cpp ├── NOTES.md └── README.md ├── 0290. Word Pattern.cpp ├── 0292. Nim Game.cpp ├── 0295-find-median-from-data-stream ├── 0295-find-median-from-data-stream.cpp └── README.md ├── 0299. Bulls and Cows.cpp ├── 0300-longest-increasing-subsequence ├── 0300-longest-increasing-subsequence.cpp ├── NOTES.md └── README.md ├── 0300. Longest Increasing Subsequence.cpp ├── 0304. Range Sum Query 2D - Immutable.cpp ├── 0307-range-sum-query-mutable ├── 0307-range-sum-query-mutable.cpp └── NOTES.md ├── 0307. Range Sum Query - Mutable.cpp ├── 0309-best-time-to-buy-and-sell-stock-with-cooldown ├── 0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp ├── NOTES.md └── README.md ├── 0310-minimum-height-trees ├── 0310-minimum-height-trees.cpp └── README.md ├── 0312-burst-balloons ├── 0312-burst-balloons.cpp ├── NOTES.md └── README.md ├── 0316. Remove Duplicate Letters.cpp ├── 0318. Maximum Product of Word Lengths.cpp ├── 0319-bulb-switcher ├── 0319-bulb-switcher.cpp └── README.md ├── 0322-coin-change ├── 0322-coin-change.cpp ├── NOTES.md └── README.md ├── 0322. Coin Change.cpp ├── 0324-wiggle-sort-ii ├── 0324-wiggle-sort-ii.cpp ├── NOTES.md └── README.md ├── 0326. Power of Three.cpp ├── 0328. Odd Even Linked List.cpp ├── 0330-patching-array ├── 0330-patching-array.cpp └── README.md ├── 0332-reconstruct-itinerary ├── 0332-reconstruct-itinerary.cpp └── README.md ├── 0334. Increasing Triplet Subsequence.cpp ├── 0338-counting-bits ├── 0338-counting-bits.cpp ├── NOTES.md └── README.md ├── 0338. Counting Bits.cpp ├── 0341-flatten-nested-list-iterator ├── 0341-flatten-nested-list-iterator.cpp ├── NOTES.md └── README.md ├── 0341. Flatten Nested List Iterator.cpp ├── 0342-power-of-four ├── 0342-power-of-four.cpp ├── NOTES.md └── README.md ├── 0342. Power of Four.cpp ├── 0343-integer-break ├── 0343-integer-break.cpp ├── NOTES.md └── README.md ├── 0344-reverse-string ├── 0344-reverse-string.cpp ├── NOTES.md └── README.md ├── 0344. Reverse String.cpp ├── 0345. Reverse Vowels of a String.cpp ├── 0347. Top K Frequent Elements.cpp ├── 0349-intersection-of-two-arrays ├── 0349-intersection-of-two-arrays.cpp ├── NOTES.md └── README.md ├── 0349. Intersection of Two Arrays.cpp ├── 0350-intersection-of-two-arrays-ii ├── 0350-intersection-of-two-arrays-ii.cpp └── README.md ├── 0350. Intersection of Two Arrays II.cpp ├── 0352-data-stream-as-disjoint-intervals ├── 0352-data-stream-as-disjoint-intervals.cpp └── README.md ├── 0354-russian-doll-envelopes ├── NOTES.md └── README.md ├── 0354. Russian Doll Envelopes.cpp ├── 0367. Valid Perfect Square.cpp ├── 0368-largest-divisible-subset ├── 0368-largest-divisible-subset.cpp └── README.md ├── 0371. Sum of Two Integers.cpp ├── 0372. Super Pow.cpp ├── 0373-find-k-pairs-with-smallest-sums ├── 0373-find-k-pairs-with-smallest-sums.cpp └── README.md ├── 0374. Guess Number Higher or Lower.cpp ├── 0375. Guess Number Higher or Lower II.cpp ├── 0376. Wiggle Subsequence.cpp ├── 0377-combination-sum-iv ├── 0377-combination-sum-iv.cpp ├── NOTES.md └── README.md ├── 0377. Combination Sum IV.cpp ├── 0380-insert-delete-getrandom-o1 ├── 0380-insert-delete-getrandom-o1.cpp ├── NOTES.md └── README.md ├── 0382-linked-list-random-node ├── 0382-linked-list-random-node.cpp └── README.md ├── 0384-shuffle-an-array ├── 0384-shuffle-an-array.cpp └── NOTES.md ├── 0384. Shuffle an Array.cpp ├── 0387-first-unique-character-in-a-string ├── 0387-first-unique-character-in-a-string.cpp ├── NOTES.md └── README.md ├── 0387. First Unique Character in a String.cpp ├── 0389-find-the-difference ├── 0389-find-the-difference.java ├── NOTES.md └── README.md ├── 0389. Find the Difference.cpp ├── 0392-is-subsequence ├── 0392-is-subsequence.java ├── NOTES.md └── README.md ├── 0392. Is Subsequence.cpp ├── 0394. Decode String.cpp ├── 0398. Random Pick Index.cpp ├── 0399-evaluate-division ├── 0399-evaluate-division.cpp └── README.md ├── 0402-remove-k-digits ├── 0402-remove-k-digits.cpp ├── NOTES.md └── README.md ├── 0402. Remove K Digits.cpp ├── 0403-frog-jump ├── 0403-frog-jump.cpp ├── NOTES.md └── README.md ├── 0404-sum-of-left-leaves ├── 0404-sum-of-left-leaves.cpp └── README.md ├── 0406. Queue Reconstruction by Height.cpp ├── 0409-longest-palindrome ├── 0409-longest-palindrome.cpp ├── NOTES.md └── README.md ├── 0409. Longest Palindrome.cpp ├── 0410-split-array-largest-sum ├── 0410-split-array-largest-sum.cpp ├── NOTES.md └── README.md ├── 0410. Split Array Largest Sum.cpp ├── 0412. Fizz Buzz.cpp ├── 0413. Arithmetic Slices.cpp ├── 0414. Third Maximum Number.cpp ├── 0415. Add Strings.cpp ├── 0416. Partition Equal Subset Sum.cpp ├── 0421. Maximum XOR of Two Numbers in an Array.cpp ├── 0427-construct-quad-tree ├── 0427-construct-quad-tree.cpp └── README.md ├── 0435-non-overlapping-intervals ├── 0435-non-overlapping-intervals.cpp ├── NOTES.md └── README.md ├── 0438. Find All Anagrams in a String.cpp ├── 0441. Arranging Coins.cpp ├── 0442-find-all-duplicates-in-an-array ├── 0442-find-all-duplicates-in-an-array.cpp ├── NOTES.md └── README.md ├── 0442. Find All Duplicates in an Array.cpp ├── 0443-string-compression ├── 0443-string-compression.cpp └── README.md ├── 0445-add-two-numbers-ii ├── 0445-add-two-numbers-ii.cpp ├── NOTES.md └── README.md ├── 0446-arithmetic-slices-ii-subsequence ├── 0446-arithmetic-slices-ii-subsequence.cpp ├── NOTES.md └── README.md ├── 0448. Find All Numbers Disappeared in an Array.cpp ├── 0451-sort-characters-by-frequency ├── 0451-sort-characters-by-frequency.cpp ├── NOTES.md └── README.md ├── 0452-minimum-number-of-arrows-to-burst-balloons ├── 0452-minimum-number-of-arrows-to-burst-balloons.cpp ├── NOTES.md └── README.md ├── 0454. 4Sum II.cpp ├── 0455-assign-cookies ├── 0455-assign-cookies.cpp └── README.md ├── 0455. Assign Cookies.cpp ├── 0456-132-pattern ├── 0456-132-pattern.cpp ├── NOTES.md └── README.md ├── 0456. 132 Pattern.cpp ├── 0458. Poor Pigs.cpp ├── 0459-repeated-substring-pattern ├── 0459-repeated-substring-pattern.cpp ├── NOTES.md └── README.md ├── 0460-lfu-cache ├── 0460-lfu-cache.cpp └── README.md ├── 0461. Hamming Distance.cpp ├── 0462-minimum-moves-to-equal-array-elements-ii ├── 0462-minimum-moves-to-equal-array-elements-ii.cpp ├── NOTES.md └── README.md ├── 0462. Minimum Moves to Equal Array Elements II.cpp ├── 0463. Island Perimeter.cpp ├── 0472-concatenated-words ├── 0472-concatenated-words.cpp └── README.md ├── 0473. Matchsticks to Square.cpp ├── 0476-number-complement ├── 0476-number-complement.cpp └── README.md ├── 0476. Number Complement.cpp ├── 0485. Max Consecutive Ones.cpp ├── 0486-predict-the-winner ├── 0486-predict-the-winner.cpp └── README.md ├── 0491-non-decreasing-subsequences ├── 0491-non-decreasing-subsequences.cpp ├── NOTES.md └── README.md ├── 0493-reverse-pairs ├── 0493-reverse-pairs.cpp ├── NOTES.md └── README.md ├── 0494. Target Sum.cpp ├── 0495. Teemo Attacking.cpp ├── 0496. Next Greater Element I.cpp ├── 0501-find-mode-in-binary-search-tree ├── 0501-find-mode-in-binary-search-tree.cpp └── README.md ├── 0501. Find Mode in Binary Search Tree.cpp ├── 0502-ipo ├── 0502-ipo.cpp ├── NOTES.md └── README.md ├── 0504. Base 7.cpp ├── 0507. Perfect Number.cpp ├── 0508-most-frequent-subtree-sum ├── 0508-most-frequent-subtree-sum.cpp ├── NOTES.md └── README.md ├── 0509-fibonacci-number ├── 0509-fibonacci-number.cpp ├── NOTES.md └── README.md ├── 0509. Fibonacci Number.cpp ├── 0513-find-bottom-left-tree-value ├── 0513-find-bottom-left-tree-value.cpp ├── NOTES.md └── README.md ├── 0514-freedom-trail ├── 0514-freedom-trail.cpp ├── NOTES.md └── README.md ├── 0515-find-largest-value-in-each-tree-row ├── 0515-find-largest-value-in-each-tree-row.cpp ├── NOTES.md └── README.md ├── 0516-longest-palindromic-subsequence ├── 0516-longest-palindromic-subsequence.cpp └── README.md ├── 0516. Longest Palindromic Subsequence.cpp ├── 0518-coin-change-ii ├── 0518-coin-change-ii.cpp ├── NOTES.md └── README.md ├── 0518. Coin Change 2.cpp ├── 0520-detect-capital ├── 0520-detect-capital.cpp ├── NOTES.md └── README.md ├── 0520. Detect Capital.cpp ├── 0523-continuous-subarray-sum ├── 0523-continuous-subarray-sum.cpp ├── NOTES.md └── README.md ├── 0525-contiguous-array ├── 0525-contiguous-array.cpp └── NOTES.md ├── 0525. Contiguous Array.cpp ├── 0530-minimum-absolute-difference-in-bst ├── 0530-minimum-absolute-difference-in-bst.cpp └── README.md ├── 0530. Minimum Absolute Difference in BST.cpp ├── 0532. K-diff Pairs in an Array.cpp ├── 0535. Encode and Decode TinyURL.cpp ├── 0538. Convert BST to Greater Tree.cpp ├── 0541. Reverse String II.cpp ├── 0542-01-matrix ├── 0542-01-matrix.cpp ├── NOTES.md └── README.md ├── 0543-diameter-of-binary-tree ├── 0543-diameter-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 0547-number-of-provinces ├── 0547-number-of-provinces.cpp ├── NOTES.md └── README.md ├── 0551. Student Attendance Record I.cpp ├── 0552-student-attendance-record-ii ├── 0552-student-attendance-record-ii.cpp └── NOTES.md ├── 0556-next-greater-element-iii ├── 0556-next-greater-element-iii.cpp └── README.md ├── 0557-reverse-words-in-a-string-iii ├── 0557-reverse-words-in-a-string-iii.cpp ├── NOTES.md └── README.md ├── 0557. Reverse Words in a String III.cpp ├── 0560-subarray-sum-equals-k ├── 0560-subarray-sum-equals-k.cpp ├── NOTES.md └── README.md ├── 0560. Subarray Sum Equals K.cpp ├── 0561. Array Partition I.cpp ├── 0564-find-the-closest-palindrome ├── 0564-find-the-closest-palindrome.cpp ├── NOTES.md └── README.md ├── 0567-permutation-in-string ├── 0567-permutation-in-string.cpp └── README.md ├── 0567. Permutation in String.cpp ├── 0575. Distribute Candi.cpp ├── 0576-out-of-boundary-paths ├── 0576-out-of-boundary-paths.cpp ├── NOTES.md └── README.md ├── 0576. Out of Boundary Paths.cpp ├── 0581. Shortest Unsorted Continuous Subarray.cpp ├── 0583. Delete Operation for Two Strings.cpp ├── 0584-find-customer-referee ├── 0584-find-customer-referee.sql ├── NOTES.md └── README.md ├── 0589. N-ary Tree Preorder Traversal. N-ary Tree Preorder Traversal.cpp ├── 0590-n-ary-tree-postorder-traversal ├── 0590-n-ary-tree-postorder-traversal.cpp ├── NOTES.md └── README.md ├── 0590. N-ary Tree Postorder Traversal.cpp ├── 0592-fraction-addition-and-subtraction ├── 0592-fraction-addition-and-subtraction.cpp └── README.md ├── 0593. Valid Square.cpp ├── 0595-big-countries ├── 0595-big-countries.sql └── NOTES.md ├── 0599. Minimum Index Sum of Two Lists.cpp ├── 0605. Can Place Flowers.cpp ├── 0606-construct-string-from-binary-tree ├── 0606-construct-string-from-binary-tree.cpp ├── NOTES.md └── README.md ├── 0617. Merge Two Binary Trees.cpp ├── 0621-task-scheduler ├── 0621-task-scheduler.cpp └── README.md ├── 0623-add-one-row-to-tree ├── 0623-add-one-row-to-tree.cpp └── README.md ├── 0624-maximum-distance-in-arrays ├── 0624-maximum-distance-in-arrays.cpp └── README.md ├── 0628-maximum-product-of-three-numbers ├── 0628-maximum-product-of-three-numbers.cpp ├── NOTES.md └── README.md ├── 0628. Maximum Product of Three Numbers.cpp ├── 0629-k-inverse-pairs-array ├── 0629-k-inverse-pairs-array.cpp └── README.md ├── 0629. K Inverse Pairs Array.cpp ├── 0633-sum-of-square-numbers ├── 0633-sum-of-square-numbers.cpp ├── NOTES.md └── README.md ├── 0633. Sum of Square Numbers.cpp ├── 0645-set-mismatch ├── 0645-set-mismatch.cpp ├── NOTES.md └── README.md ├── 0645. Set Mismatch.cpp ├── 0646-maximum-length-of-pair-chain ├── 0646-maximum-length-of-pair-chain.cpp ├── NOTES.md └── README.md ├── 0647-palindromic-substrings ├── 0647-palindromic-substrings.cpp └── README.md ├── 0647. Palindromic Substrings.cpp ├── 0648-replace-words ├── 0648-replace-words.cpp ├── NOTES.md └── README.md ├── 0649-dota2-senate ├── 0649-dota2-senate.cpp └── NOTES.md ├── 0650-2-keys-keyboard ├── 0650-2-keys-keyboard.cpp ├── NOTES.md └── README.md ├── 0652-find-duplicate-subtrees ├── 0652-find-duplicate-subtrees.cpp └── README.md ├── 0652. Find Duplicate Subtrees.cpp ├── 0653. Two Sum IV - Input is a BST.cpp ├── 0654. Maximum Binary Tree.cpp ├── 0661-image-smoother ├── 0661-image-smoother.cpp └── README.md ├── 0662-maximum-width-of-binary-tree ├── 0662-maximum-width-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 0662. Maximum Width of Binary Tree.cpp ├── 0664-strange-printer ├── 0664-strange-printer.cpp ├── NOTES.md └── README.md ├── 0665. Non-decreasing Array.cpp ├── 0671. Second Minimum Node In a Binary Tree.cpp ├── 0673-number-of-longest-increasing-subsequence ├── 0673-number-of-longest-increasing-subsequence.cpp ├── NOTES.md └── README.md ├── 0674. Longest Continuous Increasing Subsequence.cpp ├── 0678-valid-parenthesis-string ├── NOTES.md └── README.md ├── 0680. Valid Palindrome II.cpp ├── 0682. Baseball Game.cpp ├── 0684-redundant-connection ├── 0684-redundant-connection.cpp ├── NOTES.md └── README.md ├── 0688-knight-probability-in-chessboard ├── 0688-knight-probability-in-chessboard.cpp └── README.md ├── 0690. Employee Importance.cpp ├── 0692-top-k-frequent-words ├── 0692-top-k-frequent-words.cpp └── README.md ├── 0695. Max Area of Island.cpp ├── 0696. Count Binary Substrings.cpp ├── 0698-partition-to-k-equal-sum-subsets ├── 0698-partition-to-k-equal-sum-subsets.cpp ├── NOTES.md └── README.md ├── 0700. Search in a Binary Search Tree.cpp ├── 0701. Insert into a Binary Search Tree.cpp ├── 0703-kth-largest-element-in-a-stream ├── 0703-kth-largest-element-in-a-stream.cpp ├── NOTES.md └── README.md ├── 0703. Kth Largest Element in a Stream.cpp ├── 0704-binary-search ├── 0704-binary-search.cpp └── README.md ├── 0704. Binary Search.cpp ├── 0705-design-hashset ├── 0705-design-hashset.cpp ├── NOTES.md └── README.md ├── 0705. Design HashSet.cpp ├── 0706-design-hashmap ├── 0706-design-hashmap.cpp └── README.md ├── 0706. Design HashMap.cpp ├── 0709. To Lower Case.cpp ├── 0712-minimum-ascii-delete-sum-for-two-strings ├── 0712-minimum-ascii-delete-sum-for-two-strings.cpp ├── NOTES.md └── README.md ├── 0713-subarray-product-less-than-k ├── 0713-subarray-product-less-than-k.cpp ├── NOTES.md └── README.md ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee.cpp ├── NOTES.md └── README.md ├── 0719-find-k-th-smallest-pair-distance ├── 0719-find-k-th-smallest-pair-distance.cpp ├── NOTES.md └── README.md ├── 0720-longest-word-in-dictionary ├── 0720-longest-word-in-dictionary.cpp └── NOTES.md ├── 0721-accounts-merge ├── 0721-accounts-merge.cpp ├── NOTES.md └── README.md ├── 0724. Find Pivot Index.cpp ├── 0725-split-linked-list-in-parts ├── 0725-split-linked-list-in-parts.cpp ├── NOTES.md └── README.md ├── 0728. Self Dividing Numbers.cpp ├── 0729. My Calendar I.cpp ├── 0733. Flood Fill.cpp ├── 0735-asteroid-collision ├── 0735-asteroid-collision.cpp ├── NOTES.md └── README.md ├── 0735. Asteroid Collision.cpp ├── 0739-daily-temperatures ├── 0739-daily-temperatures.cpp ├── NOTES.md └── README.md ├── 0740. Delete and Earn.cpp ├── 0743-network-delay-time ├── 0743-network-delay-time.cpp └── README.md ├── 0743. Network Delay Time.cpp ├── 0744-find-smallest-letter-greater-than-target └── README.md ├── 0744. Find Smallest Letter Greater Than Target.cpp ├── 0745. Prefix and Suffix Search.cpp ├── 0746-min-cost-climbing-stairs ├── 0746-min-cost-climbing-stairs.cpp ├── NOTES.md └── README.md ├── 0746. Min Cost Climbing Stairs.cpp ├── 0747. Largest Number At Least Twice of Others.cpp ├── 0752-open-the-lock ├── 0752-open-the-lock.cpp └── README.md ├── 0763. Partition Labels.cpp ├── 0766. Toeplitz Matrix.cpp ├── 0767-reorganize-string ├── 0767-reorganize-string.cpp ├── NOTES.md └── README.md ├── 0771. Jewels and Stones.cpp ├── 0777. Swap Adjacent in LR String.cpp ├── 0783-minimum-distance-between-bst-nodes ├── 0783-minimum-distance-between-bst-nodes.cpp ├── NOTES.md └── README.md ├── 0785-is-graph-bipartite ├── 0785-is-graph-bipartite.cpp └── NOTES.md ├── 0785. Is Graph Bipartite.cpp ├── 0786-k-th-smallest-prime-fraction ├── 0786-k-th-smallest-prime-fraction.cpp └── NOTES.md ├── 0787-cheapest-flights-within-k-stops ├── 0787-cheapest-flights-within-k-stops.cpp ├── NOTES.md └── README.md ├── 0790-domino-and-tromino-tiling ├── 0790-domino-and-tromino-tiling.cpp └── README.md ├── 0791-custom-sort-string ├── 0791-custom-sort-string.cpp ├── NOTES.md └── README.md ├── 0792. Number of Matching Subsequences.cpp ├── 0797-all-paths-from-source-to-target ├── 0797-all-paths-from-source-to-target.cpp └── README.md ├── 0799. Champagne Tower.cpp ├── 0802-find-eventual-safe-states ├── 0802-find-eventual-safe-states.cpp ├── NOTES.md └── README.md ├── 0807. Max Increase to Keep City Skyline.cpp ├── 0808-soup-servings └── README.md ├── 0812. Largest Triangle Area.cpp ├── 0820. Short Encoding of Words.cpp ├── 0823-binary-trees-with-factors ├── 0823-binary-trees-with-factors.cpp ├── NOTES.md └── README.md ├── 0823. Binary Trees With Factors.cpp ├── 0826-most-profit-assigning-work ├── 0826-most-profit-assigning-work.cpp ├── NOTES.md └── README.md ├── 0827-making-a-large-island ├── 0827-making-a-large-island.cpp ├── NOTES.md └── README.md ├── 0833. Find And Replace in String.cpp ├── 0834-sum-of-distances-in-tree ├── 0834-sum-of-distances-in-tree.cpp ├── NOTES.md └── README.md ├── 0836. Rectangle Overlap.cpp ├── 0837-new-21-game └── README.md ├── 0839-similar-string-groups ├── 0839-similar-string-groups.cpp ├── NOTES.md └── README.md ├── 0840-magic-squares-in-grid ├── 0840-magic-squares-in-grid.cpp ├── NOTES.md └── README.md ├── 0841-keys-and-rooms ├── 0841-keys-and-rooms.cpp ├── NOTES.md └── README.md ├── 0844-backspace-string-compare ├── 0844-backspace-string-compare.cpp └── NOTES.md ├── 0844. Backspace String Compare.cpp ├── 0845. Longest Mountain in Array.cpp ├── 0846-hand-of-straights ├── 0846-hand-of-straights.cpp ├── NOTES.md └── README.md ├── 0847-shortest-path-visiting-all-nodes ├── 0847-shortest-path-visiting-all-nodes.cpp └── README.md ├── 0848. Shifting Letters.cpp ├── 0852-peak-index-in-a-mountain-array ├── 0852-peak-index-in-a-mountain-array.cpp ├── NOTES.md └── README.md ├── 0852. Peak Index in a Mountain Array.cpp ├── 0853. Car Fleet.cpp ├── 0856. Score of Parentheses.cpp ├── 0857-minimum-cost-to-hire-k-workers ├── 0857-minimum-cost-to-hire-k-workers.cpp ├── NOTES.md └── README.md ├── 0858. Mirror Reflection.cpp ├── 0859-buddy-strings ├── 0859-buddy-strings.cpp ├── NOTES.md └── README.md ├── 0860-lemonade-change ├── 0860-lemonade-change.cpp ├── NOTES.md └── README.md ├── 0863-all-nodes-distance-k-in-binary-tree ├── 0863-all-nodes-distance-k-in-binary-tree.cpp └── NOTES.md ├── 0864-shortest-path-to-get-all-keys ├── 0864-shortest-path-to-get-all-keys.cpp └── README.md ├── 0867-transpose-matrix ├── 0867-transpose-matrix.cpp ├── NOTES.md └── README.md ├── 0867. Transpose Matrix.cpp ├── 0872-leaf-similar-trees └── README.md ├── 0875-koko-eating-bananas ├── 0875-koko-eating-bananas.cpp ├── NOTES.md └── README.md ├── 0875. Koko Eating Bananas.cpp ├── 0876-middle-of-the-linked-list ├── 0876-middle-of-the-linked-list.cpp └── README.md ├── 0876. Middle of the Linked List.cpp ├── 0879-profitable-schemes ├── 0879-profitable-schemes.cpp └── README.md ├── 0880-decoded-string-at-index ├── 0880-decoded-string-at-index.cpp └── README.md ├── 0881-boats-to-save-people ├── 0881-boats-to-save-people.cpp └── NOTES.md ├── 0881. Boats to Save People.cpp ├── 0884. Uncommon Words from Two Sentences.cpp ├── 0885-spiral-matrix-iii ├── 0885-spiral-matrix-iii.cpp └── README.md ├── 0886-possible-bipartition ├── 0886-possible-bipartition.cpp └── README.md ├── 0890. Find and Replace Pattern.cpp ├── 0894-all-possible-full-binary-trees └── README.md ├── 0895. Maximum Frequency Stack.cpp ├── 0897. Increasing Order Search Tree.cpp ├── 0898. Bitwise ORs of Subarrays.cpp ├── 0904-fruit-into-baskets ├── 0904-fruit-into-baskets.cpp ├── NOTES.md └── README.md ├── 0905. Sort Array By Parity.cpp ├── 0907-sum-of-subarray-minimums ├── 0907-sum-of-subarray-minimums.cpp ├── NOTES.md └── README.md ├── 0908. Smallest Range I.cpp ├── 0909-snakes-and-ladders ├── 0909-snakes-and-ladders.cpp └── NOTES.md ├── 0912-sort-an-array ├── 0912-sort-an-array.cpp ├── NOTES.md └── README.md ├── 0912. Sort an Array.cpp ├── 0916. Word Subsets.cpp ├── 0917. Reverse Only Letters.cpp ├── 0918-maximum-sum-circular-subarray ├── 0918-maximum-sum-circular-subarray.cpp └── NOTES.md ├── 0920-number-of-music-playlists ├── 0920-number-of-music-playlists.cpp ├── NOTES.md └── README.md ├── 0922. Sort Array By Parity II.cpp ├── 0923. 3Sum With Multiplicity.cpp ├── 0925. Long Pressed Name.cpp ├── 0926-flip-string-to-monotone-increasing ├── 0926-flip-string-to-monotone-increasing.cpp └── README.md ├── 0930-binary-subarrays-with-sum ├── 0930-binary-subarrays-with-sum.cpp ├── NOTES.md └── README.md ├── 0931-minimum-falling-path-sum ├── 0931-minimum-falling-path-sum.cpp ├── NOTES.md └── README.md ├── 0934-shortest-bridge ├── 0934-shortest-bridge.cpp ├── NOTES.md └── README.md ├── 0938-range-sum-of-bst ├── 0938-range-sum-of-bst.cpp ├── NOTES.md └── README.md ├── 0938. Range Sum of BST.cpp ├── 0941. Valid Mountain Array.cpp ├── 0944-delete-columns-to-make-sorted ├── 0944-delete-columns-to-make-sorted.cpp ├── NOTES.md └── README.md ├── 0944. Delete Columns to Make Sorted.cpp ├── 0945-minimum-increment-to-make-array-unique ├── 0945-minimum-increment-to-make-array-unique.cpp ├── NOTES.md └── README.md ├── 0945. Minimum Increment to Make Array Unique.cpp ├── 0946-validate-stack-sequences ├── 0946-validate-stack-sequences.cpp ├── NOTES.md └── README.md ├── 0946. Validate Stack Sequences.cpp ├── 0947-most-stones-removed-with-same-row-or-column ├── 0947-most-stones-removed-with-same-row-or-column.cpp ├── NOTES.md └── README.md ├── 0948-bag-of-tokens ├── 0948-bag-of-tokens.cpp ├── NOTES.md └── README.md ├── 0950-reveal-cards-in-increasing-order ├── 0950-reveal-cards-in-increasing-order.cpp ├── NOTES.md └── README.md ├── 0951. Flip Equivalent Binary Trees.cpp ├── 0953-verifying-an-alien-dictionary ├── 0953-verifying-an-alien-dictionary.cpp ├── NOTES.md └── README.md ├── 0955-delete-columns-to-make-sorted-ii ├── 0955-delete-columns-to-make-sorted-ii.cpp ├── NOTES.md └── README.md ├── 0956-tallest-billboard ├── 0956-tallest-billboard.cpp └── README.md ├── 0959-regions-cut-by-slashes ├── 0959-regions-cut-by-slashes.cpp ├── NOTES.md └── README.md ├── 0968. Binary Tree Cameras.cpp ├── 0974-subarray-sums-divisible-by-k ├── 0974-subarray-sums-divisible-by-k.cpp ├── NOTES.md └── README.md ├── 0974. Subarray Sums Divisible by K.cpp ├── 0976. Largest Perimeter Triangle.cpp ├── 0977-squares-of-a-sorted-array ├── 0977-squares-of-a-sorted-array.cpp ├── NOTES.md └── README.md ├── 0977. Squares of a Sorted Array.cpp ├── 0979-distribute-coins-in-binary-tree ├── 0979-distribute-coins-in-binary-tree.cpp └── README.md ├── 0980-unique-paths-iii ├── 0980-unique-paths-iii.cpp ├── NOTES.md └── README.md ├── 0987-vertical-order-traversal-of-a-binary-tree ├── 0987-vertical-order-traversal-of-a-binary-tree.cpp └── README.md ├── 0988-smallest-string-starting-from-leaf ├── 0988-smallest-string-starting-from-leaf.cpp └── README.md ├── 0989-add-to-array-form-of-integer ├── 0989-add-to-array-form-of-integer.cpp ├── NOTES.md └── README.md ├── 0989. Add to Array-Form of Integer.cpp ├── 0991. Broken Calculator.cpp ├── 0992-subarrays-with-k-different-integers ├── 0992-subarrays-with-k-different-integers.cpp ├── NOTES.md └── README.md ├── 0994-rotting-oranges ├── 0994-rotting-oranges.cpp ├── NOTES.md └── README.md ├── 0995-minimum-number-of-k-consecutive-bit-flips ├── 0995-minimum-number-of-k-consecutive-bit-flips.cpp ├── NOTES.md └── README.md ├── 0997-find-the-town-judge ├── 0997-find-the-town-judge.cpp ├── NOTES.md └── README.md ├── 0997. Find the Town Judge.cpp ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-hidden-flex-wrap-wrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondiv-styletransform-rotate180deg-svg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1838-frequency-of-the-most-frequent-element ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-hidden-flex-wrap-wrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondiv-styletransform-rotate180deg-svg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1838-frequency-of-the-most-frequent-element.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div779-k-th-symbol-in-grammar ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div779-k-th-symbol-in-grammar.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1337-the-k-weakest-rows-in-a-matrix ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1337-the-k-weakest-rows-in-a-matrix.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence10-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divlinkedin-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divwalmart-global-tech-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div706-design-hashmap ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence10-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divlinkedin-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divwalmart-global-tech-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div706-design-hashmap.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence16-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence11-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divuber-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divqualcomm-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div287-find-the-duplicate-number ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence16-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence11-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divuber-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divqualcomm-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div287-find-the-duplicate-number.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1980-find-unique-binary-string ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1980-find-unique-binary-string.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div823-binary-trees-with-factors ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div823-binary-trees-with-factors.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divflipkart-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div646-maximum-length-of-pair-chain ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divflipkart-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div646-maximum-length-of-pair-chain.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence32-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence8-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divuber-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divcitadel-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbytedance-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtwilio-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtiktok-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divvmware-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbookingcom-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divdoordash-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divde-shaw-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divquora-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div239-sliding-window-maximum ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence35-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence18-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence5-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div5-longest-palindromic-substring ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence35-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence18-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence7-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence5-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div5-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div456-132-pattern ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div456-132-pattern.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divyandex-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div392-is-subsequence ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divyandex-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div392-is-subsequence.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div229-majority-element-ii ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div229-majority-element-ii.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div746-min-cost-climbing-stairs ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div746-min-cost-climbing-stairs.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1662-check-if-two-string-arrays-are-equivalent ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1662-check-if-two-string-arrays-are-equivalent.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1266-minimum-time-visiting-all-points ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1266-minimum-time-visiting-all-points.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div316-remove-duplicate-letters ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div316-remove-duplicate-letters.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence10-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtwilio-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsnapchat-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div935-knight-dialer ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence10-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtwilio-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsnapchat-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div935-knight-dialer.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbox-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divcisco-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div191-number-of-1-bits ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbox-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divcisco-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divoracle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div191-number-of-1-bits.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divcapital-one-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1743-restore-the-array-from-adjacent-pairs ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divcapital-one-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1743-restore-the-array-from-adjacent-pairs.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divdirecti-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1535-find-the-winner-of-an-array-game ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divdirecti-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1535-find-the-winner-of-an-array-game.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divdropbox-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1845-seat-reservation-manager ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divdropbox-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1845-seat-reservation-manager.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div896-monotonic-array ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div896-monotonic-array.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence18-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div515-find-largest-value-in-each-tree-row ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence18-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div515-find-largest-value-in-each-tree-row.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1361-validate-binary-tree-nodes ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1361-validate-binary-tree-nodes.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div343-integer-break ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div343-integer-break.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1727-largest-submatrix-with-rearrangements ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1727-largest-submatrix-with-rearrangements.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence15-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divroblox-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div792-number-of-matching-subsequences └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1441-build-an-array-with-stack-operations ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1441-build-an-array-with-stack-operations.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1877-minimize-maximum-pair-sum-in-array ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1877-minimize-maximum-pair-sum-in-array.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1658-minimum-operations-to-reduce-x-to-zero ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1658-minimum-operations-to-reduce-x-to-zero.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div389-find-the-difference ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div389-find-the-difference.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divibm-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbookingcom-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divvisa-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtiktok-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div844-backspace-string-compare ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divibm-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbookingcom-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divvisa-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbloomberg-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtiktok-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div844-backspace-string-compare.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divinfosys-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1356-sort-integers-by-the-number-of-1-bits ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divinfosys-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1356-sort-integers-by-the-number-of-1-bits.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divkarat-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divindeed-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1160-find-words-that-can-be-formed-by-characters ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divkarat-divdiv-classcompanytagscontainer-tagoccurence12-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divindeed-divdiv-classcompanytagscontainer-tagoccurence6-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoogle-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1160-find-words-that-can-be-formed-by-characters.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div119-pascals-triangle-ii ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divgoldman-sachs-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div119-pascals-triangle-ii.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1512-number-of-good-pairs ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1512-number-of-good-pairs.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbolt-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divyandex-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divpaytm-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div557-reverse-words-in-a-string-iii ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divmicrosoft-divdiv-classcompanytagscontainer-tagoccurence5-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divbolt-divdiv-classcompanytagscontainer-tagoccurence3-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divyandex-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divpaytm-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div557-reverse-words-in-a-string-iii.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divpinterest-divdiv-classcompanytagscontainer-tagoccurence4-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2050-parallel-courses-iii ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divpinterest-divdiv-classcompanytagscontainer-tagoccurence4-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2050-parallel-courses-iii.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtwo-sigma-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div342-power-of-four ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divtwo-sigma-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div342-power-of-four.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divuber-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div799-champagne-tower ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divuber-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divadobe-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div799-champagne-tower.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divvirtu-financial-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1759-count-number-of-homogenous-substrings ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divvirtu-financial-divdiv-classcompanytagscontainer-tagoccurence1-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1759-count-number-of-homogenous-substrings.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divwalmart-global-tech-divdiv-classcompanytagscontainer-tagoccurence9-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2038-remove-colored-pieces-if-both-neighbors-are-the-same-color ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divwalmart-global-tech-divdiv-classcompanytagscontainer-tagoccurence9-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1048-longest-string-chain ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1048-longest-string-chain.java └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1081-smallest-subsequence-of-distinct-characters ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1081-smallest-subsequence-of-distinct-characters.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1095-find-in-mountain-array ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1095-find-in-mountain-array.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1220-count-vowels-permutation ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1220-count-vowels-permutation.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1269-number-of-ways-to-stay-in-the-same-place-after-some-steps ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1425-constrained-subsequence-sum ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1425-constrained-subsequence-sum.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1458-max-dot-product-of-two-subsequences ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1458-max-dot-product-of-two-subsequences.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1611-minimum-one-bit-operations-to-make-integers-zero ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1611-minimum-one-bit-operations-to-make-integers-zero.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1631-path-with-minimum-effort ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1631-path-with-minimum-effort.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1685-sum-of-absolute-differences-in-a-sorted-array ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1685-sum-of-absolute-differences-in-a-sorted-array.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1793-maximum-score-of-a-good-subarray ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1793-maximum-score-of-a-good-subarray.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1838-frequency-of-the-most-frequent-element ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1838-frequency-of-the-most-frequent-element.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1846-maximum-element-after-decreasing-and-rearranging ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1846-maximum-element-after-decreasing-and-rearranging.cpp └── NOTES.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1887-reduction-operations-to-make-the-array-elements-equal ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1887-reduction-operations-to-make-the-array-elements-equal.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1921-eliminate-maximum-number-of-monsters ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1921-eliminate-maximum-number-of-monsters.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2009-minimum-number-of-operations-to-make-array-continuous ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2009-minimum-number-of-operations-to-make-array-continuous.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2147-number-of-ways-to-divide-a-long-corridor ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2147-number-of-ways-to-divide-a-long-corridor.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2251-number-of-flowers-in-full-bloom ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2251-number-of-flowers-in-full-bloom.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2264-largest-3-same-digit-number-in-string ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2264-largest-3-same-digit-number-in-string.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2265-count-nodes-equal-to-average-of-subtree ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2265-count-nodes-equal-to-average-of-subtree.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2391-minimum-amount-of-time-to-collect-garbage ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2391-minimum-amount-of-time-to-collect-garbage.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2433-find-the-original-array-of-prefix-xor ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2433-find-the-original-array-of-prefix-xor.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2642-design-graph-with-shortest-path-calculator ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2642-design-graph-with-shortest-path-calculator.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2742-painting-the-walls ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2785-sort-vowels-in-a-string ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2785-sort-vowels-in-a-string.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2849-determine-if-a-cell-is-reachable-at-a-given-time ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2849-determine-if-a-cell-is-reachable-at-a-given-time.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2876-count-visited-nodes-in-a-directed-graph ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2876-count-visited-nodes-in-a-directed-graph.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2919-minimum-increment-operations-to-make-array-beautiful ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2919-minimum-increment-operations-to-make-array-beautiful.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2949-count-beautiful-substrings-ii ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div2949-count-beautiful-substrings-ii.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div34-find-first-and-last-position-of-element-in-sorted-array ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div34-find-first-and-last-position-of-element-in-sorted-array.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div458-poor-pigs ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div458-poor-pigs.cpp ├── NOTES.md └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div501-find-mode-in-binary-search-tree ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div501-find-mode-in-binary-search-tree.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div815-bus-routes ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div815-bus-routes.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div847-shortest-path-visiting-all-nodes ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div847-shortest-path-visiting-all-nodes.cpp └── README.md ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div905-sort-array-by-parity ├── 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div905-sort-array-by-parity.cpp └── NOTES.md ├── 1002-find-common-characters ├── 1002-find-common-characters.cpp ├── NOTES.md └── README.md ├── 1004-max-consecutive-ones-iii ├── 1004-max-consecutive-ones-iii.cpp └── NOTES.md ├── 1007. Minimum Domino Rotations For Equal Row.cpp ├── 1009. Complement of Base 10 Integer.cpp ├── 1010-pairs-of-songs-with-total-durations-divisible-by-60 ├── 1010-pairs-of-songs-with-total-durations-divisible-by-60.cpp ├── NOTES.md └── README.md ├── 1010. Pairs of Songs With Total Durations Divisible by 60.cpp ├── 1011-capacity-to-ship-packages-within-d-days ├── 1011-capacity-to-ship-packages-within-d-days.cpp ├── NOTES.md └── README.md ├── 1013. Partition Array Into Three Parts With Equal Sum.cpp ├── 1015. Smallest Integer Divisible by K.cpp ├── 1020-number-of-enclaves ├── 1020-number-of-enclaves.cpp ├── NOTES.md └── README.md ├── 1022. Sum of Root To Leaf Binary Numbers.cpp ├── 1025. Divisor Game.cpp ├── 1026-maximum-difference-between-node-and-ancestor ├── 1026-maximum-difference-between-node-and-ancestor.cpp └── README.md ├── 1026. Maximum Difference Between Node and Ancestor.cpp ├── 1027-longest-arithmetic-subsequence ├── 1027-longest-arithmetic-subsequence.cpp └── README.md ├── 1029. Two City Scheduling.cpp ├── 1038-binary-search-tree-to-greater-sum-tree ├── 1038-binary-search-tree-to-greater-sum-tree.cpp └── README.md ├── 1038. Binary Search Tree to Greater Sum Tree.cpp ├── 1039-minimum-score-triangulation-of-polygon ├── 1039-minimum-score-triangulation-of-polygon.cpp ├── NOTES.md └── README.md ├── 1039. Minimum Score Triangulation of Polygon.cpp ├── 1043-partition-array-for-maximum-sum ├── 1043-partition-array-for-maximum-sum.cpp ├── NOTES.md └── README.md ├── 1046-last-stone-weight ├── 1046-last-stone-weight.cpp ├── NOTES.md └── README.md ├── 1046. Last Stone Weight. Last Stone Weight.cpp ├── 1047. Remove All Adjacent Duplicates In String.cpp ├── 1048. Longest String Chain.cpp ├── 1049. Last Stone Weight II.cpp ├── 1051-height-checker ├── 1051-height-checker.cpp └── README.md ├── 1051. Height Checker.cpp ├── 1052-grumpy-bookstore-owner ├── 1052-grumpy-bookstore-owner.cpp ├── NOTES.md └── README.md ├── 1061-lexicographically-smallest-equivalent-string ├── 1061-lexicographically-smallest-equivalent-string.cpp └── README.md ├── 1068-product-sales-analysis-i ├── 1068-product-sales-analysis-i.sql ├── NOTES.md └── README.md ├── 1071-greatest-common-divisor-of-strings ├── 1071-greatest-common-divisor-of-strings.cpp ├── NOTES.md └── README.md ├── 1071. Greatest Common Divisor of Strings.cpp ├── 1074-number-of-submatrices-that-sum-to-target ├── 1074-number-of-submatrices-that-sum-to-target.cpp └── NOTES.md ├── 1081-smallest-subsequence-of-distinct-characters ├── 1081-smallest-subsequence-of-distinct-characters.cpp ├── NOTES.md └── README.md ├── 1089. Duplicate Zeros.cpp ├── 1091-shortest-path-in-binary-matrix ├── 1091-shortest-path-in-binary-matrix.cpp └── README.md ├── 1091. Shortest Path in Binary Matrix.cpp ├── 1092-shortest-common-supersequence ├── 1092-shortest-common-supersequence.cpp ├── NOTES.md └── README.md ├── 1092. Shortest Common Supersequence.cpp ├── 1105-filling-bookcase-shelves ├── 1105-filling-bookcase-shelves.cpp └── NOTES.md ├── 1108. Defanging an IP Address.cpp ├── 1110-delete-nodes-and-return-forest ├── 1110-delete-nodes-and-return-forest.cpp ├── NOTES.md └── README.md ├── 1111. Maximum Nesting Depth of Two Valid Parentheses Strings.cpp ├── 1114. Print in Order.cpp ├── 1122-relative-sort-array ├── 1122-relative-sort-array.cpp ├── NOTES.md └── README.md ├── 1125-smallest-sufficient-team ├── 1125-smallest-sufficient-team.cpp ├── NOTES.md └── README.md ├── 1129-shortest-path-with-alternating-colors ├── 1129-shortest-path-with-alternating-colors.cpp ├── NOTES.md └── README.md ├── 1137-n-th-tribonacci-number ├── 1137-n-th-tribonacci-number.cpp ├── NOTES.md └── README.md ├── 1137. N-th Tribonacci Number.cpp ├── 1140-stone-game-ii ├── 1140-stone-game-ii.cpp ├── NOTES.md └── README.md ├── 1143-longest-common-subsequence ├── 1143-longest-common-subsequence.cpp ├── NOTES.md └── README.md ├── 1146-snapshot-array ├── 1146-snapshot-array.cpp └── README.md ├── 1148-article-views-i ├── 1148-article-views-i.sql ├── NOTES.md └── README.md ├── 1154. Day of the Year.cpp ├── 1155-number-of-dice-rolls-with-target-sum ├── 1155-number-of-dice-rolls-with-target-sum.cpp ├── NOTES.md └── README.md ├── 1160-find-words-that-can-be-formed-by-characters ├── 1160-find-words-that-can-be-formed-by-characters.cpp ├── NOTES.md └── README.md ├── 1161-maximum-level-sum-of-a-binary-tree ├── 1161-maximum-level-sum-of-a-binary-tree.cpp └── README.md ├── 1162-as-far-from-land-as-possible ├── 1162-as-far-from-land-as-possible.cpp └── README.md ├── 1171-remove-zero-sum-consecutive-nodes-from-linked-list ├── 1171-remove-zero-sum-consecutive-nodes-from-linked-list.cpp ├── NOTES.md └── README.md ├── 1187-make-array-strictly-increasing ├── 1187-make-array-strictly-increasing.cpp └── README.md ├── 1189. Maximum Number of Balloons.cpp ├── 1192-critical-connections-in-a-network ├── 1192-critical-connections-in-a-network.cpp ├── NOTES.md └── README.md ├── 1192. Critical Connections in a Network.cpp ├── 1202. Smallest String With Swaps.cpp ├── 1203-sort-items-by-groups-respecting-dependencies ├── 1203-sort-items-by-groups-respecting-dependencies.cpp ├── NOTES.md └── README.md ├── 1207-unique-number-of-occurrences ├── 1207-unique-number-of-occurrences.cpp ├── NOTES.md └── README.md ├── 1207. Unique Number of Occurrences.cpp ├── 1208-get-equal-substrings-within-budget ├── 1208-get-equal-substrings-within-budget.cpp ├── NOTES.md └── README.md ├── 1209. Remove All Adjacent Duplicates in String II.cpp ├── 1217. Minimum Cost to Move Chips to The Same Position.cpp ├── 1218-longest-arithmetic-subsequence-of-given-difference ├── 1218-longest-arithmetic-subsequence-of-given-difference.cpp └── README.md ├── 1219-path-with-maximum-gold ├── 1219-path-with-maximum-gold.cpp └── README.md ├── 1220-count-vowels-permutation ├── 1220-count-vowels-permutation.cpp ├── NOTES.md └── README.md ├── 1220. Count Vowels Permutation.cpp ├── 1221. Split a String in Balanced Strings.cpp ├── 1232-check-if-it-is-a-straight-line ├── 1232-check-if-it-is-a-straight-line.cpp └── README.md ├── 1235-maximum-profit-in-job-scheduling ├── 1235-maximum-profit-in-job-scheduling.cpp └── README.md ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters.cpp ├── NOTES.md └── README.md ├── 1248-count-number-of-nice-subarrays ├── 1248-count-number-of-nice-subarrays.cpp └── NOTES.md ├── 1249-minimum-remove-to-make-valid-parentheses ├── 1249-minimum-remove-to-make-valid-parentheses.cpp └── README.md ├── 1249. Minimum Remove to Make Valid Parentheses.cpp ├── 1254-number-of-closed-islands ├── 1254-number-of-closed-islands.cpp └── README.md ├── 1260. Shift 2D Grid.cpp ├── 1266. Minimum Time Visiting All Points.cpp ├── 1268. Search Suggestions System.cpp ├── 1277-count-square-submatrices-with-all-ones ├── 1277-count-square-submatrices-with-all-ones.cpp ├── NOTES.md └── README.md ├── 1281. Subtract the Product and Sum of Digits of an Integer.cpp ├── 1282-group-the-people-given-the-group-size-they-belong-to ├── 1282-group-the-people-given-the-group-size-they-belong-to.cpp ├── NOTES.md └── README.md ├── 1287-element-appearing-more-than-25-in-sorted-array ├── 1287-element-appearing-more-than-25-in-sorted-array.cpp └── README.md ├── 1288. Remove Covered Intervals.cpp ├── 1289-minimum-falling-path-sum-ii ├── 1289-minimum-falling-path-sum-ii.cpp └── README.md ├── 1290. Convert Binary Number in a Linked List to Integer.cpp ├── 1291-sequential-digits ├── 1291-sequential-digits.cpp └── NOTES.md ├── 1291. Sequential Digits.cpp ├── 1295. Find Numbers with Even Number of Digits.cpp ├── 1299. Replace Elements with Greatest Element on Right Side.cpp ├── 1302. Deepest Leaves Sum.cpp ├── 1305. All Elements in Two Binary Search Trees.cpp ├── 1312-minimum-insertion-steps-to-make-a-string-palindrome └── README.md ├── 1312. Minimum Insertion Steps to Make a String Palindrome.cpp ├── 1313. Decompress Run-Length Encoded List.cpp ├── 1315. Sum of Nodes with Even-Valued Grandparent.cpp ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c.cpp ├── NOTES.md └── README.md ├── 1319-number-of-operations-to-make-network-connected ├── 1319-number-of-operations-to-make-network-connected.cpp ├── NOTES.md └── README.md ├── 1323. Maximum 69 Number.cpp ├── 1325-delete-leaves-with-a-given-value ├── 1325-delete-leaves-with-a-given-value.cpp └── README.md ├── 1325. Delete Leaves With a Given Value.cpp ├── 1326-minimum-number-of-taps-to-open-to-water-a-garden ├── 1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp ├── NOTES.md └── README.md ├── 1328. Break a Palindrome.cpp ├── 1331. Rank Transform of an Array.cpp ├── 1332. Remove Palindromic Subsequences.cpp ├── 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance ├── 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.cpp ├── NOTES.md └── README.md ├── 1335-minimum-difficulty-of-a-job-schedule ├── 1335-minimum-difficulty-of-a-job-schedule.cpp └── README.md ├── 1337-the-k-weakest-rows-in-a-matrix ├── 1337-the-k-weakest-rows-in-a-matrix.cpp └── README.md ├── 1337. The K Weakest Rows in a Matrix.cpp ├── 1339-maximum-product-of-splitted-binary-tree ├── 1339-maximum-product-of-splitted-binary-tree.cpp ├── NOTES.md └── README.md ├── 1342. Number of Steps to Reduce a Number to Zero.cpp ├── 1345-jump-game-iv ├── 1345-jump-game-iv.cpp └── README.md ├── 1346. Check If N and Its Double Exist.cpp ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram.cpp ├── NOTES.md └── README.md ├── 1351-count-negative-numbers-in-a-sorted-matrix ├── 1351-count-negative-numbers-in-a-sorted-matrix.cpp ├── NOTES.md └── README.md ├── 1351. Count Negative Numbers in a Sorted Matrix.cpp ├── 1358-number-of-substrings-containing-all-three-characters ├── NOTES.md └── README.md ├── 1359-count-all-valid-pickup-and-delivery-options ├── 1359-count-all-valid-pickup-and-delivery-options.cpp └── README.md ├── 1359. Count All Valid Pickup and Delivery Options.cpp ├── 1365. How Many Numbers Are Smaller Than the Current Number.cpp ├── 1372-longest-zigzag-path-in-a-binary-tree ├── 1372-longest-zigzag-path-in-a-binary-tree.cpp └── README.md ├── 1374. Generate a String With Characters That Have Odd Counts.cpp ├── 1376-time-needed-to-inform-all-employees ├── 1376-time-needed-to-inform-all-employees.cpp ├── NOTES.md └── README.md ├── 1378-replace-employee-id-with-the-unique-identifier ├── 1378-replace-employee-id-with-the-unique-identifier.sql ├── NOTES.md └── README.md ├── 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp ├── 1380-lucky-numbers-in-a-matrix ├── 1380-lucky-numbers-in-a-matrix.cpp └── README.md ├── 1380. Lucky Numbers in a Matrix.cpp ├── 1382-balance-a-binary-search-tree ├── 1382-balance-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 1385. Find the Distance Value Between Two Arrays.cpp ├── 1389. Create Target Array in the Given Order.cpp ├── 1394. Find Lucky Integer in an Array.cpp ├── 1395-count-number-of-teams └── README.md ├── 1396-design-underground-system ├── 1396-design-underground-system.cpp ├── NOTES.md └── README.md ├── 1396. Design Underground System.cpp ├── 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one ├── 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp └── README.md ├── 1406-stone-game-iii ├── 1406-stone-game-iii.cpp └── NOTES.md ├── 1416-restore-the-array ├── 1416-restore-the-array.cpp └── NOTES.md ├── 1417. Reformat The String.cpp ├── 1422-maximum-score-after-splitting-a-string ├── 1422-maximum-score-after-splitting-a-string.cpp ├── NOTES.md └── README.md ├── 1423-maximum-points-you-can-obtain-from-cards ├── 1423-maximum-points-you-can-obtain-from-cards.cpp ├── NOTES.md └── README.md ├── 1423. Maximum Points You Can Obtain from Cards.cpp ├── 1424. Diagonal Traverse II.cpp ├── 1425-constrained-subsequence-sum ├── 1425-constrained-subsequence-sum.cpp ├── NOTES.md └── README.md ├── 1431-kids-with-the-greatest-number-of-candies ├── 1431-kids-with-the-greatest-number-of-candies.cpp └── NOTES.md ├── 1431. Kids With the Greatest Number of Candies.cpp ├── 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit ├── 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.cpp ├── NOTES.md └── README.md ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor.cpp └── README.md ├── 1443-minimum-time-to-collect-all-apples-in-a-tree ├── 1443-minimum-time-to-collect-all-apples-in-a-tree.cpp └── README.md ├── 1444-number-of-ways-of-cutting-a-pizza ├── 1444-number-of-ways-of-cutting-a-pizza.cpp └── README.md ├── 1446. Consecutive Characters.cpp ├── 1448. Count Good Nodes in Binary Tree.cpp ├── 1450. Number of Students Doing Homework at a Given Time.cpp ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length.cpp ├── NOTES.md └── README.md ├── 1457-pseudo-palindromic-paths-in-a-binary-tree ├── 1457-pseudo-palindromic-paths-in-a-binary-tree.cpp └── README.md ├── 1457. Pseudo-Palindromic Paths in a Binary Tree.cpp ├── 1458-max-dot-product-of-two-subsequences ├── 1458-max-dot-product-of-two-subsequences.cpp ├── NOTES.md └── README.md ├── 1460-make-two-arrays-equal-by-reversing-subarrays ├── 1460-make-two-arrays-equal-by-reversing-subarrays.cpp └── NOTES.md ├── 1460. Make Two Arrays Equal by Reversing Sub-arrays.cpp ├── 1461. Check If a String Contains All Binary Codes of Size K.cpp ├── 1463-cherry-pickup-ii ├── 1463-cherry-pickup-ii.cpp ├── NOTES.md └── README.md ├── 1464-maximum-product-of-two-elements-in-an-array ├── 1464-maximum-product-of-two-elements-in-an-array.cpp ├── NOTES.md └── README.md ├── 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp ├── NOTES.md └── README.md ├── 1470-shuffle-the-array ├── 1470-shuffle-the-array.cpp ├── NOTES.md └── README.md ├── 1470. Shuffle the Array.cpp ├── 1472-design-browser-history ├── 1472-design-browser-history.cpp └── README.md ├── 1473. Paint House III.cpp ├── 1475. Final Prices With a Special Discount in a Shop.cpp ├── 1476. Subrectangle Queries.cpp ├── 1480. Running Sum of 1d Array.cpp ├── 1481-least-number-of-unique-integers-after-k-removals ├── 1481-least-number-of-unique-integers-after-k-removals.cpp └── README.md ├── 1482-minimum-number-of-days-to-make-m-bouquets ├── 1482-minimum-number-of-days-to-make-m-bouquets.cpp ├── NOTES.md └── README.md ├── 1486. XOR Operation in an Array.cpp ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.cpp └── NOTES.md ├── 1491. Average Salary Excluding the Minimum and Maximum Salary.cpp ├── 1493-longest-subarray-of-1s-after-deleting-one-element ├── 1493-longest-subarray-of-1s-after-deleting-one-element.cpp └── NOTES.md ├── 1496-path-crossing ├── 1496-path-crossing.cpp ├── NOTES.md └── README.md ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.cpp ├── NOTES.md └── README.md ├── 1502-can-make-arithmetic-progression-from-sequence ├── 1502-can-make-arithmetic-progression-from-sequence.cpp ├── NOTES.md └── README.md ├── 1502. Can Make Arithmetic Progression From Sequence.cpp ├── 1503-last-moment-before-all-ants-fall-out-of-a-plank ├── 1503-last-moment-before-all-ants-fall-out-of-a-plank.cpp ├── NOTES.md └── README.md ├── 1508-range-sum-of-sorted-subarray-sums ├── 1508-range-sum-of-sorted-subarray-sums.cpp ├── NOTES.md └── README.md ├── 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves ├── 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.cpp ├── NOTES.md └── README.md ├── 1512-number-of-good-pairs ├── 1512-number-of-good-pairs.cpp ├── NOTES.md └── README.md ├── 1512. Number of Good Pairs.cpp ├── 1514-path-with-maximum-probability ├── 1514-path-with-maximum-probability.cpp ├── NOTES.md └── README.md ├── 1518-water-bottles ├── 1518-water-bottles.cpp ├── NOTES.md └── README.md ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label.cpp └── README.md ├── 1523-count-odd-numbers-in-an-interval-range ├── 1523-count-odd-numbers-in-an-interval-range.cpp └── NOTES.md ├── 1523. Count Odd Numbers in an Interval Range.cpp ├── 1528. Shuffle String.cpp ├── 1530-number-of-good-leaf-nodes-pairs └── NOTES.md ├── 1531-string-compression-ii ├── 1531-string-compression-ii.cpp └── README.md ├── 1534. Count Good Triplets.cpp ├── 1539-kth-missing-positive-number ├── 1539-kth-missing-positive-number.cpp ├── NOTES.md └── README.md ├── 1539. Kth Missing Positive Number.cpp ├── 1544-make-the-string-great ├── 1544-make-the-string-great.cpp ├── NOTES.md └── README.md ├── 1547-minimum-cost-to-cut-a-stick ├── 1547-minimum-cost-to-cut-a-stick.cpp └── README.md ├── 1550-three-consecutive-odds ├── 1550-three-consecutive-odds.cpp ├── NOTES.md └── README.md ├── 1550. Three Consecutive Odds.cpp ├── 1551. Minimum Operations to Make Array Equal.cpp ├── 1552-magnetic-force-between-two-balls ├── 1552-magnetic-force-between-two-balls.cpp ├── NOTES.md └── README.md ├── 1568-minimum-number-of-days-to-disconnect-island ├── 1568-minimum-number-of-days-to-disconnect-island.cpp └── README.md ├── 1569-number-of-ways-to-reorder-array-to-get-same-bst ├── 1569-number-of-ways-to-reorder-array-to-get-same-bst.cpp ├── NOTES.md └── README.md ├── 1572-matrix-diagonal-sum ├── 1572-matrix-diagonal-sum.cpp ├── NOTES.md └── README.md ├── 1572. Matrix Diagonal Sum.cpp ├── 1575-count-all-possible-routes ├── 1575-count-all-possible-routes.cpp ├── NOTES.md └── README.md ├── 1578-minimum-time-to-make-rope-colorful ├── 1578-minimum-time-to-make-rope-colorful.cpp ├── NOTES.md └── README.md ├── 1578. Minimum Time to Make Rope Colorful.cpp ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.cpp ├── NOTES.md └── README.md ├── 1582-special-positions-in-a-binary-matrix ├── 1582-special-positions-in-a-binary-matrix.cpp ├── NOTES.md └── README.md ├── 1584-min-cost-to-connect-all-points ├── 1584-min-cost-to-connect-all-points.cpp ├── NOTES.md └── README.md ├── 1584. Min Cost to Connect All Points.cpp ├── 1592. Rearrange Spaces Between Words.cpp ├── 1598. Crawler Log Folder.cpp ├── 1601-maximum-number-of-achievable-transfer-requests ├── 1601-maximum-number-of-achievable-transfer-requests.cpp └── README.md ├── 1603-design-parking-system ├── 1603-design-parking-system.cpp └── README.md ├── 1603. Design Parking System.cpp ├── 1605-find-valid-matrix-given-row-and-column-sums ├── 1605-find-valid-matrix-given-row-and-column-sums.cpp └── NOTES.md ├── 1608-special-array-with-x-elements-greater-than-or-equal-x ├── 1608-special-array-with-x-elements-greater-than-or-equal-x.cpp ├── NOTES.md └── README.md ├── 1608. Special Array With X Elements Greater Than or Equal X.cpp ├── 1609-even-odd-tree ├── 1609-even-odd-tree.cpp ├── NOTES.md └── README.md ├── 1614-maximum-nesting-depth-of-the-parentheses ├── 1614-maximum-nesting-depth-of-the-parentheses.cpp ├── NOTES.md └── README.md ├── 1614. Maximum Nesting Depth of the Parentheses.cpp ├── 1615-maximal-network-rank ├── 1615-maximal-network-rank.cpp ├── NOTES.md └── README.md ├── 1624-largest-substring-between-two-equal-characters ├── 1624-largest-substring-between-two-equal-characters.cpp ├── NOTES.md └── README.md ├── 1626-best-team-with-no-conflicts ├── 1626-best-team-with-no-conflicts.cpp └── README.md ├── 1631. Path With Minimum Effort.cpp ├── 1636-sort-array-by-increasing-frequency └── README.md ├── 1637-widest-vertical-area-between-two-points-containing-no-points ├── 1637-widest-vertical-area-between-two-points-containing-no-points.cpp ├── NOTES.md └── README.md ├── 1637. Widest Vertical Area Between Two Points Containing No Points.cpp ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary.cpp └── NOTES.md ├── 1641. Count Sorted Vowel Strings.cpp ├── 1642-furthest-building-you-can-reach ├── 1642-furthest-building-you-can-reach.cpp └── README.md ├── 1642. Furthest Building You Can Reach.cpp ├── 1647-minimum-deletions-to-make-character-frequencies-unique ├── 1647-minimum-deletions-to-make-character-frequencies-unique.cpp ├── NOTES.md └── README.md ├── 1647. Minimum Deletions to Make Character Frequencies Unique.cpp ├── 1653-minimum-deletions-to-make-string-balanced └── README.md ├── 1653. Minimum Deletions to Make String Balanced.cpp ├── 1657-determine-if-two-strings-are-close ├── 1657-determine-if-two-strings-are-close.cpp ├── NOTES.md └── README.md ├── 1658. Minimum Operations to Reduce X to Zero.cpp ├── 1662. Check If Two String Arrays are Equivalent.cpp ├── 1663. Smallest String With A Given Numeric Value.cpp ├── 1669-merge-in-between-linked-lists ├── 1669-merge-in-between-linked-lists.cpp └── README.md ├── 1672. Richest Customer Wealth.cpp ├── 1675-minimize-deviation-in-array ├── 1675-minimize-deviation-in-array.cpp ├── NOTES.md └── README.md ├── 1675. Minimize Deviation in Array.cpp ├── 1678. Goal Parser Interpretation.cpp ├── 1679. Max Number of K-Sum Pairs.cpp ├── 1683-invalid-tweets ├── 1683-invalid-tweets.sql ├── NOTES.md └── README.md ├── 1685-sum-of-absolute-differences-in-a-sorted-array ├── 1685-sum-of-absolute-differences-in-a-sorted-array.cpp └── NOTES.md ├── 1688. Count of Matches in Tournament.cpp ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp ├── 1695. Maximum Erasure Value.cpp ├── 1696. Jump Game VI.cpp ├── 1697-checking-existence-of-edge-length-limited-paths ├── 1697-checking-existence-of-edge-length-limited-paths.cpp └── README.md ├── 1700-number-of-students-unable-to-eat-lunch ├── 1700-number-of-students-unable-to-eat-lunch.cpp ├── NOTES.md └── README.md ├── 1700. Number of Students Unable to Eat Lunch.cpp ├── 1704-determine-if-string-halves-are-alike ├── 1704-determine-if-string-halves-are-alike.cpp ├── NOTES.md └── README.md ├── 1704. Determine if String Halves Are Alike.cpp ├── 1707-maximum-xor-with-an-element-from-array ├── 1707-maximum-xor-with-an-element-from-array.cpp └── README.md ├── 1716-calculate-money-in-leetcode-bank ├── 1716-calculate-money-in-leetcode-bank.cpp ├── NOTES.md └── README.md ├── 1720. Decode XORed Array.cpp ├── 1721-swapping-nodes-in-a-linked-list ├── NOTES.md └── README.md ├── 1721. Swapping Nodes in a Linked List.cpp ├── 1727-largest-submatrix-with-rearrangements ├── 1727-largest-submatrix-with-rearrangements.cpp ├── NOTES.md └── README.md ├── 1732-find-the-highest-altitude ├── 1732-find-the-highest-altitude.cpp ├── NOTES.md └── README.md ├── 1732. Find the Highest Altitude.cpp ├── 1743-restore-the-array-from-adjacent-pairs ├── 1743-restore-the-array-from-adjacent-pairs.cpp ├── NOTES.md └── README.md ├── 1748. Sum of Unique Elements.cpp ├── 1749. Maximum Absolute Sum of Any Subarray.cpp ├── 1750-minimum-length-of-string-after-deleting-similar-ends ├── 1750-minimum-length-of-string-after-deleting-similar-ends.cpp └── README.md ├── 1751-maximum-number-of-events-that-can-be-attended-ii ├── 1751-maximum-number-of-events-that-can-be-attended-ii.cpp └── README.md ├── 1752. Check if Array Is Sorted and Rotated.cpp ├── 1757-recyclable-and-low-fat-products ├── 1757-recyclable-and-low-fat-products.sql └── NOTES.md ├── 1758-minimum-changes-to-make-alternating-binary-string ├── 1758-minimum-changes-to-make-alternating-binary-string.cpp ├── NOTES.md └── README.md ├── 1759-count-number-of-homogenous-substrings ├── 1759-count-number-of-homogenous-substrings.cpp ├── NOTES.md └── README.md ├── 1768-merge-strings-alternately ├── 1768-merge-strings-alternately.cpp └── NOTES.md ├── 1769. Minimum Number of Operations to Move All Balls to Each Box.cpp ├── 1770-maximum-score-from-performing-multiplication-operations ├── 1770-maximum-score-from-performing-multiplication-operations.cpp └── README.md ├── 1780. Check if Number is a Sum of Powers of Three.cpp ├── 1791-find-center-of-star-graph ├── 1791-find-center-of-star-graph.cpp └── README.md ├── 1791. Find Center of Star Graph.cpp ├── 1793-maximum-score-of-a-good-subarray ├── 1793-maximum-score-of-a-good-subarray.cpp ├── NOTES.md └── README.md ├── 1797-design-authentication-manager ├── 1797-design-authentication-manager.cpp ├── NOTES.md └── README.md ├── 1799-maximize-score-after-n-operations ├── 1799-maximize-score-after-n-operations.cpp └── NOTES.md ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array.cpp ├── NOTES.md └── README.md ├── 1816. Truncate Sentence.cpp ├── 1822-sign-of-the-product-of-an-array ├── 1822-sign-of-the-product-of-an-array.cpp ├── NOTES.md └── README.md ├── 1832. Check if the Sentence Is Pangram.cpp ├── 1833-maximum-ice-cream-bars ├── 1833-maximum-ice-cream-bars.cpp ├── NOTES.md └── README.md ├── 1834-single-threaded-cpu ├── 1834-single-threaded-cpu.cpp └── README.md ├── 1844. Replace All Digits with Characters.cpp ├── 1845-seat-reservation-manager ├── 1845-seat-reservation-manager.cpp ├── NOTES.md └── README.md ├── 1855. Maximum Distance Between a Pair of Values.cpp ├── 1857-largest-color-value-in-a-directed-graph ├── 1857-largest-color-value-in-a-directed-graph.cpp ├── NOTES.md └── README.md ├── 1859. Sorting the Sentence.cpp ├── 1863-sum-of-all-subset-xor-totals ├── 1863-sum-of-all-subset-xor-totals.cpp ├── NOTES.md └── README.md ├── 1870-minimum-speed-to-arrive-on-time ├── 1870-minimum-speed-to-arrive-on-time.cpp ├── NOTES.md └── README.md ├── 1876. Substrings of Size Three with Distinct Characters.cpp ├── 1877-minimize-maximum-pair-sum-in-array ├── NOTES.md └── README.md ├── 1880. Check if Word Equals Summation of Two Words.cpp ├── 1887-reduction-operations-to-make-the-array-elements-equal ├── 1887-reduction-operations-to-make-the-array-elements-equal.cpp └── README.md ├── 1893. Check if All the Integers in a Range Are Covered.cpp ├── 1897-redistribute-characters-to-make-all-strings-equal ├── 1897-redistribute-characters-to-make-all-strings-equal.cpp ├── NOTES.md └── README.md ├── 1903-largest-odd-number-in-string ├── 1903-largest-odd-number-in-string.cpp ├── NOTES.md └── README.md ├── 1903. Largest Odd Number in String.cpp ├── 1905-count-sub-islands ├── 1905-count-sub-islands.cpp ├── NOTES.md └── README.md ├── 1909. Remove One Element to Make the Array Strictly Increasing.cpp ├── 1913-maximum-product-difference-between-two-pairs ├── 1913-maximum-product-difference-between-two-pairs.cpp ├── NOTES.md └── README.md ├── 1915-number-of-wonderful-substrings ├── 1915-number-of-wonderful-substrings.cpp └── README.md ├── 1920. Build Array from Permutation.cpp ├── 1921-eliminate-maximum-number-of-monsters ├── 1921-eliminate-maximum-number-of-monsters.cpp └── README.md ├── 1929. Concatenation of Array.cpp ├── 1930-unique-length-3-palindromic-subsequences ├── 1930-unique-length-3-palindromic-subsequences.cpp ├── NOTES.md └── README.md ├── 1937-maximum-number-of-points-with-cost └── README.md ├── 1941. Check if All Characters Have Equal Number of Occurrences.cpp ├── 1945. Sum of Digits of String After Convert.cpp ├── 1952. Three Divisors.cpp ├── 1957. Delete Characters to Make Fancy String.cpp ├── 1961. Check If String Is a Prefix of Array.cpp ├── 1962-remove-stones-to-minimize-the-total ├── 1962-remove-stones-to-minimize-the-total.cpp ├── NOTES.md └── README.md ├── 1964-find-the-longest-valid-obstacle-course-at-each-position ├── 1964-find-the-longest-valid-obstacle-course-at-each-position.cpp └── NOTES.md ├── 1967. Number of Strings That Appear as Substrings in Word.cpp ├── 1970-last-day-where-you-can-still-cross ├── 1970-last-day-where-you-can-still-cross.cpp └── README.md ├── 1971-find-if-path-exists-in-graph └── README.md ├── 1974. Minimum Time to Type Word Using Special Typewriter.cpp ├── 1976-number-of-ways-to-arrive-at-destination ├── 1976-number-of-ways-to-arrive-at-destination.cpp └── NOTES.md ├── 1979. Find Greatest Common Divisor of Array.cpp ├── 1980-find-unique-binary-string ├── 1980-find-unique-binary-string.cpp ├── NOTES.md └── README.md ├── 1985-find-the-kth-largest-integer-in-the-array ├── 1985-find-the-kth-largest-integer-in-the-array.cpp └── NOTES.md ├── 1991. Find the Middle Index in Array.cpp ├── 1992-find-all-groups-of-farmland ├── 1992-find-all-groups-of-farmland.cpp └── README.md ├── 1995. Count Special Quadruplets.cpp ├── 2000-reverse-prefix-of-word ├── 2000-reverse-prefix-of-word.cpp └── NOTES.md ├── 2000. Reverse Prefix of Word.cpp ├── 2006. Count Number of Pairs With Absolute Difference K.cpp ├── 2011. Final Value of Variable After Performing Operations.cpp ├── 2016. Maximum Difference Between Increasing Elements.cpp ├── 2024-maximize-the-confusion-of-an-exam ├── 2024-maximize-the-confusion-of-an-exam.cpp ├── NOTES.md └── README.md ├── 2032. Two Out of Three.cpp ├── 2037-minimum-number-of-moves-to-seat-everyone ├── 2037-minimum-number-of-moves-to-seat-everyone.cpp ├── NOTES.md └── README.md ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.cpp ├── NOTES.md └── README.md ├── 2042. Check if Numbers Are Ascending in a Sentence.cpp ├── 2045-second-minimum-time-to-reach-destination ├── 2045-second-minimum-time-to-reach-destination.cpp └── NOTES.md ├── 2047. Number of Valid Words in a Sentence.cpp ├── 2053-kth-distinct-string-in-an-array ├── 2053-kth-distinct-string-in-an-array.cpp ├── NOTES.md └── README.md ├── 2053. Kth Distinct String in an Array.cpp ├── 2057. Smallest Index With Equal Value.cpp ├── 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points ├── 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.cpp └── NOTES.md ├── 2062. Count Vowel Substrings of a String.cpp ├── 2063-vowels-of-all-substrings ├── 2063-vowels-of-all-substrings.cpp └── README.md ├── 2068. Check Whether Two Strings are Almost Equivalent.cpp ├── 2073-time-needed-to-buy-tickets ├── 2073-time-needed-to-buy-tickets.cpp ├── NOTES.md └── README.md ├── 2073. Time Needed to Buy Tickets.cpp ├── 2078. Two Furthest Houses With Different Colors.cpp ├── 2079. Watering Plants.cpp ├── 2085. Count Common Words With One Occurrence.cpp ├── 2089. Find Target Indices After Sorting Array.cpp ├── 2090-k-radius-subarray-averages ├── 2090-k-radius-subarray-averages.cpp ├── NOTES.md └── README.md ├── 2091-removing-minimum-and-maximum-from-array ├── 2091-removing-minimum-and-maximum-from-array.cpp ├── NOTES.md └── README.md ├── 2092-find-all-people-with-secret ├── 2092-find-all-people-with-secret.cpp ├── NOTES.md └── README.md ├── 2094. Finding 3-Digit Even Numbers.cpp ├── 2095. Delete the Middle Node of a Linked List.cpp ├── 2096-step-by-step-directions-from-a-binary-tree-node-to-another ├── 2096-step-by-step-directions-from-a-binary-tree-node-to-another.cpp └── README.md ├── 2101-detonate-the-maximum-bombs ├── 2101-detonate-the-maximum-bombs.cpp ├── NOTES.md └── README.md ├── 2105. Watering Plants II.cpp ├── 2108-find-first-palindromic-string-in-the-array ├── 2108-find-first-palindromic-string-in-the-array.cpp └── README.md ├── 2108. Find First Palindromic String in the Array.cpp ├── 2114. Maximum Number of Words Found in Sentences.cpp ├── 2119. A Number After a Double Reversal.cpp ├── 2124. Check if All A's Appears Before All B's.cpp ├── 2125-number-of-laser-beams-in-a-bank ├── 2125-number-of-laser-beams-in-a-bank.cpp ├── NOTES.md └── README.md ├── 2125. Number of Laser Beams in a Bank.cpp ├── 2129. Capitalize the Title.cpp ├── 2130. Maximum Twin Sum of a Linked List.cpp ├── 2133. Check if Every Row and Column Contains All Numbers.cpp ├── 2134-minimum-swaps-to-group-all-1s-together-ii ├── 2134-minimum-swaps-to-group-all-1s-together-ii.cpp ├── NOTES.md └── README.md ├── 2139. Minimum Moves to Reach Target Score.cpp ├── 2140-solving-questions-with-brainpower ├── 2140-solving-questions-with-brainpower.cpp └── README.md ├── 2141-maximum-running-time-of-n-computers ├── 2141-maximum-running-time-of-n-computers.cpp └── NOTES.md ├── 2148. Count Elements With Strictly Smaller and Greater Elements.cpp ├── 2149-rearrange-array-elements-by-sign ├── 2149-rearrange-array-elements-by-sign.cpp ├── NOTES.md └── README.md ├── 2149. Rearrange Array Elements by Sign.cpp ├── 2150. Find All Lonely Numbers in the Array.cpp ├── 2154. Keep Multiplying Found Values by Two.cpp ├── 2160. Minimum Sum of Four Digit Number After Splitting Digits.cpp ├── 2161. Partition Array According to Given Pivot.cpp ├── 2164. Sort Even and Odd Indices Independently.cpp ├── 2169. Count Operations to Obtain Zero.cpp ├── 2177. Find Three Consecutive Integers That Sum to a Given Numbe.cpp ├── 2180. Count Integers With Even Digit Sum.cpp ├── 2181-merge-nodes-in-between-zeros ├── 2181-merge-nodes-in-between-zeros.cpp └── README.md ├── 2181. Merge Nodes in Between Zeros.cpp ├── 2187-minimum-time-to-complete-trips ├── 2187-minimum-time-to-complete-trips.cpp └── NOTES.md ├── 2191-sort-the-jumbled-numbers ├── 2191-sort-the-jumbled-numbers.cpp └── README.md ├── 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph ├── 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp ├── NOTES.md └── README.md ├── 2196-create-binary-tree-from-descriptions ├── 2196-create-binary-tree-from-descriptions.cpp └── README.md ├── 2218-maximum-value-of-k-coins-from-piles ├── 2218-maximum-value-of-k-coins-from-piles.cpp └── NOTES.md ├── 2225-find-players-with-zero-or-one-losses ├── 2225-find-players-with-zero-or-one-losses.cpp ├── NOTES.md └── README.md ├── 2231-largest-number-after-digit-swaps-by-parity ├── 2231-largest-number-after-digit-swaps-by-parity.cpp └── README.md ├── 2244-minimum-rounds-to-complete-all-tasks ├── 2244-minimum-rounds-to-complete-all-tasks.cpp └── README.md ├── 2244. Minimum Rounds to Complete All Tasks.cpp ├── 2246-longest-path-with-different-adjacent-characters ├── 2246-longest-path-with-different-adjacent-characters.cpp └── README.md ├── 2251-number-of-flowers-in-full-bloom ├── 2251-number-of-flowers-in-full-bloom.cpp ├── NOTES.md └── README.md ├── 2256-minimum-average-difference ├── 2256-minimum-average-difference.cpp ├── NOTES.md └── README.md ├── 2262-total-appeal-of-a-string ├── 2262-total-appeal-of-a-string.cpp ├── NOTES.md └── README.md ├── 2264-largest-3-same-digit-number-in-string ├── 2264-largest-3-same-digit-number-in-string.cpp ├── NOTES.md └── README.md ├── 2265-count-nodes-equal-to-average-of-subtree ├── 2265-count-nodes-equal-to-average-of-subtree.cpp └── README.md ├── 2269. Find the K-Beauty of a Number.cpp ├── 2270. Number of Ways to Split Array.cpp ├── 2272-substring-with-largest-variance ├── 2272-substring-with-largest-variance.cpp ├── NOTES.md └── README.md ├── 2273. Find Resultant Array After Removing Anagrams.cpp ├── 2274. Maximum Consecutive Floors Without Special Floors.cpp ├── 2279-maximum-bags-with-full-capacity-of-rocks ├── 2279-maximum-bags-with-full-capacity-of-rocks.cpp ├── NOTES.md └── README.md ├── 2283. Check if Number Has Equal Digit Count and Digit Value.cpp ├── 2285-maximum-total-importance-of-roads ├── 2285-maximum-total-importance-of-roads.cpp └── README.md ├── 2287. Rearrange Characters to Make Target String.cpp ├── 2290-minimum-obstacle-removal-to-reach-corner ├── 2290-minimum-obstacle-removal-to-reach-corner.cpp ├── NOTES.md └── README.md ├── 2293. Min Max Game.cpp ├── 2300-successful-pairs-of-spells-and-potions ├── 2300-successful-pairs-of-spells-and-potions.cpp ├── NOTES.md └── README.md ├── 2305-fair-distribution-of-cookies ├── NOTES.md └── README.md ├── 2306-naming-a-company ├── 2306-naming-a-company.cpp ├── NOTES.md └── README.md ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.cpp └── README.md ├── 2327-number-of-people-aware-of-a-secret ├── 2327-number-of-people-aware-of-a-secret.cpp └── README.md ├── 2328-number-of-increasing-paths-in-a-grid ├── 2328-number-of-increasing-paths-in-a-grid.cpp ├── NOTES.md └── README.md ├── 2331-evaluate-boolean-binary-tree ├── 2331-evaluate-boolean-binary-tree.cpp ├── NOTES.md └── README.md ├── 2336-smallest-number-in-infinite-set ├── 2336-smallest-number-in-infinite-set.cpp ├── NOTES.md └── README.md ├── 2342-max-sum-of-a-pair-with-equal-sum-of-digits ├── 2342-max-sum-of-a-pair-with-equal-sum-of-digits.cpp ├── NOTES.md └── README.md ├── 2343-query-kth-smallest-trimmed-number ├── 2343-query-kth-smallest-trimmed-number.cpp └── NOTES.md ├── 2347. Best Poker Hand.cpp ├── 2348. Number of Zero-Filled Subarrays.cpp ├── 2351. First Letter to Appear Twice.cpp ├── 2352-equal-row-and-column-pairs ├── 2352-equal-row-and-column-pairs.cpp ├── NOTES.md └── README.md ├── 2352. Equal Row and Column Pairs.cpp ├── 2353-design-a-food-rating-system ├── 2353-design-a-food-rating-system.cpp ├── NOTES.md └── README.md ├── 2357. Make Array Zero by Subtracting Equal Amounts.cpp ├── 2358-maximum-number-of-groups-entering-a-competition ├── 2358-maximum-number-of-groups-entering-a-competition.cpp ├── NOTES.md └── README.md ├── 2358. Maximum Number of Groups Entering a Competition.cpp ├── 2359-find-closest-node-to-given-two-nodes ├── 2359-find-closest-node-to-given-two-nodes.cpp └── NOTES.md ├── 2360-longest-cycle-in-a-graph ├── 2360-longest-cycle-in-a-graph.cpp └── README.md ├── 2363. Merge Similar Items.cpp ├── 2365. Task Scheduler II.cpp ├── 2366-minimum-replacements-to-sort-the-array ├── 2366-minimum-replacements-to-sort-the-array.cpp ├── NOTES.md └── README.md ├── 2367. Number of Arithmetic Triplets.cpp ├── 2368. Reachable Nodes With Restrictions.cpp ├── 2369-check-if-there-is-a-valid-partition-for-the-array ├── 2369-check-if-there-is-a-valid-partition-for-the-array.cpp ├── NOTES.md └── README.md ├── 2369. Check if There is a Valid Partition For The Array.cpp ├── 2370-longest-ideal-subsequence ├── 2370-longest-ideal-subsequence.cpp └── README.md ├── 2373-largest-local-values-in-a-matrix ├── 2373-largest-local-values-in-a-matrix.cpp └── README.md ├── 2385-amount-of-time-for-binary-tree-to-be-infected ├── 2385-amount-of-time-for-binary-tree-to-be-infected.cpp └── README.md ├── 2389-longest-subsequence-with-limited-sum ├── 2389-longest-subsequence-with-limited-sum.cpp ├── NOTES.md └── README.md ├── 2390-removing-stars-from-a-string ├── 2390-removing-stars-from-a-string.cpp ├── NOTES.md └── README.md ├── 2391-minimum-amount-of-time-to-collect-garbage ├── 2391-minimum-amount-of-time-to-collect-garbage.cpp ├── NOTES.md └── README.md ├── 2392-build-a-matrix-with-conditions ├── 2392-build-a-matrix-with-conditions.cpp └── README.md ├── 2402-meeting-rooms-iii ├── 2402-meeting-rooms-iii.cpp ├── NOTES.md └── README.md ├── 2405-optimal-partition-of-string ├── 2405-optimal-partition-of-string.cpp ├── NOTES.md └── README.md ├── 2418-sort-the-people ├── 2418-sort-the-people.cpp ├── NOTES.md └── README.md ├── 2421-number-of-good-paths ├── 2421-number-of-good-paths.cpp └── README.md ├── 2433-find-the-original-array-of-prefix-xor ├── 2433-find-the-original-array-of-prefix-xor.cpp ├── NOTES.md └── README.md ├── 2439-minimize-maximum-of-array ├── 2439-minimize-maximum-of-array.cpp └── NOTES.md ├── 2441-largest-positive-integer-that-exists-with-its-negative ├── 2441-largest-positive-integer-that-exists-with-its-negative.cpp ├── NOTES.md └── README.md ├── 2444-count-subarrays-with-fixed-bounds ├── 2444-count-subarrays-with-fixed-bounds.cpp ├── NOTES.md └── README.md ├── 2448-minimum-cost-to-make-array-equal ├── 2448-minimum-cost-to-make-array-equal.cpp └── README.md ├── 2462-total-cost-to-hire-k-workers ├── 2462-total-cost-to-hire-k-workers.cpp ├── NOTES.md └── README.md ├── 2466-count-ways-to-build-good-strings ├── 2466-count-ways-to-build-good-strings.cpp └── README.md ├── 2477-minimum-fuel-cost-to-report-to-the-capital ├── 2477-minimum-fuel-cost-to-report-to-the-capital.cpp └── NOTES.md ├── 2482-difference-between-ones-and-zeros-in-row-and-column ├── 2482-difference-between-ones-and-zeros-in-row-and-column.cpp ├── NOTES.md └── README.md ├── 2483-minimum-penalty-for-a-shop ├── 2483-minimum-penalty-for-a-shop.cpp ├── NOTES.md └── README.md ├── 2485-find-the-pivot-integer ├── 2485-find-the-pivot-integer.cpp ├── NOTES.md └── README.md ├── 2486-append-characters-to-string-to-make-subsequence ├── 2486-append-characters-to-string-to-make-subsequence.cpp └── README.md ├── 2487-remove-nodes-from-linked-list ├── 2487-remove-nodes-from-linked-list.cpp ├── NOTES.md └── README.md ├── 2492-minimum-score-of-a-path-between-two-cities ├── 2492-minimum-score-of-a-path-between-two-cities.cpp ├── NOTES.md └── README.md ├── 2501-longest-square-streak-in-an-array ├── 2501-longest-square-streak-in-an-array.cpp └── README.md ├── 2508-add-edges-to-make-degrees-of-all-nodes-even ├── 2508-add-edges-to-make-degrees-of-all-nodes-even.cpp ├── NOTES.md └── README.md ├── 2512-reward-top-k-students ├── 2512-reward-top-k-students.cpp ├── NOTES.md └── README.md ├── 2513-minimize-the-maximum-of-two-arrays ├── 2513-minimize-the-maximum-of-two-arrays.cpp └── README.md ├── 2515-shortest-distance-to-target-string-in-a-circular-array ├── 2515-shortest-distance-to-target-string-in-a-circular-array.cpp └── README.md ├── 2516-take-k-of-each-character-from-left-and-right ├── 2516-take-k-of-each-character-from-left-and-right.cpp ├── NOTES.md └── README.md ├── 2540-minimum-common-value ├── 2540-minimum-common-value.cpp └── README.md ├── 2542-maximum-subsequence-score ├── 2542-maximum-subsequence-score.cpp └── NOTES.md ├── 2551-put-marbles-in-bags ├── NOTES.md └── README.md ├── 2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip ├── 2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.cpp ├── NOTES.md └── README.md ├── 2567-minimum-score-by-changing-two-elements ├── 2567-minimum-score-by-changing-two-elements.cpp └── NOTES.md ├── 2582-pass-the-pillow ├── 2582-pass-the-pillow.cpp ├── NOTES.md └── README.md ├── 2591-distribute-money-to-maximum-children ├── 2591-distribute-money-to-maximum-children.cpp ├── NOTES.md └── README.md ├── 2596-check-knight-tour-configuration ├── 2596-check-knight-tour-configuration.cpp └── README.md ├── 2597-the-number-of-beautiful-subsets ├── 2597-the-number-of-beautiful-subsets.cpp ├── NOTES.md └── README.md ├── 2598-smallest-missing-non-negative-integer-after-operations ├── 2598-smallest-missing-non-negative-integer-after-operations.cpp └── README.md ├── 2607-make-k-subarray-sums-equal ├── 2607-make-k-subarray-sums-equal.cpp ├── NOTES.md └── README.md ├── 2610-convert-an-array-into-a-2d-array-with-conditions ├── 2610-convert-an-array-into-a-2d-array-with-conditions.cpp ├── NOTES.md └── README.md ├── 2616-minimize-the-maximum-difference-of-pairs ├── 2616-minimize-the-maximum-difference-of-pairs.cpp └── README.md ├── 2618-check-if-object-instance-of-class ├── 2618-check-if-object-instance-of-class.js ├── NOTES.md └── README.md ├── 2619-array-prototype-last ├── 2619-array-prototype-last.js └── NOTES.md ├── 2620-counter ├── 2620-counter.js ├── NOTES.md └── README.md ├── 2621-sleep ├── 2621-sleep.js ├── NOTES.md └── README.md ├── 2622-cache-with-time-limit ├── 2622-cache-with-time-limit.js ├── NOTES.md └── README.md ├── 2623-memoize ├── 2623-memoize.js ├── NOTES.md └── README.md ├── 2625-flatten-deeply-nested-array ├── 2625-flatten-deeply-nested-array.js ├── NOTES.md └── README.md ├── 2627-debounce ├── 2627-debounce.js └── README.md ├── 2628-json-deep-equal ├── 2628-json-deep-equal.js ├── NOTES.md └── README.md ├── 2631-group-by ├── NOTES.md └── README.md ├── 2632-curry ├── 2632-curry.js └── NOTES.md ├── 2633-convert-object-to-json-string ├── 2633-convert-object-to-json-string.js ├── NOTES.md └── README.md ├── 2634-filter-elements-from-array ├── 2634-filter-elements-from-array.js ├── 2634-filter-elements-from-array.ts ├── NOTES.md └── README.md ├── 2635-apply-transform-over-each-element-in-array ├── 2635-apply-transform-over-each-element-in-array.js ├── 2635-apply-transform-over-each-element-in-array.ts ├── NOTES.md └── README.md ├── 2636-promise-pool └── README.md ├── 2637-promise-time-limit ├── 2637-promise-time-limit.js ├── NOTES.md └── README.md ├── 2642-design-graph-with-shortest-path-calculator ├── 2642-design-graph-with-shortest-path-calculator.cpp ├── NOTES.md └── README.md ├── 2648-generate-fibonacci-sequence ├── 2648-generate-fibonacci-sequence.js └── README.md ├── 2649-nested-array-generator ├── 2649-nested-array-generator.js ├── NOTES.md └── README.md ├── 2661-first-completely-painted-row-or-column ├── 2661-first-completely-painted-row-or-column.cpp ├── NOTES.md └── README.md ├── 2665-counter-ii ├── 2665-counter-ii.js └── README.md ├── 2666-allow-one-function-call ├── 2666-allow-one-function-call.js ├── 2666-allow-one-function-call.ts ├── NOTES.md └── README.md ├── 2667-create-hello-world-function ├── 2667-create-hello-world-function.js └── README.md ├── 2672-number-of-adjacent-elements-with-the-same-color ├── 2672-number-of-adjacent-elements-with-the-same-color.cpp └── README.md ├── 2675-array-of-objects-to-matrix ├── 2675-array-of-objects-to-matrix.js ├── NOTES.md └── README.md ├── 2676-throttle ├── 2676-throttle.js ├── NOTES.md └── README.md ├── 2677-chunk-array ├── 2677-chunk-array.js ├── NOTES.md └── README.md ├── 2678-number-of-senior-citizens ├── 2678-number-of-senior-citizens.cpp └── README.md ├── 2680-maximum-or ├── 2680-maximum-or.cpp ├── NOTES.md └── README.md ├── 2693-call-function-with-custom-context ├── 2693-call-function-with-custom-context.js └── README.md ├── 2695-array-wrapper ├── NOTES.md └── README.md ├── 2698-find-the-punishment-number-of-an-integer ├── 2698-find-the-punishment-number-of-an-integer.cpp ├── NOTES.md └── README.md ├── 2700-differences-between-two-objects └── README.md ├── 2706-buy-two-chocolates ├── 2706-buy-two-chocolates.cpp ├── NOTES.md └── README.md ├── 2707-extra-characters-in-a-string ├── 2707-extra-characters-in-a-string.cpp └── README.md ├── 2709-greatest-common-divisor-traversal ├── 2709-greatest-common-divisor-traversal.cpp ├── NOTES.md └── README.md ├── 2741-special-permutations ├── 2741-special-permutations.cpp ├── NOTES.md └── README.md ├── 2742-painting-the-walls ├── 2742-painting-the-walls.cpp ├── NOTES.md └── README.md ├── 2785-sort-vowels-in-a-string ├── NOTES.md └── README.md ├── 2811-check-if-it-is-possible-to-split-array ├── 2811-check-if-it-is-possible-to-split-array.cpp ├── NOTES.md └── README.md ├── 2812-find-the-safest-path-in-a-grid ├── 2812-find-the-safest-path-in-a-grid.cpp ├── NOTES.md └── README.md ├── 2816-double-a-number-represented-as-a-linked-list ├── 2816-double-a-number-represented-as-a-linked-list.cpp ├── NOTES.md └── README.md ├── 2833-furthest-point-from-origin ├── 2833-furthest-point-from-origin.cpp └── NOTES.md ├── 2842-count-k-subsequences-of-a-string-with-maximum-beauty ├── 2842-count-k-subsequences-of-a-string-with-maximum-beauty.cpp └── README.md ├── 2845-count-of-interesting-subarrays ├── 2845-count-of-interesting-subarrays.cpp └── README.md ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time.cpp ├── NOTES.md └── README.md ├── 2864-maximum-odd-binary-number ├── 2864-maximum-odd-binary-number.cpp ├── NOTES.md └── README.md ├── 2870-minimum-number-of-operations-to-make-array-empty ├── 2870-minimum-number-of-operations-to-make-array-empty.cpp └── README.md ├── 2919-minimum-increment-operations-to-make-array-beautiful └── README.md ├── 2949-count-beautiful-substrings-ii ├── 2949-count-beautiful-substrings-ii.cpp └── NOTES.md ├── 2958-length-of-longest-subarray-with-at-most-k-frequency ├── 2958-length-of-longest-subarray-with-at-most-k-frequency.cpp ├── NOTES.md └── README.md ├── 2962-count-subarrays-where-max-element-appears-at-least-k-times ├── 2962-count-subarrays-where-max-element-appears-at-least-k-times.cpp ├── NOTES.md └── README.md ├── 2963-count-the-number-of-good-partitions ├── 2963-count-the-number-of-good-partitions.cpp ├── NOTES.md └── README.md ├── 2966-divide-array-into-arrays-with-max-difference ├── 2966-divide-array-into-arrays-with-max-difference.cpp ├── NOTES.md └── README.md ├── 2971-find-polygon-with-the-largest-perimeter ├── 2971-find-polygon-with-the-largest-perimeter.cpp ├── NOTES.md └── README.md ├── 2976-minimum-cost-to-convert-string-i ├── 2976-minimum-cost-to-convert-string-i.cpp └── README.md ├── 2982-find-longest-special-substring-that-occurs-thrice-ii ├── 2982-find-longest-special-substring-that-occurs-thrice-ii.cpp └── README.md ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k.cpp ├── NOTES.md └── README.md ├── 3005-count-elements-with-maximum-frequency ├── 3005-count-elements-with-maximum-frequency.cpp └── README.md ├── 3035-maximum-palindromes-after-operations ├── 3035-maximum-palindromes-after-operations.cpp ├── NOTES.md └── README.md ├── 3068-find-the-maximum-sum-of-node-values ├── 3068-find-the-maximum-sum-of-node-values.cpp ├── NOTES.md └── README.md ├── 3075-maximize-happiness-of-selected-children ├── 3075-maximize-happiness-of-selected-children.cpp └── README.md ├── 3093-longest-common-suffix-queries ├── 3093-longest-common-suffix-queries.cpp └── README.md ├── 3108-minimum-cost-walk-in-weighted-graph ├── 3108-minimum-cost-walk-in-weighted-graph.cpp └── README.md ├── 3110-score-of-a-string ├── 3110-score-of-a-string.cpp └── README.md ├── 3137-minimum-number-of-operations-to-make-word-k-periodic ├── 3137-minimum-number-of-operations-to-make-word-k-periodic.cpp ├── NOTES.md └── README.md ├── 3138-minimum-length-of-anagram-concatenation ├── 3138-minimum-length-of-anagram-concatenation.cpp ├── NOTES.md └── README.md ├── 3139-minimum-cost-to-equalize-array ├── 3139-minimum-cost-to-equalize-array.cpp └── NOTES.md ├── 3154-find-number-of-ways-to-reach-the-k-th-stair ├── 3154-find-number-of-ways-to-reach-the-k-th-stair.cpp └── README.md ├── 3164-find-the-number-of-good-pairs-ii ├── 3164-find-the-number-of-good-pairs-ii.cpp └── README.md ├── 3169-count-days-without-meetings ├── 3169-count-days-without-meetings.cpp ├── NOTES.md └── README.md ├── 3171-find-subarray-with-bitwise-and-closest-to-k ├── 3171-find-subarray-with-bitwise-and-closest-to-k.cpp └── README.md ├── 3186-maximum-total-damage-with-spell-casting ├── 3186-maximum-total-damage-with-spell-casting.cpp ├── NOTES.md └── README.md ├── 3187-peaks-in-array ├── 3187-peaks-in-array.cpp └── README.md ├── 3202-find-the-maximum-length-of-valid-subsequence-ii ├── 3202-find-the-maximum-length-of-valid-subsequence-ii.cpp ├── NOTES.md └── README.md ├── 3203-find-minimum-diameter-after-merging-two-trees ├── 3203-find-minimum-diameter-after-merging-two-trees.cpp └── README.md ├── 3224-minimum-array-changes-to-make-differences-equal ├── 3224-minimum-array-changes-to-make-differences-equal.cpp └── README.md ├── 6911-continuous-subarrays ├── 6911-continuous-subarrays.cpp ├── NOTES.md └── README.md ├── BFS of graph - GFG └── README.md ├── Boolean Matrix - GFG ├── README.md └── boolean-matrix.cpp ├── Boundary traversal of matrix - GFG ├── README.md └── boundary-traversal-of-matrix.cpp ├── Check for Balanced Tree - GFG ├── README.md └── check-for-balanced-tree.cpp ├── Check if Tree is Isomorphic - GFG ├── README.md └── check-if-tree-is-isomorphic.cpp ├── Check whether K-th bit is set or not - GFG ├── README.md └── check-whether-kth-bit-is-set-or-not.cpp ├── Chocolate Distribution Problem - GFG ├── README.md └── chocolate-distribution-problem.cpp ├── Coin Change - GFG ├── README.md └── coin-change.cpp ├── Column name from a given column number - GFG ├── README.md └── column-name-from-a-given-column-number.cpp ├── DFS of Graph - GFG ├── README.md └── dfs-of-graph.java ├── Delete a Node in Single Linked List - GFG ├── README.md └── delete-a-node-in-single-linked-list.cpp ├── Equilibrium Point - GFG ├── README.md └── equilibrium-point.java ├── Eventual Safe States - GFG ├── README.md └── eventual-safe-states.cpp ├── Find Common Nodes in two BSTs - GFG ├── README.md └── find-common-nodes-in-two-bsts.cpp ├── Find duplicates in an array - GFG ├── README.md └── find-duplicates-in-an-array.java ├── Find first set bit - GFG └── find-first-set-bit.cpp ├── Find kth element of spiral matrix - GFG ├── README.md └── find-kth-element-of-spiral-matrix.java ├── Find triplets with zero sum - GFG ├── README.md └── find-triplets-with-zero-sum.java ├── First and last occurrences of x - GFG ├── README.md └── first-and-last-occurrences-of-x.cpp ├── First non-repeating character in a stream - GFG ├── README.md └── first-nonrepeating-character-in-a-stream.cpp ├── Flip Bits - GFG ├── README.md └── flip-bits.cpp ├── Form a number divisible by 3 using array digits - GFG ├── README.md └── form-a-number-divisible-by-3-using-array-digits.cpp ├── Fraction pairs with sum 1 - GFG ├── README.md └── fraction-pairs-with-sum-1.cpp ├── Height of Binary Tree - GFG ├── README.md └── height-of-binary-tree.cpp ├── Implement two stacks in an array - GFG ├── README.md ├── implement-two-stacks-in-an-array.cpp └── implement-two-stacks-in-an-array.java ├── Insert in a Sorted List - GFG ├── README.md └── insert-in-a-sorted-list.cpp ├── Knapsack with Duplicate Items - GFG ├── README.md └── knapsack-with-duplicate-items.cpp ├── Kth Ancestor in a Tree - GFG ├── README.md └── kth-ancestor-in-a-tree.cpp ├── Largest number possible - GFG ├── README.md └── largest-number-possible.cpp ├── Largest prime factor - GFG ├── README.md └── largest-prime-factor.cpp ├── Leaders in an array - GFG ├── README.md └── leaders-in-an-array.cpp ├── Leaf under budget - GFG ├── README.md └── leaf-under-budget.cpp ├── Leftmost and rightmost nodes of binary tree - GFG ├── README.md └── leftmost-and-rightmost-nodes-of-binary-tree.cpp ├── Level order traversal in spiral form - GFG ├── README.md └── level-order-traversal-in-spiral-form.java ├── Longest Common Subsequence - GFG ├── README.md └── longest-common-subsequence.cpp ├── Longest K unique characters substring - GFG ├── README.md └── longest-k-unique-characters-substring.cpp ├── Longest Palindromic Subsequence - GFG ├── README.md └── longest-palindromic-subsequence.java ├── Longest Repeating Subsequence - GFG ├── README.md └── longest-repeating-subsequence.cpp ├── Lowest Common Ancestor in a BST - GFG ├── README.md └── lowest-common-ancestor-in-a-bst.cpp ├── Maximum Sum Combination - GFG ├── README.md └── maximum-sum-combination.cpp ├── Maximum product subset of an array - GFG ├── README.md └── maximum-product-subset-of-an-array.cpp ├── Minimum Deletions - GFG ├── README.md └── minimum-deletions.cpp ├── Minimum Operations - GFG ├── README.md └── minimum-operations.cpp ├── Mother Vertex - GFG ├── README.md └── mother-vertex.cpp ├── Next Smallest Palindrome - GFG ├── README.md └── next-smallest-palindrome.cpp ├── Non Repeating Character - GFG ├── README.md └── non-repeating-character.cpp ├── Non Repeating Numbers - GFG ├── README.md └── non-repeating-numbers.cpp ├── Normal BST to Balanced BST - GFG ├── README.md └── normal-bst-to-balanced-bst.cpp ├── Nth Fibonacci Number - GFG ├── README.md └── nth-fibonacci-number.cpp ├── Number Of Enclaves - GFG ├── README.md └── number-of-enclaves.cpp ├── Number of paths - GFG ├── README.md └── number-of-paths.cpp ├── Pairwise swap elements of a linked list - GFG ├── README.md └── pairwise-swap-elements-of-a-linked-list.cpp ├── Palindrome String - GFG ├── README.md └── palindrome-string.cpp ├── Partition Equal Subset Sum - GFG ├── README.md └── partition-equal-subset-sum.cpp ├── Perfect Numbers - GFG ├── README.md └── perfect-numbers.cpp ├── Perfect Sum Problem - GFG ├── README.md └── perfect-sum-problem.cpp ├── Power Of Numbers - GFG ├── README.md └── power-of-numbers.java ├── Power of 2 - GFG ├── README.md └── power-of-2.cpp ├── Print adjacency list - GFG ├── README.md └── print-adjacency-list.cpp ├── Print first n Fibonacci Numbers - GFG ├── README.md └── print-first-n-fibonacci-numbers.cpp ├── Queue Reversal - GFG ├── README.md └── queue-reversal.cpp ├── README.md ├── Remove duplicate element from sorted Linked List - GFG ├── README.md └── remove-duplicate-element-from-sorted-linked-list.cpp ├── Reverse a Stack - GFG ├── README.md └── reverse-a-stack.cpp ├── Reverse alternate nodes in Link List - GFG ├── README.md └── reverse-alternate-nodes-in-link-list.cpp ├── Right View of Binary Tree - GFG ├── README.md └── right-view-of-binary-tree.cpp ├── Shortest Source to Destination Path - GFG ├── README.md ├── shortest-source-to-destination-path.cpp └── shortest-source-to-destination-path.java ├── Shortest path in Directed Acyclic Graph - GFG ├── README.md └── shortest-path-in-directed-acyclic-graph.cpp ├── Solve the Sudoku - GFG ├── README.md └── solve-the-sudoku.cpp ├── Sort an array of 0s, 1s and 2s - GFG ├── README.md └── sort-an-array-of-0s-1s-and-2s.java ├── String Permutations - GFG ├── README.md └── string-permutations.cpp ├── Strongly connected component (Tarjans's Algo) - GFG ├── README.md └── strongly-connected-component-tarjanss-algo.cpp ├── Subarray with given sum - GFG ├── README.md └── subarray-with-given-sum.cpp ├── Sum of all divisors from 1 to n - GFG ├── README.md └── sum-of-all-divisors-from-1-to-n.cpp ├── Surround the 1's - GFG ├── README.md └── surround-the-1s.cpp ├── Transitive closure of a Graph - GFG ├── README.md └── transitive-closure-of-a-graph.cpp ├── Unique Number of Occurrences - GFG ├── README.md └── unique-number-of-occurrences.java └── Wave Array - GFG ├── README.md └── wave-array.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | *.exe 2 | *.json 3 | .vscode 4 | *.bin 5 | *.cph -------------------------------------------------------------------------------- /0001-two-sum/0001-two-sum.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | vector twoSum(vector& nums, int target) { 4 | 5 | int n = nums.size(); 6 | 7 | unordered_map mp; 8 | 9 | for(int i = 0; i < n; ++i) 10 | { 11 | if(mp.find(target - nums[i]) != mp.end()) 12 | { 13 | return {i, mp[target - nums[i]]}; 14 | } 15 | mp[nums[i]] = i; 16 | } 17 | 18 | return {}; 19 | 20 | } 21 | }; -------------------------------------------------------------------------------- /0001-two-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0005-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0009-palindrome-number/0009-palindrome-number.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool isPalindrome(int x) { 4 | 5 | if(x < 0 or (x % 10 == 0 and x != 0)) 6 | return false; 7 | 8 | int rev = 0; 9 | 10 | while(rev < x) 11 | { 12 | rev = (rev * 10) + (x%10); 13 | x /= 10; 14 | } 15 | 16 | return (rev == x or rev/10 == x); 17 | } 18 | }; -------------------------------------------------------------------------------- /0009-palindrome-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0011-container-with-most-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0015-3sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0017-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0018-4sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0019-remove-nth-node-from-end-of-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0020-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0021-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0023-merge-k-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0025-reverse-nodes-in-k-group/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0026-remove-duplicates-from-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0026. Remove Duplicates from Sorted Array.cpp: -------------------------------------------------------------------------------- 1 | 26. Remove Duplicates from Sorted Array 2 | 3 | class Solution { 4 | public: 5 | int removeDuplicates(vector& nums) { 6 | int n = nums.size(); 7 | if(n==0 || n==1){ 8 | return n; 9 | } 10 | int j = 0; 11 | for(int i=1; i& nums, int val) { 6 | int ind = 0; 7 | 8 | for(int i = 0; i &nums) 7 | { 8 | 9 | next_permutation(nums.begin(), nums.end()); 10 | } 11 | }; -------------------------------------------------------------------------------- /0033-search-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0042-trapping-rain-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0044-wildcard-matching/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0046-permutations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0047. Permutations II.cpp: -------------------------------------------------------------------------------- 1 | // 47.✅ Permutations II 2 | 3 | class Solution 4 | { 5 | public: 6 | vector> permuteUnique(vector &nums) 7 | { 8 | 9 | vector> v; 10 | sort(nums.begin(), nums.end()); 11 | 12 | do 13 | { 14 | v.push_back(nums); 15 | } while (next_permutation(nums.begin(), nums.end())); 16 | 17 | return v; 18 | } 19 | }; -------------------------------------------------------------------------------- /0048-rotate-image/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0049-group-anagrams/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0050-powx-n/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0050. Pow(x, n).cpp: -------------------------------------------------------------------------------- 1 | // 50. Pow(x, n) 2 | 3 | class Solution { 4 | double pow(double x, long n) 5 | { 6 | if(n == 0) 7 | return 1; 8 | if(n == 1) 9 | return x; 10 | if(n<0) 11 | return pow(1/x,-n); 12 | 13 | double result = pow(x*x,n/2); 14 | if(n%2 != 0) 15 | result *= x; 16 | 17 | return result; 18 | } 19 | 20 | public: 21 | double myPow(double x, int n) { 22 | return pow(x,n); 23 | } 24 | }; -------------------------------------------------------------------------------- /0053-maximum-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0053. Maximum Subarray.cpp: -------------------------------------------------------------------------------- 1 | 53. Maximum Subarray53. 2 | 3 | class Solution { 4 | public: 5 | int maxSubArray(vector& nums) { 6 | int sum = nums[0]; 7 | int max_s = nums[0]; 8 | for(int i = 1 ; i < nums.size();i++) 9 | { 10 | sum = max(nums[i], sum+nums[i]); 11 | 12 | if(sum>max_s) 13 | { 14 | max_s = sum; 15 | } 16 | } 17 | return max_s; 18 | } 19 | }; -------------------------------------------------------------------------------- /0054-spiral-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0055-jump-game/0055-jump-game.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool canJump(vector& nums) { 4 | 5 | int n = nums.size(); 6 | int reachable = 0; 7 | 8 | for(int i =0 ; i& nums) { 4 | int n = nums.size(); 5 | int index = n-1; 6 | for(int i = n-1 ; i >= 0; --i) 7 | { 8 | if(nums[i] + i >= index) 9 | index = i; 10 | } 11 | return (index == 0) ? 1 : 0; 12 | } 13 | }; -------------------------------------------------------------------------------- /0057-insert-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0058-length-of-last-word/0058-length-of-last-word.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int lengthOfLastWord(string s) { 4 | 5 | int i = s.size()-1; 6 | int len = 0; 7 | 8 | while(i >= 0 and s[i] == ' ') 9 | --i; 10 | 11 | while(i >= 0 and s[i] != ' ') 12 | ++len, --i; 13 | 14 | return len; 15 | 16 | } 17 | }; -------------------------------------------------------------------------------- /0058-length-of-last-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0058. Length of Last Word.cpp: -------------------------------------------------------------------------------- 1 | // 58.✅ Length of Last Word 2 | 3 | class Solution { 4 | public: 5 | int lengthOfLastWord(string s) { 6 | int cnt = 0; 7 | for(int i= s.length()-1; i>=0; i--) 8 | { 9 | if(s[i] == ' ' && cnt > 0) 10 | break; 11 | if(s[i] != ' ') 12 | cnt++; 13 | 14 | } 15 | 16 | return cnt; 17 | } 18 | }; 19 | 20 | -------------------------------------------------------------------------------- /0060. Permutation Sequence.cpp: -------------------------------------------------------------------------------- 1 | // 60.✅ Permutation Sequence 2 | 3 | class Solution 4 | { 5 | public: 6 | string getPermutation(int n, int k) 7 | { 8 | int num = 0; 9 | 10 | for (int i = 1; i <= n; ++i) 11 | num = num * 10 + i; 12 | 13 | string s = to_string(num); 14 | 15 | k--; 16 | while (k--) 17 | { 18 | next_permutation(s.begin(), s.end()); 19 | } 20 | 21 | return s; 22 | } 23 | }; -------------------------------------------------------------------------------- /0062-unique-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0062. Unique Paths.cpp: -------------------------------------------------------------------------------- 1 | // 62.✅ Unique Paths 2 | 3 | class Solution 4 | { 5 | public: 6 | int uniquePaths(int m, int n) 7 | { 8 | int t[m][n]; 9 | 10 | for (int i = 0; i < m; ++i) 11 | { 12 | for (int j = 0; j < n; ++j) 13 | { 14 | if (i == 0 || j == 0) 15 | t[i][j] = 1; 16 | else 17 | t[i][j] = t[i - 1][j] + t[i][j - 1]; 18 | } 19 | } 20 | return t[m - 1][n - 1]; 21 | } 22 | }; -------------------------------------------------------------------------------- /0063-unique-paths-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0066. Plus One.cpp: -------------------------------------------------------------------------------- 1 | 66. Plus One 2 | 3 | class Solution { 4 | public: 5 | vector plusOne(vector& digits) { 6 | int n = digits.size() - 1; 7 | for ( int i = n; i >= 0; i--) 8 | { 9 | if(digits[i] < 9) 10 | { 11 | digits[i]++; 12 | return digits; 13 | } 14 | digits[i] = 0; 15 | 16 | } 17 | digits[0] = 1; 18 | digits.push_back(0); 19 | return digits; 20 | 21 | } 22 | }; -------------------------------------------------------------------------------- /0067-add-binary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0069-sqrtx/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0070-climbing-stairs/0070-climbing-stairs.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int climbStairs(int n) { 4 | 5 | if(n == 1) 6 | return 1; 7 | 8 | int prev2 = 1, prev = 1, res = 1; 9 | 10 | for(int i = 2; i <= n; ++i) 11 | { 12 | res = prev2 + prev; 13 | prev = prev2; 14 | prev2 = res; 15 | } 16 | 17 | return res; 18 | } 19 | }; -------------------------------------------------------------------------------- /0070. Climbing Stairs.cpp: -------------------------------------------------------------------------------- 1 | 70. Climbing Stairs 2 | 3 | 4 | class Solution { 5 | public: 6 | int climbStairs(int n) { 7 | long long int arr[50]; 8 | arr[0] = 0; 9 | arr[1] = 1; 10 | arr[2] = 2; 11 | 12 | for( int i = 3; i<50; i++) 13 | { 14 | arr[i] = arr[i-1] + arr[i-2]; 15 | } 16 | return arr[n]; 17 | } 18 | }; -------------------------------------------------------------------------------- /0072-edit-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0073-set-matrix-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0074-search-a-2d-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0075-sort-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0077-combinations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0078-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0079-word-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0080. Remove Duplicates from Sorted Array II.cpp: -------------------------------------------------------------------------------- 1 | // 80.✅ Remove Duplicates from Sorted Array II 2 | 3 | class Solution 4 | { 5 | public: 6 | int removeDuplicates(vector &nums) 7 | { 8 | if (nums.size() < 3) 9 | return nums.size(); 10 | int j = 2; 11 | for (int i = 2; i < nums.size(); i++) 12 | { 13 | if (nums[i] != nums[j - 2]) 14 | { 15 | nums[j++] = nums[i]; 16 | } 17 | } 18 | return j; 19 | } 20 | }; -------------------------------------------------------------------------------- /0081-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0084-largest-rectangle-in-histogram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0085-maximal-rectangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0086-partition-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0087-scramble-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0088-merge-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0088. Merge Sorted Array.cpp: -------------------------------------------------------------------------------- 1 | 88. Merge Sorted Array 2 | 3 | class Solution { 4 | public: 5 | void merge(vector& nums1, int m, vector& nums2, int n) { 6 | int j = 0; 7 | 8 | for(int i = m; i& ans) 6 | { 7 | if(root == NULL) 8 | return; 9 | help(root->left,ans); 10 | ans.push_back(root->val); 11 | help(root->right,ans); 12 | } 13 | 14 | vector inorderTraversal(TreeNode* root) { 15 | vector ans; 16 | help(root,ans); 17 | 18 | return ans; 19 | } 20 | }; -------------------------------------------------------------------------------- /0095-unique-binary-search-trees-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0096-unique-binary-search-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0097-interleaving-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0100-same-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0100. Same Tree.cpp: -------------------------------------------------------------------------------- 1 | 100. Same Tree 2 | 3 | class Solution { 4 | public: 5 | bool isSameTree(TreeNode* p, TreeNode* q) { 6 | if(!p && !q) 7 | return true; 8 | 9 | if(!p || !q) 10 | return false; 11 | 12 | if(p->val != q->val) 13 | return false; 14 | 15 | return isSameTree(p->left , q ->left) && isSameTree(p->right,q->right); 16 | } 17 | }; -------------------------------------------------------------------------------- /0101-symmetric-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0104-maximum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0104. Maximum Depth of Binary Tree.cpp: -------------------------------------------------------------------------------- 1 | 104. Maximum Depth of Binary Tree 2 | 3 | class Solution { 4 | public: 5 | int maxDepth(TreeNode* root) { 6 | if(root == NULL) 7 | return 0; 8 | return 1 + max(maxDepth(root->left),maxDepth(root->right)); 9 | } 10 | }; -------------------------------------------------------------------------------- /0110-balanced-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int height(TreeNode* root) 4 | { 5 | if(!root) 6 | return 0; 7 | return 1 + max(height(root->left),height(root->right)); 8 | } 9 | bool isBalanced(TreeNode* root) { 10 | if(!root) 11 | return true; 12 | int left = height(root->left); 13 | int right = height(root->right); 14 | return abs(left - right) <= 1 and isBalanced(root->left) && isBalanced(root->right); 15 | } 16 | }; -------------------------------------------------------------------------------- /0111. Minimum Depth of Binary Tree.cpp: -------------------------------------------------------------------------------- 1 | // 111.✅ Minimum Depth of Binary Tree 2 | 3 | class Solution 4 | { 5 | public: 6 | int minDepth(TreeNode *root) 7 | { 8 | if (!root) 9 | return 0; 10 | if (!root->left) 11 | return 1 + minDepth(root->right); 12 | if (!root->right) 13 | return 1 + minDepth(root->left); 14 | return 1 + min(minDepth(root->left), minDepth(root->right)); 15 | } 16 | }; 17 | -------------------------------------------------------------------------------- /0112-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0115-distinct-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0118-pascals-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0118. Pascal's Triangle.cpp: -------------------------------------------------------------------------------- 1 | // 118.✅ Pascal's Triangle 2 | 3 | class Solution 4 | { 5 | public: 6 | vector> ans; 7 | vector> generate(int numRows) 8 | { 9 | for (int i = 0; i < numRows; ++i) 10 | { 11 | vector row(i + 1, 1); 12 | for (int j = 1; j < i; ++j) 13 | row[j] = ans[i - 1][j] + ans[i - 1][j - 1]; 14 | ans.push_back(row); 15 | } 16 | return ans; 17 | } 18 | }; 19 | -------------------------------------------------------------------------------- /0119-pascals-triangle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0119. Pascal's Triangle II.cpp: -------------------------------------------------------------------------------- 1 | // 119.✅ Pascal's Triangle II 2 | 3 | class Solution 4 | { 5 | public: 6 | vector getRow(int rowIndex) 7 | { 8 | vector res(rowIndex + 1, 1); 9 | 10 | for (int i = 0; i < rowIndex; ++i) 11 | { 12 | for (int j = i; j > 0; --j) 13 | res[j] += res[j - 1]; 14 | } 15 | return res; 16 | } 17 | }; -------------------------------------------------------------------------------- /0121-best-time-to-buy-and-sell-stock/0121-best-time-to-buy-and-sell-stock.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maxProfit(vector& prices) { 4 | 5 | int minPrice = INT_MAX, n = prices.size(); 6 | 7 | int ans = 0; 8 | 9 | for(int i = 0; i < n; ++i) 10 | { 11 | minPrice = min(minPrice, prices[i]); 12 | ans = max(ans, prices[i] - minPrice); 13 | } 14 | 15 | return ans; 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /0121-best-time-to-buy-and-sell-stock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0122-best-time-to-buy-and-sell-stock-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0122. Best Time to Buy and Sell Stock II.cpp: -------------------------------------------------------------------------------- 1 | // 122.✅ Best Time to Buy and Sell Stock II 2 | 3 | class Solution 4 | { 5 | public: 6 | int maxProfit(vector &prices) 7 | { 8 | int n = prices.size(); 9 | 10 | if (n == 0 || n == 1) 11 | return 0; 12 | 13 | vector t(n, 0); 14 | t[0] = 0; 15 | 16 | for (int i = 1; i < prices.size(); i++) 17 | { 18 | t[i] = max(t[i - 1], t[i - 1] + (prices[i] - prices[i - 1])); 19 | } 20 | return t[n - 1]; 21 | } 22 | }; -------------------------------------------------------------------------------- /0123-best-time-to-buy-and-sell-stock-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0124-binary-tree-maximum-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0129-sum-root-to-leaf-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0131-palindrome-partitioning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0132-palindrome-partitioning-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0133-clone-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0135-candy/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0136. Single Number.cpp: -------------------------------------------------------------------------------- 1 | //✅ 136. Single Number 2 | 3 | class Solution { 4 | public: 5 | int singleNumber(vector& nums) { 6 | sort(nums.begin(),nums.end()); 7 | for(int i = 0; i& nums) { 4 | 5 | int ones = 0, twos = 0; 6 | 7 | for(auto itr : nums) 8 | { 9 | ones = (ones ^ itr) & (~twos); 10 | twos = (twos ^ itr) & (~ones); 11 | } 12 | 13 | return ones; 14 | 15 | } 16 | }; -------------------------------------------------------------------------------- /0137-single-number-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0137. Single Number II.cpp: -------------------------------------------------------------------------------- 1 | // 137.✅ Single Number II 2 | 3 | class Solution 4 | { 5 | public: 6 | int singleNumber(vector &nums) 7 | { 8 | map m; 9 | 10 | for (int i = 0; i < nums.size(); ++i) 11 | { 12 | ++m[nums[i]]; 13 | } 14 | 15 | for (auto i : m) 16 | { 17 | if (i.second == 1) 18 | return i.first; 19 | } 20 | 21 | return -1; 22 | } 23 | }; -------------------------------------------------------------------------------- /0138-copy-list-with-random-pointer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0139-word-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0141-linked-list-cycle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0142-linked-list-cycle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0144 leetcode preorder traversal.cpp: -------------------------------------------------------------------------------- 1 | // 144 leetcode preorder traversal 2 | 3 | class Solution { 4 | public: 5 | void help(TreeNode *root, vector & ans) 6 | { 7 | if(root == NULL) 8 | return ; 9 | ans.push_back(root->val); 10 | help(root->left,ans); 11 | help(root->right,ans); 12 | } 13 | 14 | vector preorderTraversal(TreeNode* root) { 15 | vector ans; 16 | help(root, ans); 17 | return ans; 18 | 19 | } 20 | }; -------------------------------------------------------------------------------- /0144-binary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0145-binary-tree-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0146-lru-cache/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0150-evaluate-reverse-polish-notation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0152-maximum-product-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0162-find-peak-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0168-excel-sheet-column-title/0168-excel-sheet-column-title.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string convertToTitle(int columnNumber) { 4 | 5 | string str; 6 | 7 | while(columnNumber > 0) 8 | { 9 | char last = 'A' + (columnNumber - 1) % 26; 10 | 11 | str = last + str; 12 | 13 | columnNumber = (columnNumber - 1) / 26; 14 | } 15 | 16 | return str; 17 | 18 | } 19 | }; -------------------------------------------------------------------------------- /0168-excel-sheet-column-title/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0168. Excel Sheet Column Title.cpp: -------------------------------------------------------------------------------- 1 | //✅ 168. Excel Sheet Column Title 2 | 3 | class Solution { 4 | public: 5 | string convertToTitle(int columnNumber) { 6 | string result = ""; 7 | int n = columnNumber; 8 | while(n) 9 | { 10 | char c = 'A' + (n-1)%26; 11 | result = c + result; 12 | n = (n-1)/26; 13 | } 14 | return result; 15 | } 16 | }; -------------------------------------------------------------------------------- /0169-majority-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0171. Excel Sheet Column Number.cpp: -------------------------------------------------------------------------------- 1 | //✅ 171. Excel Sheet Column Number 2 | 3 | class Solution { 4 | public: 5 | int titleToNumber(string columnTitle) { 6 | int result = 0; 7 | for(char c : columnTitle) 8 | { 9 | int d = c - 'A' + 1; 10 | result = result * 26 + d; 11 | } 12 | return result; 13 | } 14 | }; -------------------------------------------------------------------------------- /0189-rotate-array/0189-rotate-array.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | void rotate(vector& nums, int k) { 4 | 5 | int n = nums.size(); 6 | 7 | k %= n; 8 | 9 | reverse(nums.begin(), nums.begin() + (n - k)); 10 | 11 | reverse(nums.begin() + (n-k), nums.end()); 12 | 13 | reverse(nums.begin(), nums.end()); 14 | 15 | } 16 | }; -------------------------------------------------------------------------------- /0189-rotate-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0190. Reverse Bits.cpp: -------------------------------------------------------------------------------- 1 | //✅ 190. Reverse Bits 2 | 3 | class Solution { 4 | public: 5 | uint32_t reverseBits(uint32_t n) { 6 | uint32_t result = 0; 7 | for(int i = 0 ; i < 32; i++) 8 | { 9 | result <<= 1; 10 | if(n&1) 11 | result++; 12 | n >>= 1; 13 | } 14 | return result; 15 | } 16 | }; -------------------------------------------------------------------------------- /0191. Number of 1 Bits.cpp: -------------------------------------------------------------------------------- 1 | //✅ 191. Number of 1 Bits 2 | 3 | class Solution { 4 | public: 5 | int hammingWeight(uint32_t n) { 6 | uint32_t cnt = 0, mask = 1; 7 | for(int i = 0; i< 32; i++) 8 | { 9 | if(n&mask) 10 | cnt++; 11 | mask = mask << 1; 12 | } 13 | return cnt; 14 | } 15 | }; -------------------------------------------------------------------------------- /0198-house-robber/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0198. House Robber.cpp: -------------------------------------------------------------------------------- 1 | // 198.✅ House Robber 2 | 3 | class Solution 4 | { 5 | int t[105]; 6 | 7 | public: 8 | int rob(vector &nums) 9 | { 10 | int n = nums.size(); 11 | 12 | if (n == 0) 13 | return 0; 14 | 15 | t[0] = nums[0]; 16 | if (n == 1) 17 | return t[0]; 18 | 19 | t[1] = max(t[0], nums[1]); 20 | 21 | for (int i = 2; i < n; ++i) 22 | t[i] = max(t[i - 1], t[i - 2] + nums[i]); 23 | 24 | return t[n - 1]; 25 | } 26 | }; -------------------------------------------------------------------------------- /0200-number-of-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0201-bitwise-and-of-numbers-range/0201-bitwise-and-of-numbers-range.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int rangeBitwiseAnd(int left, int right) { 4 | 5 | int rightShift = 0; 6 | 7 | while(right != left) 8 | { 9 | left >>= 1; 10 | right >>= 1; 11 | ++rightShift; 12 | } 13 | 14 | return right << rightShift; 15 | 16 | } 17 | }; -------------------------------------------------------------------------------- /0201-bitwise-and-of-numbers-range/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0205-isomorphic-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0206. Reverse Linked List.cpp: -------------------------------------------------------------------------------- 1 | 206. Reverse Linked List 2 | 3 | class Solution { 4 | public: 5 | ListNode *h; 6 | void solve(ListNode *node, ListNode *prev){ 7 | if(node){ 8 | solve(node->next,node); 9 | node->next = prev; 10 | } 11 | else 12 | h = prev; 13 | } 14 | 15 | ListNode* reverseList(ListNode* head) { 16 | solve(head,NULL); 17 | return h; 18 | } 19 | }; -------------------------------------------------------------------------------- /0207-course-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0208-implement-trie-prefix-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0209-minimum-size-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0210-course-schedule-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0214-shortest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int findKthLargest(vector& nums, int k) { 4 | 5 | priority_queue pq(nums.begin(),nums.end()); 6 | 7 | while(k-- > 1) 8 | { 9 | pq.pop(); 10 | } 11 | 12 | return pq.top(); 13 | 14 | } 15 | }; -------------------------------------------------------------------------------- /0215-kth-largest-element-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0215. Kth Largest Element in an Array.cpp: -------------------------------------------------------------------------------- 1 | // ✅215. Kth Largest Element in an Array 2 | 3 | class Solution { 4 | public: 5 | int findKthLargest(vector& nums, int k) { 6 | priority_queue q; 7 | 8 | for(int i = 0; i& nums) { 6 | sort(nums.begin(),nums.end()); 7 | int l = nums.size(); 8 | for(int i = 1; iright; 9 | root->right = invertTree(root->left); 10 | root->left = invertTree(right); 11 | 12 | return root; 13 | } 14 | }; -------------------------------------------------------------------------------- /0228-summary-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0231-power-of-two/0231-power-of-two.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool isPowerOfTwo(int n) { 4 | if(n == 1) 5 | return true; 6 | if(n & 1 or n == 0) 7 | return false; 8 | return isPowerOfTwo(n/2); 9 | } 10 | }; -------------------------------------------------------------------------------- /0231-power-of-two/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0231. Power of Two.cpp: -------------------------------------------------------------------------------- 1 | 231. Power of Two 2 | 3 | class Solution { 4 | public: 5 | bool isPowerOfTwo(int n) { 6 | if(n==1 || n==2) //base case 7 | return true; 8 | 9 | if(n%2 != 0 || n==0) 10 | return false; 11 | 12 | return isPowerOfTwo(n/2); //recursive call 13 | } 14 | }; -------------------------------------------------------------------------------- /0232-implement-queue-using-stacks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0236-lowest-common-ancestor-of-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0237-delete-node-in-a-linked-list/0237-delete-node-in-a-linked-list.cpp: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for singly-linked list. 3 | * struct ListNode { 4 | * int val; 5 | * ListNode *next; 6 | * ListNode(int x) : val(x), next(NULL) {} 7 | * }; 8 | */ 9 | class Solution { 10 | public: 11 | void deleteNode(ListNode* node) { 12 | 13 | node->val = node->next->val; 14 | node->next = node->next->next; 15 | } 16 | }; -------------------------------------------------------------------------------- /0237-delete-node-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0237. Delete Node in a Linked List.cpp: -------------------------------------------------------------------------------- 1 | // 237.✅ Delete Node in a Linked List 2 | 3 | class Solution { 4 | public: 5 | void deleteNode(ListNode* node) { 6 | ListNode *temp = new ListNode; 7 | 8 | temp = node -> next; 9 | 10 | node -> val = temp -> val; 11 | 12 | node -> next = temp -> next; 13 | 14 | delete temp; 15 | } 16 | }; -------------------------------------------------------------------------------- /0239-sliding-window-maximum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0242-valid-anagram/0242-valid-anagram.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool isAnagram(string s, string t) { 4 | 5 | vector freq(26, 0); 6 | 7 | for(auto& ch : s) 8 | ++freq[ch - 'a']; 9 | 10 | for(auto& ch : t) 11 | --freq[ch - 'a']; 12 | 13 | for(int i = 0; i< 26; ++i) 14 | { 15 | if(freq[i] != 0) return false; 16 | } 17 | 18 | return true; 19 | } 20 | }; -------------------------------------------------------------------------------- /0242-valid-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0258-add-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0258. Add Digits.cpp: -------------------------------------------------------------------------------- 1 | // 258.✅ Add Digits 2 | 3 | class Solution 4 | { 5 | public: 6 | int addDigits(int num) 7 | { 8 | if (num % 9 == 0 && num != 0) 9 | return 9; 10 | return (num % 9); 11 | } 12 | }; -------------------------------------------------------------------------------- /0260. Single Number III.cpp: -------------------------------------------------------------------------------- 1 | // 260.✅ Single Number III 2 | 3 | class Solution 4 | { 5 | public: 6 | vector singleNumber(vector &nums) 7 | { 8 | map m; 9 | vector ans; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | { 13 | ++m[nums[i]]; 14 | } 15 | 16 | for (auto i : m) 17 | { 18 | if (i.second == 1) 19 | ans.push_back(i.first); 20 | } 21 | 22 | return ans; 23 | } 24 | }; -------------------------------------------------------------------------------- /0268-missing-number/0268-missing-number.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int missingNumber(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | int sum = 0; 8 | 9 | for(auto& ele : nums) 10 | sum += ele; 11 | 12 | int totSum = (n * (n+1)) / 2; 13 | 14 | return totSum - sum; 15 | 16 | } 17 | }; -------------------------------------------------------------------------------- /0268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0278. First Bad Version.cpp: -------------------------------------------------------------------------------- 1 | // 278. First Bad Version 2 | 3 | class Solution { 4 | public: 5 | int firstBadVersion(int n) { 6 | while(n--) 7 | { 8 | bool ans = isBadVersion(n); 9 | if(!ans) 10 | break; 11 | } 12 | return n+1; 13 | } 14 | }; -------------------------------------------------------------------------------- /0279-perfect-squares/NOTES.md: -------------------------------------------------------------------------------- 1 | int sq = j*j; 2 | dp[i] = min(dp[i], 1 + dp[i-sq]); 3 | } 4 | } 5 | return dp[n]; 6 | } 7 | }; 8 | ​ 9 | Legendres's Theorem 10 | ​ 11 | class Solution { 12 | public: 13 | int numSquares(int n) { 14 | if(ceil(sqrt(n)) == floor(sqrt(n))) 15 | return 1; 16 | while(n%4 == 0) 17 | n /= 4; 18 | if(n%8 == 7) 19 | return 4; 20 | for(int i = 1; i*i <= n; ++i){ 21 | int base = sqrt(n - (i*i)); 22 | if((base * base) == (n - (i*i))) 23 | return 2; 24 | } 25 | return 3; 26 | } 27 | }; 28 | ``` -------------------------------------------------------------------------------- /0283-move-zeroes/0283-move-zeroes.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | void moveZeroes(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | int start = 0; 8 | 9 | for(int i = 0; i < n; ++i) 10 | { 11 | if(nums[i] != 0) 12 | { 13 | swap(nums[i], nums[start++]); 14 | } 15 | } 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /0283-move-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0289-game-of-life/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0290-word-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0292. Nim Game.cpp: -------------------------------------------------------------------------------- 1 | // 292.✅ Nim Game 2 | 3 | class Solution 4 | { 5 | public: 6 | bool canWinNim(int n) 7 | { 8 | if (n % 4 == 0) 9 | return false; 10 | return true; 11 | } 12 | }; -------------------------------------------------------------------------------- /0300-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0307-range-sum-query-mutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0309-best-time-to-buy-and-sell-stock-with-cooldown/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0312-burst-balloons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0319-bulb-switcher/0319-bulb-switcher.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int bulbSwitch(int n) { 4 | 5 | return sqrt(n); 6 | 7 | } 8 | }; -------------------------------------------------------------------------------- /0322-coin-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0324-wiggle-sort-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0326. Power of Three.cpp: -------------------------------------------------------------------------------- 1 | 326. Power of Three 2 | 3 | class Solution { 4 | public: 5 | bool isPowerOfThree(int n) { 6 | if(n<=0) 7 | return false; 8 | if(n%3 == 0) 9 | return isPowerOfThree(n/3); 10 | if(n == 1) 11 | return true; 12 | return false; 13 | } 14 | }; -------------------------------------------------------------------------------- /0334. Increasing Triplet Subsequence.cpp: -------------------------------------------------------------------------------- 1 | // 334.✅ Increasing Triplet Subsequence 2 | 3 | class Solution { 4 | public: 5 | bool increasingTriplet(vector& nums) { 6 | int max1 = INT_MAX , max2 = INT_MAX; 7 | for(int i = 0; i countBits(int n) { 4 | 5 | vector dp(n+1, 0); 6 | 7 | dp[0] = 0; 8 | 9 | for(int i = 1; i <= n; ++i) 10 | { 11 | dp[i] = dp[i/2] + i%2; 12 | } 13 | 14 | return dp; 15 | } 16 | }; -------------------------------------------------------------------------------- /0338-counting-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0342-power-of-four/0342-power-of-four.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | 4 | bool helper(int n) 5 | { 6 | if(n <= 0) 7 | return false; 8 | 9 | if(n == 1) 10 | return true; 11 | 12 | if(n % 4 == 0) 13 | return helper(n/4); 14 | 15 | return false; 16 | } 17 | 18 | bool isPowerOfFour(int n) { 19 | return helper(n); 20 | } 21 | }; -------------------------------------------------------------------------------- /0342-power-of-four/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0342. Power of Four.cpp: -------------------------------------------------------------------------------- 1 | // 342. Power of Four 2 | 3 | class Solution 4 | { 5 | public: 6 | bool isPowerOfFour(int n) 7 | { 8 | if (n <= 0) 9 | return false; 10 | if (n % 4 == 0) 11 | return isPowerOfFour(n / 4); 12 | if (n == 1) 13 | return true; 14 | return false; 15 | } 16 | }; 17 | -------------------------------------------------------------------------------- /0343-integer-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0344-reverse-string/0344-reverse-string.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | void reverseString(vector& s) { 4 | 5 | int n = s.size(); 6 | 7 | for(int i = 0; i < n/2; ++i) 8 | swap(s[i], s[n-i-1]); 9 | 10 | } 11 | }; -------------------------------------------------------------------------------- /0344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0349-intersection-of-two-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0354-russian-doll-envelopes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0371. Sum of Two Integers.cpp: -------------------------------------------------------------------------------- 1 | // 371.✅ Sum of Two Integers 2 | 3 | class Solution 4 | { 5 | public: 6 | int getSum(int a, int b) 7 | { 8 | int sum = a; 9 | while (b != 0) 10 | { 11 | sum = a ^ b; // sum using xor 12 | b = (unsigned int)(a & b) << 1; // carry 13 | a = sum; // add sum (without carry) and carry 14 | } 15 | return sum; 16 | } 17 | }; 18 | -------------------------------------------------------------------------------- /0377-combination-sum-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0380-insert-delete-getrandom-o1/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0384-shuffle-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0387-first-unique-character-in-a-string/0387-first-unique-character-in-a-string.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int firstUniqChar(string s) { 4 | 5 | int n = s.size(); 6 | 7 | map mp; 8 | 9 | for(auto& ch : s) 10 | ++mp[ch]; 11 | 12 | for(int i = 0; i < n; ++i) 13 | { 14 | if(mp[s[i]] == 1) 15 | return i; 16 | } 17 | 18 | return -1; 19 | } 20 | }; -------------------------------------------------------------------------------- /0387-first-unique-character-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0389-find-the-difference/0389-find-the-difference.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public char findTheDifference(String s, String t) { 3 | 4 | char ch = 0; 5 | 6 | for(char c : s.toCharArray()) 7 | ch ^= c; 8 | 9 | for(char c : t.toCharArray()) 10 | ch ^= c; 11 | 12 | return ch; 13 | } 14 | } -------------------------------------------------------------------------------- /0389-find-the-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0389. Find the Difference.cpp: -------------------------------------------------------------------------------- 1 | // 389.✅ Find the Difference 2 | 3 | class Solution 4 | { 5 | public: 6 | char findTheDifference(string s, string t) 7 | { 8 | sort(s.begin(), s.end()); 9 | sort(t.begin(), t.end()); 10 | for (int i = 0; i < s.size(); ++i) 11 | { 12 | if (s[i] != t[i]) 13 | return t[i]; 14 | } 15 | return t[s.size()]; 16 | } 17 | }; 18 | -------------------------------------------------------------------------------- /0392-is-subsequence/0392-is-subsequence.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public boolean isSubsequence(String s, String t) { 3 | 4 | int k = 0; 5 | 6 | for(int i = 0; i < t.length() && k < s.length(); ++i) 7 | { 8 | if(s.charAt(k) == t.charAt(i)) 9 | ++k; 10 | } 11 | 12 | return (k == s.length()); 13 | 14 | } 15 | } -------------------------------------------------------------------------------- /0392-is-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0398. Random Pick Index.cpp: -------------------------------------------------------------------------------- 1 | // 398.✅ Random Pick Index 2 | 3 | class Solution 4 | { 5 | public: 6 | vector v; 7 | Solution(vector &nums) 8 | { 9 | v = nums; 10 | } 11 | 12 | int pick(int target) 13 | { 14 | vector ans; 15 | for (int i = 0; i < v.size(); ++i) 16 | { 17 | if (v[i] == target) 18 | ans.push_back(i); 19 | } 20 | return ans[rand() % ans.size()]; // generate a random index and return the value at that index 21 | } 22 | }; -------------------------------------------------------------------------------- /0402-remove-k-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0403-frog-jump/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0409-longest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0410-split-array-largest-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0435-non-overlapping-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0442-find-all-duplicates-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0442. Find All Duplicates in an Array.cpp: -------------------------------------------------------------------------------- 1 | // 442.✅ Find All Duplicates in an Array 2 | 3 | class Solution 4 | { 5 | public: 6 | vector findDuplicates(vector &nums) 7 | { 8 | map m; 9 | vector v; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | ++m[nums[i]]; 13 | 14 | for (auto i : m) 15 | { 16 | if (i.second > 1) 17 | v.push_back(i.first); 18 | } 19 | 20 | return v; 21 | } 22 | }; -------------------------------------------------------------------------------- /0445-add-two-numbers-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0446-arithmetic-slices-ii-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0451-sort-characters-by-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0452-minimum-number-of-arrows-to-burst-balloons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0458. Poor Pigs.cpp: -------------------------------------------------------------------------------- 1 | // 458.✅ Poor Pigs 2 | 3 | class Solution 4 | { 5 | public: 6 | int poorPigs(int buckets, int poisonTime, int totalTime) 7 | { 8 | return ceil(log(buckets) / log(totalTime / poisonTime + 1)); 9 | } 10 | }; -------------------------------------------------------------------------------- /0459-repeated-substring-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0461. Hamming Distance.cpp: -------------------------------------------------------------------------------- 1 | //✅ 461. Hamming Distance 2 | 3 | class Solution { 4 | public: 5 | int hammingDistance(int x, int y) { 6 | // cout<(5).to_string() << endl; 7 | // return bitset<32>(x^y).count(); 8 | int res = x^y; 9 | int cnt = 0; 10 | while(res > 0) 11 | { 12 | cnt += res & 1; 13 | res >>= 1; 14 | } 15 | return cnt; 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /0462-minimum-moves-to-equal-array-elements-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0462. Minimum Moves to Equal Array Elements II.cpp: -------------------------------------------------------------------------------- 1 | // 462.✅ Minimum Moves to Equal Array Elements II 2 | 3 | class Solution 4 | { 5 | public: 6 | int minMoves2(vector &nums) 7 | { 8 | int cnt = 0; 9 | sort(nums.begin(), nums.end()); 10 | 11 | int mid = (nums.size() - 1) / 2; 12 | 13 | for (int i = 0; i < nums.size(); ++i) 14 | { 15 | cnt += abs(nums[mid] - nums[i]); 16 | } 17 | 18 | return cnt; 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /0476. Number Complement.cpp: -------------------------------------------------------------------------------- 1 | 476. Number Complement 2 | 3 | class Solution { 4 | public: 5 | int findComplement(int num) { 6 | int ans = 0, i = 0; 7 | while(num) 8 | { 9 | if((num&1) == 0) 10 | ans += 1<>=1; //right shift 14 | } 15 | return ans; 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /0485. Max Consecutive Ones.cpp: -------------------------------------------------------------------------------- 1 | // 485.✅ Max Consecutive Ones 2 | 3 | class Solution { 4 | public: 5 | int findMaxConsecutiveOnes(vector& nums) { 6 | for(int i = 1; i& timeSeries, int duration) { 6 | int n = timeSeries.size(); 7 | if(n == 0) 8 | return 0; 9 | int res = duration; 10 | 11 | for(int i = 1; iright, total); 11 | total += root->val; 12 | root->val = total; 13 | helper(root->left, total); 14 | } 15 | 16 | TreeNode *convertBST(TreeNode *root) 17 | { 18 | int total = 0; 19 | helper(root, total); 20 | return root; 21 | } 22 | }; 23 | -------------------------------------------------------------------------------- /0541. Reverse String II.cpp: -------------------------------------------------------------------------------- 1 | // 541.✅ Reverse String II 2 | 3 | class Solution 4 | { 5 | public: 6 | string reverseStr(string s, int k) 7 | { 8 | for (int i = 0; i < s.size(); i += 2 * k) 9 | { 10 | if (i + k < s.size()) 11 | reverse(s.begin() + i, s.begin() + i + k); 12 | else 13 | reverse(s.begin() + i, s.end()); 14 | } 15 | return s; 16 | } 17 | }; 18 | -------------------------------------------------------------------------------- /0542-01-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0543-diameter-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0547-number-of-provinces/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0552-student-attendance-record-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0557-reverse-words-in-a-string-iii/0557-reverse-words-in-a-string-iii.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string reverseWords(string s) { 4 | 5 | stringstream ss(s); 6 | 7 | string word; 8 | 9 | string ans; 10 | 11 | while(ss >> word) 12 | { 13 | reverse(word.begin(), word.end()); 14 | ans += word + ' '; 15 | } 16 | 17 | ans.pop_back(); 18 | 19 | return ans; 20 | 21 | } 22 | }; -------------------------------------------------------------------------------- /0557-reverse-words-in-a-string-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0557. Reverse Words in a String III.cpp: -------------------------------------------------------------------------------- 1 | // 557.✅ Reverse Words in a String III 2 | 3 | class Solution 4 | { 5 | public: 6 | string reverseWords(string s) 7 | { 8 | int ind = 0; 9 | for (int i = 0; i < s.length(); ++i) 10 | { 11 | if (s[i] == ' ') 12 | { 13 | reverse(s.begin() + ind, s.begin() + i); 14 | ind = i + 1; 15 | } 16 | } 17 | reverse(s.begin() + ind, s.end()); 18 | return s; 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /0560-subarray-sum-equals-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0561. Array Partition I.cpp: -------------------------------------------------------------------------------- 1 | // 561. Array Partition I 2 | 3 | class Solution 4 | { 5 | public: 6 | int arrayPairSum(vector &nums) 7 | { 8 | 9 | int res = 0; 10 | 11 | sort(nums.begin(), nums.end()); 12 | 13 | for (int i = 0; i < nums.size(); i += 2) 14 | { 15 | res += nums[i]; 16 | } 17 | 18 | return res; 19 | } 20 | }; -------------------------------------------------------------------------------- /0564-find-the-closest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0575. Distribute Candi.cpp: -------------------------------------------------------------------------------- 1 | // 575.✅ Distribute Candi 2 | 3 | class Solution 4 | { 5 | public: 6 | int distributeCandies(vector &candyType) 7 | { 8 | set s; 9 | for (int i = 0; i < candyType.size(); ++i) 10 | s.insert(candyType[i]); 11 | 12 | return min(s.size(), candyType.size() / 2); 13 | } 14 | }; -------------------------------------------------------------------------------- /0576-out-of-boundary-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0584-find-customer-referee/0584-find-customer-referee.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | select name from Customer where referee_id is null or referee_id != 2; -------------------------------------------------------------------------------- /0584-find-customer-referee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0590-n-ary-tree-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0590. N-ary Tree Postorder Traversal.cpp: -------------------------------------------------------------------------------- 1 | // 590.✅ N-ary Tree Postorder Traversal 2 | 3 | class Solution 4 | { 5 | public: 6 | void Post(Node *root, vector &v) 7 | { 8 | if (root != NULL) 9 | { 10 | for (auto child : root->children) 11 | Post(child, v); 12 | v.push_back(root->val); 13 | } 14 | } 15 | 16 | vector postorder(Node *root) 17 | { 18 | vector v; 19 | 20 | Post(root, v); 21 | 22 | return v; 23 | } 24 | }; 25 | -------------------------------------------------------------------------------- /0595-big-countries/0595-big-countries.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | select name, population, area from World where area >= 3000000 or population >= 25000000 order by name asc; -------------------------------------------------------------------------------- /0595-big-countries/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0606-construct-string-from-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0628-maximum-product-of-three-numbers/0628-maximum-product-of-three-numbers.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maximumProduct(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | sort(nums.begin(), nums.end()); 8 | 9 | return max({nums[0] * nums[1] * nums[2], nums[0] * nums[1] * nums[n-1], nums[n-3] * nums[n-2] * nums[n-1]}); 10 | 11 | } 12 | }; -------------------------------------------------------------------------------- /0628-maximum-product-of-three-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0628. Maximum Product of Three Numbers.cpp: -------------------------------------------------------------------------------- 1 | // 628.✅ Maximum Product of Three Numbers 2 | 3 | class Solution { 4 | public: 5 | int maximumProduct(vector& nums) { 6 | 7 | sort(nums.begin(),nums.end()); 8 | 9 | int temp1 = nums[nums.size()-1]*nums[nums.size()-2]*nums[nums.size()-3]; 10 | int temp2 = nums[0]*nums[1]*nums[nums.size()-1]; 11 | 12 | return (temp1>temp2) ? temp1 : temp2; 13 | } 14 | }; 15 | 16 | -------------------------------------------------------------------------------- /0633-sum-of-square-numbers/0633-sum-of-square-numbers.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool judgeSquareSum(int c) { 4 | 5 | for(int i = 2; i * i <= c; ++i) 6 | { 7 | int cnt = 0; 8 | 9 | while(c % i == 0) 10 | { 11 | ++cnt; 12 | c /= i; 13 | } 14 | 15 | if(i % 4 == 3 and cnt % 2 != 0) 16 | return false; 17 | } 18 | 19 | return c%4 != 3; 20 | 21 | } 22 | }; -------------------------------------------------------------------------------- /0633-sum-of-square-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0645-set-mismatch/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0646-maximum-length-of-pair-chain/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0648-replace-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0649-dota2-senate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0650-2-keys-keyboard/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0662-maximum-width-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0664-strange-printer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0673-number-of-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0678-valid-parenthesis-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0684-redundant-connection/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0698-partition-to-k-equal-sum-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0700. Search in a Binary Search Tree.cpp: -------------------------------------------------------------------------------- 1 | // 700.✅ Search in a Binary Search Tree 2 | 3 | class Solution { 4 | public: 5 | TreeNode* searchBST(TreeNode* root, int val) { 6 | if(root == NULL) 7 | return NULL; 8 | 9 | if(root->val == val) 10 | return root; 11 | else if(root->val > val) 12 | return searchBST(root->left, val); 13 | 14 | return searchBST(root->right , val); 15 | } 16 | }; -------------------------------------------------------------------------------- /0703-kth-largest-element-in-a-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0705-design-hashset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0705. Design HashSet.cpp: -------------------------------------------------------------------------------- 1 | // 705.✅ Design HashSet 2 | 3 | class MyHashSet 4 | { 5 | public: 6 | vector ans; 7 | MyHashSet() 8 | { 9 | ans.resize(1e6 + 1, false); 10 | } 11 | 12 | void add(int key) 13 | { 14 | ans[key] = true; 15 | } 16 | 17 | void remove(int key) 18 | { 19 | ans[key] = false; 20 | } 21 | 22 | bool contains(int key) 23 | { 24 | return ans[key]; 25 | } 26 | }; -------------------------------------------------------------------------------- /0706. Design HashMap.cpp: -------------------------------------------------------------------------------- 1 | // 706.✅ Design HashMap 2 | 3 | class MyHashMap 4 | { 5 | public: 6 | int arr[1000001]; 7 | MyHashMap() 8 | { 9 | memset(arr, -1, sizeof(arr)); 10 | // fill(arr,arr + 1000000,-1 ); 11 | } 12 | 13 | void put(int key, int value) 14 | { 15 | arr[key] = value; 16 | } 17 | 18 | int get(int key) 19 | { 20 | return arr[key]; 21 | } 22 | 23 | void remove(int key) 24 | { 25 | arr[key] = -1; 26 | } 27 | }; 28 | -------------------------------------------------------------------------------- /0709. To Lower Case.cpp: -------------------------------------------------------------------------------- 1 | // 709.✅ To Lower Case 2 | 3 | class Solution 4 | { 5 | public: 6 | string toLowerCase(string s) 7 | { 8 | for (int i = 0; i < s.length(); i++) 9 | { 10 | if (s[i] >= 65 && s[i] <= 90) 11 | { 12 | s[i] = tolower(s[i]); 13 | } 14 | } 15 | 16 | return s; 17 | } 18 | }; -------------------------------------------------------------------------------- /0712-minimum-ascii-delete-sum-for-two-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0713-subarray-product-less-than-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0714-best-time-to-buy-and-sell-stock-with-transaction-fee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0719-find-k-th-smallest-pair-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0720-longest-word-in-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0721-accounts-merge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0724. Find Pivot Index.cpp: -------------------------------------------------------------------------------- 1 | // 724.✅ Find Pivot Index 2 | 3 | class Solution 4 | { 5 | public: 6 | int pivotIndex(vector &nums) 7 | { 8 | int rightSum = accumulate(nums.begin(), nums.end(), 0); 9 | int leftSum = 0; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | { 13 | rightSum -= nums[i]; 14 | if (rightSum == leftSum) 15 | return i; 16 | leftSum += nums[i]; 17 | } 18 | return -1; 19 | } 20 | }; -------------------------------------------------------------------------------- /0725-split-linked-list-in-parts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0735-asteroid-collision/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0739-daily-temperatures/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0740. Delete and Earn.cpp: -------------------------------------------------------------------------------- 1 | // 740.✅ Delete and Earn 2 | 3 | class Solution 4 | { 5 | public: 6 | int deleteAndEarn(vector &nums) 7 | { 8 | vector freq(100001, 0); 9 | vector t(100001, 0); 10 | 11 | for (auto i : nums) 12 | ++freq[i]; 13 | 14 | t[1] = freq[1]; 15 | 16 | for (int i = 2; i < 100001; ++i) 17 | { 18 | t[i] = max(t[i - 2] + i * freq[i], t[i - 1]); 19 | } 20 | 21 | return t[10000]; 22 | } 23 | }; -------------------------------------------------------------------------------- /0746-min-cost-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0746. Min Cost Climbing Stairs.cpp: -------------------------------------------------------------------------------- 1 | // 746.✅ Min Cost Climbing Stairs 2 | 3 | class Solution 4 | { 5 | public: 6 | int minCostClimbingStairs(vector &cost) 7 | { 8 | int n = cost.size(); 9 | vector t(n + 1); 10 | 11 | for (int i = 2; i <= n; ++i) 12 | { 13 | int oneStep = t[i - 1] + cost[i - 1]; 14 | int twoStep = t[i - 2] + cost[i - 2]; 15 | t[i] = min(oneStep, twoStep); 16 | } 17 | 18 | return t[n]; 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /0766. Toeplitz Matrix.cpp: -------------------------------------------------------------------------------- 1 | // 766.✅ Toeplitz Matrix 2 | 3 | class Solution 4 | { 5 | public: 6 | bool isToeplitzMatrix(vector> &matrix) 7 | { 8 | for (int i = 1; i < matrix.size(); ++i) 9 | { 10 | for (int j = 1; j < matrix[0].size(); ++j) 11 | { 12 | if (matrix[i][j] != matrix[i - 1][j - 1]) 13 | return false; 14 | } 15 | } 16 | return true; 17 | } 18 | }; -------------------------------------------------------------------------------- /0767-reorganize-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0771. Jewels and Stones.cpp: -------------------------------------------------------------------------------- 1 | // 771.✅ Jewels and Stones 2 | 3 | class Solution 4 | { 5 | public: 6 | int numJewelsInStones(string jewels, string stones) 7 | { 8 | int cnt = 0; 9 | for (int i = 0; i < stones.length(); ++i) 10 | { 11 | for (int j = 0; j < jewels.length(); ++j) 12 | { 13 | if (stones[i] == jewels[j]) 14 | cnt++; 15 | } 16 | } 17 | return cnt; 18 | } 19 | }; -------------------------------------------------------------------------------- /0783-minimum-distance-between-bst-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0785-is-graph-bipartite/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0786-k-th-smallest-prime-fraction/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0787-cheapest-flights-within-k-stops/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0791-custom-sort-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0802-find-eventual-safe-states/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0823-binary-trees-with-factors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0826-most-profit-assigning-work/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0827-making-a-large-island/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0834-sum-of-distances-in-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0836. Rectangle Overlap.cpp: -------------------------------------------------------------------------------- 1 | 836. Rectangle Overlap 2 | 3 | class Solution { 4 | public: 5 | bool isRectangleOverlap(vector& rec1, vector& rec2) { 6 | // rec[1] must be either left or top or right or left return false 7 | 8 | if(rec1[2] <= rec2[0] || rec1[1] >= rec2[3] || rec1[0] >= rec2[2] || rec1[3] <= rec2[1]) 9 | return false; 10 | return true; 11 | } 12 | }; -------------------------------------------------------------------------------- /0839-similar-string-groups/NOTES.md: -------------------------------------------------------------------------------- 1 | function isSimilar = [&](string a, string b) 2 | { 3 | }; 4 | ​ -------------------------------------------------------------------------------- /0840-magic-squares-in-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0841-keys-and-rooms/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0846-hand-of-straights/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0848. Shifting Letters.cpp: -------------------------------------------------------------------------------- 1 | // 848.✅ Shifting Letters 2 | 3 | class Solution 4 | { 5 | public: 6 | string shiftingLetters(string s, vector &shifts) 7 | { 8 | int k = 0; 9 | for (int i = s.size() - 1; i >= 0; --i) 10 | { 11 | k = (k + shifts[i]) % 26; 12 | s[i] = (s[i] - 'a' + k) % 26 + 'a'; 13 | } 14 | 15 | return s; 16 | } 17 | }; 18 | -------------------------------------------------------------------------------- /0852-peak-index-in-a-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0852. Peak Index in a Mountain Array.cpp: -------------------------------------------------------------------------------- 1 | 852. Peak Index in a Mountain Array 2 | 3 | class Solution { 4 | public: 5 | int peakIndexInMountainArray(vector& arr) { 6 | int max = INT_MIN; 7 | int index; 8 | for(int i = 0; i max) 11 | { 12 | max = arr[i]; 13 | index = i; 14 | } 15 | } 16 | return index; 17 | } 18 | }; -------------------------------------------------------------------------------- /0857-minimum-cost-to-hire-k-workers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0858. Mirror Reflection.cpp: -------------------------------------------------------------------------------- 1 | // 858.✅ Mirror Reflection 2 | 3 | class Solution 4 | { 5 | public: 6 | int mirrorReflection(int p, int q) 7 | { 8 | while (p % 2 == 0 && q % 2 == 0) 9 | { 10 | p /= 2; 11 | q /= 2; 12 | } 13 | return 1 - p % 2 + q % 2; 14 | } 15 | }; -------------------------------------------------------------------------------- /0859-buddy-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0860-lemonade-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0863-all-nodes-distance-k-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0867-transpose-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0867. Transpose Matrix.cpp: -------------------------------------------------------------------------------- 1 | // 867.✅ Transpose Matrix 2 | 3 | class Solution 4 | { 5 | public: 6 | vector> transpose(vector> &matrix) 7 | { 8 | vector> v(matrix[0].size(), vector(matrix.size(), 0)); 9 | 10 | for (int i = 0; i < matrix[0].size(); ++i) 11 | { 12 | for (int j = 0; j < matrix.size(); ++j) 13 | { 14 | v[i][j] = matrix[j][i]; 15 | } 16 | } 17 | 18 | return v; 19 | } 20 | }; -------------------------------------------------------------------------------- /0875-koko-eating-bananas/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0876. Middle of the Linked List.cpp: -------------------------------------------------------------------------------- 1 | 876. Middle of the Linked List 2 | 3 | 4 | class Solution { 5 | public: 6 | ListNode* middleNode(ListNode* head) { 7 | 8 | if (head == NULL) 9 | return head; 10 | 11 | ListNode *fast = head,*slow = head; 12 | 13 | while(fast != NULL && fast ->next != NULL) 14 | { 15 | fast = fast->next->next; 16 | slow = slow -> next; 17 | } 18 | return slow; 19 | } 20 | }; -------------------------------------------------------------------------------- /0881-boats-to-save-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0904-fruit-into-baskets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0905. Sort Array By Parity.cpp: -------------------------------------------------------------------------------- 1 | 905. Sort Array By Parity 2 | 3 | class Solution { 4 | public: 5 | vector sortArrayByParity(vector& nums) { 6 | int j = 0; 7 | for(int i = 0; i &nums, int k) 7 | { 8 | 9 | int mx = INT_MIN; 10 | int mn = INT_MAX; 11 | 12 | for (auto i : nums) 13 | { 14 | mx = max(mx, i); 15 | mn = min(mn, i); 16 | } 17 | 18 | return max(mx - mn - 2 * k, 0); 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /0909-snakes-and-ladders/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0912-sort-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0912. Sort an Array.cpp: -------------------------------------------------------------------------------- 1 | 912. Sort an Array 2 | 3 | class Solution { 4 | public: 5 | vector sortArray(vector& nums) { 6 | sort(nums.begin(),nums.end()); 7 | return nums; 8 | } 9 | }; -------------------------------------------------------------------------------- /0918-maximum-sum-circular-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0920-number-of-music-playlists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0926-flip-string-to-monotone-increasing/0926-flip-string-to-monotone-increasing.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int minFlipsMonoIncr(string s) { 4 | { 5 | int count_flip = 0, count_one = 0; 6 | for (auto i : s) 7 | { 8 | if (i == '1') 9 | count_one++; 10 | else{ 11 | count_flip++; 12 | count_flip = min(count_flip, count_one); 13 | } 14 | } 15 | return count_flip; 16 | } 17 | } 18 | }; -------------------------------------------------------------------------------- /0930-binary-subarrays-with-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0931-minimum-falling-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0934-shortest-bridge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0938-range-sum-of-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0938. Range Sum of BST.cpp: -------------------------------------------------------------------------------- 1 | // 938.✅ Range Sum of BST 2 | 3 | class Solution { 4 | public: 5 | int sum = 0; 6 | int rangeSumBST(TreeNode* root, int low, int high) { 7 | if(root == NULL) 8 | return 0; 9 | if(root->val >= low && root->val <= high) 10 | sum += root->val; 11 | rangeSumBST(root->left,low,high); 12 | rangeSumBST(root->right,low,high); 13 | 14 | return sum; 15 | } 16 | }; -------------------------------------------------------------------------------- /0944-delete-columns-to-make-sorted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0945-minimum-increment-to-make-array-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0946-validate-stack-sequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0947-most-stones-removed-with-same-row-or-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0948-bag-of-tokens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0950-reveal-cards-in-increasing-order/0950-reveal-cards-in-increasing-order.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | vector deckRevealedIncreasing(vector& deck) { 4 | sort(deck.rbegin(), deck.rend()); 5 | deque d; 6 | d.push_back(deck[0]); 7 | for (int i = 1; i < deck.size(); i++) { 8 | d.push_front(d.back()); 9 | d.pop_back(); 10 | d.push_front(deck[i]); 11 | } 12 | vector res(d.begin(), d.end()); 13 | return res; 14 | } 15 | }; -------------------------------------------------------------------------------- /0950-reveal-cards-in-increasing-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0953-verifying-an-alien-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0955-delete-columns-to-make-sorted-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0959-regions-cut-by-slashes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0974-subarray-sums-divisible-by-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0974. Subarray Sums Divisible by K.cpp: -------------------------------------------------------------------------------- 1 | // 974.✅ Subarray Sums Divisible by K 2 | 3 | class Solution 4 | { 5 | public: 6 | int subarraysDivByK(vector &nums, int k) 7 | { 8 | vector cnt(k, 0); 9 | int sum = 0; 10 | 11 | for (int x : nums) 12 | { 13 | sum += (x % k + k) % k; 14 | ++cnt[sum % k]; 15 | } 16 | 17 | int res = cnt[0]; 18 | 19 | for (auto c : cnt) 20 | res += (c * (c - 1)) / 2; // nC2; 21 | 22 | return res; 23 | } 24 | }; -------------------------------------------------------------------------------- /0976. Largest Perimeter Triangle.cpp: -------------------------------------------------------------------------------- 1 | // 976.✅ Largest Perimeter Triangle 2 | 3 | class Solution { 4 | public: 5 | int largestPerimeter(vector& nums) { 6 | sort(nums.begin(),nums.end()); 7 | 8 | for(int i = nums.size() - 1; i>=2 ; i--) 9 | { 10 | if(nums[i] < nums[i-1] + nums[i-2]) 11 | return nums[i] + nums[i-1] + nums[i-2]; 12 | } 13 | 14 | return 0; 15 | } 16 | }; 17 | 18 | 19 | -------------------------------------------------------------------------------- /0977-squares-of-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0977. Squares of a Sorted Array.cpp: -------------------------------------------------------------------------------- 1 | 977. Squares of a Sorted Array 2 | 3 | 4 | class Solution { 5 | public: 6 | vector sortedSquares(vector& nums) { 7 | vector sorted; 8 | for(int i = 0; i>=1; //right shift 16 | } 17 | return ans; 18 | 19 | 20 | } 21 | }; -------------------------------------------------------------------------------- /1010-pairs-of-songs-with-total-durations-divisible-by-60/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1011-capacity-to-ship-packages-within-d-days/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1020-number-of-enclaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1022. Sum of Root To Leaf Binary Numbers.cpp: -------------------------------------------------------------------------------- 1 | // 1022. Sum of Root To Leaf Binary Numbers 2 | 3 | class Solution { 4 | int sumRootToLeaf(TreeNode* root, int sum) 5 | { 6 | if(! root) 7 | return 0; 8 | sum = (sum<<1) + root->val; 9 | if(!root->left && !root->right) 10 | return sum; 11 | return sumRootToLeaf(root->left,sum) + sumRootToLeaf(root->right,sum); 12 | } 13 | public: 14 | int sumRootToLeaf(TreeNode* root) { 15 | return sumRootToLeaf(root,0); 16 | } 17 | }; -------------------------------------------------------------------------------- /1025. Divisor Game.cpp: -------------------------------------------------------------------------------- 1 | // 1025.✅ Divisor Game 2 | 3 | class Solution 4 | { 5 | public: 6 | bool divisorGame(int n) 7 | { 8 | 9 | if (n % 2 == 0) 10 | return true; 11 | return false; 12 | } 13 | }; -------------------------------------------------------------------------------- /1039-minimum-score-triangulation-of-polygon/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1043-partition-array-for-maximum-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1046-last-stone-weight/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1051-height-checker/1051-height-checker.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int heightChecker(vector& heights) { 4 | 5 | int n = heights.size(); 6 | 7 | vector copy = heights; 8 | 9 | sort(copy.begin(), copy.end()); 10 | 11 | int cnt = 0; 12 | 13 | for(int i = 0; i < n; ++i) 14 | { 15 | cnt += (heights[i] != copy[i]); 16 | } 17 | 18 | return cnt; 19 | 20 | } 21 | }; -------------------------------------------------------------------------------- /1051. Height Checker.cpp: -------------------------------------------------------------------------------- 1 | // 1051.✅ Height Checker 2 | 3 | class Solution 4 | { 5 | public: 6 | int heightChecker(vector &heights) 7 | { 8 | int cnt = 0; 9 | 10 | vector ans = heights; 11 | 12 | sort(ans.begin(), ans.end()); 13 | 14 | for (int i = 0; i < ans.size(); ++i) 15 | { 16 | if (heights[i] != ans[i]) 17 | ++cnt; 18 | } 19 | 20 | return cnt; 21 | } 22 | }; -------------------------------------------------------------------------------- /1052-grumpy-bookstore-owner/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1068-product-sales-analysis-i/1068-product-sales-analysis-i.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | 4 | select Product.product_name, Sales.year, Sales.price from Sales 5 | inner join Product on 6 | Sales.product_id = Product.product_id; -------------------------------------------------------------------------------- /1068-product-sales-analysis-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1071-greatest-common-divisor-of-strings/1071-greatest-common-divisor-of-strings.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string gcdOfStrings(string str1, string str2) { 4 | 5 | if(str1 + str2 != str2 + str1) 6 | return ""; 7 | 8 | return str1.substr(0, __gcd(size(str1), size(str2))); 9 | 10 | } 11 | }; -------------------------------------------------------------------------------- /1071-greatest-common-divisor-of-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1071. Greatest Common Divisor of Strings.cpp: -------------------------------------------------------------------------------- 1 | // 1071.✅ Greatest Common Divisor of Strings 2 | 3 | class Solution 4 | { 5 | public: 6 | string gcdOfStrings(string str1, string str2) 7 | { 8 | 9 | string s = ""; 10 | 11 | if (str1 + str2 != str2 + str1) 12 | return ""; 13 | 14 | s = str1.substr(0, gcd(size(str1), size(str2))); 15 | 16 | return s; 17 | } 18 | }; -------------------------------------------------------------------------------- /1074-number-of-submatrices-that-sum-to-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1081-smallest-subsequence-of-distinct-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1089. Duplicate Zeros.cpp: -------------------------------------------------------------------------------- 1 | 1089. Duplicate Zeros 2 | 3 | class Solution { 4 | public: 5 | void duplicateZeros(vector& arr) { 6 | for(int i = 0; i < arr.size(); i++) 7 | { 8 | if(arr[i] == 0) 9 | { 10 | for(int j = arr.size() - 2 ; j>=i; j-- ){ 11 | arr[j+1] = arr[j]; 12 | } 13 | i++; //brute force approach 14 | } 15 | } 16 | } 17 | }; -------------------------------------------------------------------------------- /1092-shortest-common-supersequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1105-filling-bookcase-shelves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1108. Defanging an IP Address.cpp: -------------------------------------------------------------------------------- 1 | // 1108.✅ Defanging an IP Address 2 | 3 | class Solution 4 | { 5 | public: 6 | string defangIPaddr(string address) 7 | { 8 | string ans = ""; 9 | for (int i = 0; i < address.length(); i++) 10 | { 11 | if (address[i] == '.') 12 | ans += "[.]"; 13 | else 14 | ans += address[i]; 15 | } 16 | return ans; 17 | } 18 | }; -------------------------------------------------------------------------------- /1110-delete-nodes-and-return-forest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1122-relative-sort-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1125-smallest-sufficient-team/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1129-shortest-path-with-alternating-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1137-n-th-tribonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1140-stone-game-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1143-longest-common-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1148-article-views-i/1148-article-views-i.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | select distinct(author_id) as id from Views where author_id = viewer_id order by author_id asc; -------------------------------------------------------------------------------- /1148-article-views-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1155-number-of-dice-rolls-with-target-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1160-find-words-that-can-be-formed-by-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1171-remove-zero-sum-consecutive-nodes-from-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1189. Maximum Number of Balloons.cpp: -------------------------------------------------------------------------------- 1 | // 1189.✅ Maximum Number of Balloons 2 | 3 | class Solution 4 | { 5 | public: 6 | int maxNumberOfBalloons(string text) 7 | { 8 | map m; 9 | 10 | for (int i = 0; i < text.length(); ++i) 11 | m[text[i]]++; 12 | 13 | return min({m['b'], m['a'], m['l'] / 2, m['o'] / 2, m['n']}); 14 | } 15 | }; -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1203-sort-items-by-groups-respecting-dependencies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/1207-unique-number-of-occurrences.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool uniqueOccurrences(vector& arr) { 4 | 5 | unordered_map mp; 6 | unordered_set s; 7 | for(auto itr : arr) 8 | ++mp[itr]; 9 | 10 | for(auto itr : mp) 11 | s.insert(itr.second); 12 | 13 | return (mp.size() == s.size()); 14 | } 15 | }; -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1208-get-equal-substrings-within-budget/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1220-count-vowels-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1221. Split a String in Balanced Strings.cpp: -------------------------------------------------------------------------------- 1 | // 1221.✅ Split a String in Balanced Strings 2 | 3 | class Solution 4 | { 5 | public: 6 | int balancedStringSplit(string s) 7 | { 8 | int cnt = 0, ind = 0; 9 | for (int i = 0; i < s.length(); ++i) 10 | { 11 | if (s[i] == 'R') 12 | ++cnt; 13 | else 14 | --cnt; 15 | if (cnt == 0) 16 | ++ind; 17 | } 18 | return ind; 19 | } 20 | }; -------------------------------------------------------------------------------- /1239-maximum-length-of-a-concatenated-string-with-unique-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1248-count-number-of-nice-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1266. Minimum Time Visiting All Points.cpp: -------------------------------------------------------------------------------- 1 | // 1266.✅ Minimum Time Visiting All Points 2 | 3 | class Solution 4 | { 5 | public: 6 | int minTimeToVisitAllPoints(vector> &points) 7 | { 8 | int ans = 0; 9 | for (int i = 1; i < points.size(); ++i) 10 | ans += max(abs(points[i][1] - points[i - 1][1]), abs(points[i][0] - points[i - 1][0])); 11 | 12 | return ans; 13 | } 14 | }; 15 | -------------------------------------------------------------------------------- /1277-count-square-submatrices-with-all-ones/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1281. Subtract the Product and Sum of Digits of an Integer.cpp: -------------------------------------------------------------------------------- 1 | // 1281.✅ Subtract the Product and Sum of Digits of an Integer 2 | 3 | class Solution 4 | { 5 | public: 6 | int subtractProductAndSum(int n) 7 | { 8 | int mul = 1; 9 | int add = 0; 10 | while (n > 0) 11 | { 12 | int rem = n % 10; 13 | mul *= rem; 14 | add += rem; 15 | n /= 10; 16 | } 17 | 18 | return mul - add; 19 | } 20 | }; -------------------------------------------------------------------------------- /1282-group-the-people-given-the-group-size-they-belong-to/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1287-element-appearing-more-than-25-in-sorted-array/1287-element-appearing-more-than-25-in-sorted-array.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int findSpecialInteger(vector& arr) { 4 | 5 | int n = arr.size(), oneFourth = n/4; 6 | 7 | for(int i = 0; i < n - oneFourth; ++i) 8 | { 9 | if(arr[i] == arr[i+oneFourth]) 10 | return arr[i]; 11 | } 12 | 13 | return -1; 14 | 15 | } 16 | }; -------------------------------------------------------------------------------- /1290. Convert Binary Number in a Linked List to Integer.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int getDecimalValue(ListNode* head) { 4 | int ans = 0; 5 | while(head) 6 | { 7 | ans = ans * 2; 8 | ans += head->val; 9 | head = head->next; 10 | 11 | } 12 | return ans; 13 | } 14 | }; -------------------------------------------------------------------------------- /1291-sequential-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1299. Replace Elements with Greatest Element on Right Side.cpp: -------------------------------------------------------------------------------- 1 | // 1299.✅ Replace Elements with Greatest Element on Right Side 2 | 3 | class Solution 4 | { 5 | public: 6 | vector replaceElements(vector &arr) 7 | { 8 | int n = arr.size(), temp, m = -1; 9 | for (int i = n - 1; i >= 0; i--) 10 | { 11 | temp = arr[i]; 12 | arr[i] = m; 13 | m = max(m, temp); 14 | } 15 | return arr; 16 | } 17 | }; -------------------------------------------------------------------------------- /1313. Decompress Run-Length Encoded List.cpp: -------------------------------------------------------------------------------- 1 | // 1313.✅ Decompress Run-Length Encoded List 2 | 3 | class Solution 4 | { 5 | public: 6 | vector decompressRLElist(vector &nums) 7 | { 8 | vector ans; 9 | for (int i = 0; i < nums.size(); i += 2) 10 | { 11 | for (int j = 0; j < nums[i]; ++j) 12 | ans.push_back(nums[i + 1]); 13 | } 14 | return ans; 15 | } 16 | }; 17 | -------------------------------------------------------------------------------- /1318-minimum-flips-to-make-a-or-b-equal-to-c/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1319-number-of-operations-to-make-network-connected/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1323. Maximum 69 Number.cpp: -------------------------------------------------------------------------------- 1 | // 1323.✅ Maximum 69 Number 2 | 3 | class Solution 4 | { 5 | public: 6 | int maximum69Number(int num) 7 | { 8 | string s = to_string(num); 9 | 10 | for (int i = 0; i < s.length(); ++i) 11 | if (s[i] == '6') 12 | { 13 | s[i] = '9'; 14 | break; 15 | } 16 | 17 | return stoi(s); 18 | } 19 | }; 20 | -------------------------------------------------------------------------------- /1326-minimum-number-of-taps-to-open-to-water-a-garden/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1339-maximum-product-of-splitted-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1342. Number of Steps to Reduce a Number to Zero.cpp: -------------------------------------------------------------------------------- 1 | // 1342.✅ Number of Steps to Reduce a Number to Zero 2 | 3 | class Solution 4 | { 5 | public: 6 | int numberOfSteps(int num) 7 | { 8 | int cnt = 0; 9 | while (num > 0) 10 | { 11 | if (num % 2 == 0) 12 | { 13 | num /= 2; 14 | } 15 | else 16 | { 17 | num -= 1; 18 | } 19 | cnt++; 20 | } 21 | 22 | return cnt; 23 | } 24 | }; -------------------------------------------------------------------------------- /1346. Check If N and Its Double Exist.cpp: -------------------------------------------------------------------------------- 1 | // 1346.✅ Check If N and Its Double Exist 2 | 3 | class Solution 4 | { 5 | public: 6 | bool checkIfExist(vector &arr) 7 | { 8 | sort(arr.begin(), arr.end()); 9 | for (int i = 0; i < arr.size(); ++i) 10 | { 11 | for (int j = 0; j < arr.size(); ++j) 12 | { 13 | if (arr[j] == arr[i] * 2 && i != j) 14 | return true; 15 | } 16 | } 17 | return false; 18 | } 19 | }; 20 | -------------------------------------------------------------------------------- /1347-minimum-number-of-steps-to-make-two-strings-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1351-count-negative-numbers-in-a-sorted-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1358-number-of-substrings-containing-all-three-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1359-count-all-valid-pickup-and-delivery-options/1359-count-all-valid-pickup-and-delivery-options.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int countOrders(int n) { 4 | int odd=3, mod=1e9+7; 5 | long long ans=1; 6 | for(int i=2; i<=n; i++) 7 | { 8 | int sum = (odd)*(odd+1)%mod/2; 9 | ans=ans*sum%mod; 10 | odd+=2; 11 | } 12 | return ans%mod; 13 | } 14 | }; -------------------------------------------------------------------------------- /1376-time-needed-to-inform-all-employees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1378-replace-employee-id-with-the-unique-identifier/1378-replace-employee-id-with-the-unique-identifier.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | 4 | select e2.unique_id , e1.name from Employees e1 5 | left join EmployeeUNI e2 6 | on e1.id = e2.id; -------------------------------------------------------------------------------- /1378-replace-employee-id-with-the-unique-identifier/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1382-balance-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1389. Create Target Array in the Given Order.cpp: -------------------------------------------------------------------------------- 1 | // 1389.✅ Create Target Array in the Given Order 2 | 3 | class Solution 4 | { 5 | public: 6 | vector createTargetArray(vector &nums, vector &index) 7 | { 8 | vector target; 9 | for (int i = 0; i < nums.size(); ++i) 10 | { 11 | target.insert(target.begin() + index[i], nums[i]); 12 | } 13 | 14 | return target; 15 | } 16 | }; -------------------------------------------------------------------------------- /1394. Find Lucky Integer in an Array.cpp: -------------------------------------------------------------------------------- 1 | // 1394.✅ Find Lucky Integer in an Array 2 | 3 | class Solution 4 | { 5 | public: 6 | int findLucky(vector &arr) 7 | { 8 | 9 | map m; 10 | int ans = -1; 11 | for (int i = 0; i < arr.size(); ++i) 12 | ++m[arr[i]]; 13 | 14 | for (auto i : m) 15 | { 16 | if (i.first == i.second) 17 | ans = max(ans, i.first); 18 | } 19 | 20 | return ans; 21 | } 22 | }; -------------------------------------------------------------------------------- /1396-design-underground-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1406-stone-game-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1416-restore-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1422-maximum-score-after-splitting-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1425-constrained-subsequence-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1431-kids-with-the-greatest-number-of-candies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1446. Consecutive Characters.cpp: -------------------------------------------------------------------------------- 1 | 1446.✅ Consecutive Characters 2 | 3 | class Solution { 4 | public: 5 | int maxPower(string s) { 6 | int ans=1, count=1; 7 | for(int i=0; i< s.size(); i++) 8 | { 9 | if(s[i] == s[i+1]) 10 | { 11 | count++; 12 | ans = max(ans, count); 13 | } 14 | else 15 | count=1; 16 | } 17 | return ans; 18 | } 19 | }; 20 | 21 | -------------------------------------------------------------------------------- /1450. Number of Students Doing Homework at a Given Time.cpp: -------------------------------------------------------------------------------- 1 | // 1450.✅ Number of Students Doing Homework at a Given Time 2 | 3 | class Solution 4 | { 5 | public: 6 | int busyStudent(vector &startTime, vector &endTime, int queryTime) 7 | { 8 | 9 | int ind = 0; 10 | for (int i = 0; i < startTime.size(); ++i) 11 | { 12 | if (queryTime >= startTime[i] && queryTime <= endTime[i]) 13 | ++ind; 14 | } 15 | return ind; 16 | } 17 | }; -------------------------------------------------------------------------------- /1456-maximum-number-of-vowels-in-a-substring-of-given-length/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1458-max-dot-product-of-two-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1460-make-two-arrays-equal-by-reversing-subarrays/1460-make-two-arrays-equal-by-reversing-subarrays.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool canBeEqual(vector& target, vector& arr) { 4 | 5 | sort(arr.begin(), arr.end()); 6 | sort(target.begin(), target.end()); 7 | 8 | return arr == target; 9 | 10 | } 11 | }; -------------------------------------------------------------------------------- /1460-make-two-arrays-equal-by-reversing-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1461. Check If a String Contains All Binary Codes of Size K.cpp: -------------------------------------------------------------------------------- 1 | // 1461.✅ Check If a String Contains All Binary Codes of Size K 2 | 3 | class Solution 4 | { 5 | public: 6 | bool hasAllCodes(string s, int k) 7 | { 8 | unordered_set st; 9 | if (k > s.length()) 10 | return false; 11 | 12 | for (int i = 0; i <= s.length() - k; ++i) 13 | { 14 | st.insert(s.substr(i, k)); 15 | } 16 | 17 | return st.size() == pow(2, k); 18 | } 19 | }; 20 | -------------------------------------------------------------------------------- /1463-cherry-pickup-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1464-maximum-product-of-two-elements-in-an-array/1464-maximum-product-of-two-elements-in-an-array.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maxProduct(vector& nums) { 4 | 5 | sort(nums.begin(), nums.end()); 6 | 7 | return (--nums[nums.size()-1] * --nums[nums.size()-2]); 8 | 9 | } 10 | }; -------------------------------------------------------------------------------- /1464-maximum-product-of-two-elements-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1470-shuffle-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1470. Shuffle the Array.cpp: -------------------------------------------------------------------------------- 1 | // 1470.✅ Shuffle the Array 2 | 3 | class Solution { 4 | public: 5 | vector shuffle(vector& nums, int n) { 6 | vector result; 7 | for(int i = 0;i runningSum(vector& nums) { 6 | int sum = 0; 7 | 8 | for(int i = 0; i < nums.size(); i++){ 9 | sum = sum + nums[i]; 10 | nums[i] = sum; 11 | 12 | } 13 | return nums; 14 | } 15 | }; 16 | 17 | -------------------------------------------------------------------------------- /1482-minimum-number-of-days-to-make-m-bouquets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1486. XOR Operation in an Array.cpp: -------------------------------------------------------------------------------- 1 | // 1486.✅ XOR Operation in an Array 2 | 3 | 4 | class Solution 5 | { 6 | public: 7 | int xorOperation(int n, int start) 8 | { 9 | int ans = 0; 10 | for (int i = 0; i < n; i++) 11 | { 12 | ans ^= start + 2 * i; 13 | } 14 | return ans; 15 | } 16 | }; 17 | -------------------------------------------------------------------------------- /1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1493-longest-subarray-of-1s-after-deleting-one-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1496-path-crossing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1498-number-of-subsequences-that-satisfy-the-given-sum-condition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1502-can-make-arithmetic-progression-from-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1503-last-moment-before-all-ants-fall-out-of-a-plank/1503-last-moment-before-all-ants-fall-out-of-a-plank.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int getLastMoment(int n, vector& left, vector& right) { 4 | 5 | int maxi = 0; 6 | 7 | for(auto& itr : left) 8 | { 9 | maxi = max(maxi, itr); 10 | } 11 | 12 | for(auto& itr : right) 13 | { 14 | maxi = max(maxi, n - itr); 15 | } 16 | 17 | return maxi; 18 | 19 | } 20 | }; -------------------------------------------------------------------------------- /1503-last-moment-before-all-ants-fall-out-of-a-plank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1508-range-sum-of-sorted-subarray-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1512-number-of-good-pairs/1512-number-of-good-pairs.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int numIdenticalPairs(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | unordered_map mp; 8 | 9 | for(auto& itr : nums) 10 | ++mp[itr]; 11 | 12 | int count = 0; 13 | 14 | for(auto& [key, value] : mp) 15 | { 16 | count += (value * (value-1))/2; 17 | } 18 | 19 | return count; 20 | } 21 | }; -------------------------------------------------------------------------------- /1512-number-of-good-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1512. Number of Good Pairs.cpp: -------------------------------------------------------------------------------- 1 | // 1512.✅ Number of Good Pairs 2 | 3 | class Solution 4 | { 5 | public: 6 | int numIdenticalPairs(vector &nums) 7 | { 8 | int cnt = 0; 9 | for (int i = 0; i < nums.size() - 1; ++i) 10 | { 11 | for (int j = i + 1; j < nums.size(); ++j) 12 | { 13 | if (nums[i] == nums[j]) 14 | cnt++; 15 | } 16 | } 17 | return cnt; 18 | } 19 | }; -------------------------------------------------------------------------------- /1514-path-with-maximum-probability/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1518-water-bottles/1518-water-bottles.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int numWaterBottles(int numBottles, int numExchange) { 4 | 5 | int ans = numBottles; 6 | 7 | while((numBottles/numExchange) > 0) 8 | { 9 | ans += (numBottles/numExchange); 10 | int rem = (numBottles%numExchange); 11 | numBottles /= numExchange; 12 | numBottles += rem; 13 | } 14 | 15 | return ans; 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /1518-water-bottles/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1523-count-odd-numbers-in-an-interval-range/1523-count-odd-numbers-in-an-interval-range.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int countOdds(int low, int high) { 4 | 5 | int ans = 0; 6 | bool one = false, two = false; 7 | 8 | if(low & 1) 9 | ++ans, one = true; 10 | if(high & 1) 11 | ++ans, two = true; 12 | ans += (high-low)/2; 13 | 14 | if(one and two) 15 | ans -= 1; 16 | 17 | return ans; 18 | 19 | } 20 | }; -------------------------------------------------------------------------------- /1523-count-odd-numbers-in-an-interval-range/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1528. Shuffle String.cpp: -------------------------------------------------------------------------------- 1 | // 1528.✅ Shuffle String 2 | 3 | class Solution 4 | { 5 | public: 6 | string restoreString(string s, vector &indices) 7 | { 8 | string ans = s; 9 | 10 | for (int i = 0; i < indices.size(); ++i) 11 | { 12 | ans[indices[i]] = s[i]; 13 | } 14 | 15 | return ans; 16 | } 17 | }; -------------------------------------------------------------------------------- /1530-number-of-good-leaf-nodes-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/1539-kth-missing-positive-number.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int findKthPositive(vector& arr, int k) { 4 | int start = 0, end = arr.size(); 5 | while(start < end) 6 | { 7 | int mid = start + (end - start) /2; 8 | if(arr[mid]- mid - 1 < k) 9 | start = mid + 1; 10 | else 11 | end = mid; 12 | } 13 | return start + k; 14 | } 15 | }; -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1544-make-the-string-great/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1550-three-consecutive-odds/1550-three-consecutive-odds.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool threeConsecutiveOdds(vector& arr) { 4 | 5 | int n = arr.size(); 6 | 7 | if(n < 3) 8 | return false; 9 | 10 | for(int i = 2; i < n; ++i) 11 | { 12 | if(arr[i] & 1 and arr[i-1] & 1 and arr[i-2] & 1) return true; 13 | } 14 | 15 | return false; 16 | } 17 | }; -------------------------------------------------------------------------------- /1550-three-consecutive-odds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1550. Three Consecutive Odds.cpp: -------------------------------------------------------------------------------- 1 | // 1550.✅ Three Consecutive Odds 2 | 3 | class Solution 4 | { 5 | public: 6 | bool threeConsecutiveOdds(vector &arr) 7 | { 8 | int cnt = 0; 9 | for (int i = 0; i < arr.size(); ++i) 10 | { 11 | if (arr[i] % 2 == 0) 12 | cnt = 0; 13 | else 14 | cnt++; 15 | if (cnt == 3) 16 | return true; 17 | } 18 | 19 | return false; 20 | } 21 | }; 22 | -------------------------------------------------------------------------------- /1552-magnetic-force-between-two-balls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1569-number-of-ways-to-reorder-array-to-get-same-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1572-matrix-diagonal-sum/1572-matrix-diagonal-sum.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int diagonalSum(vector>& mat) { 4 | 5 | int n = mat.size(), m = mat[0].size(); 6 | 7 | int sum = 0; 8 | 9 | for(int i = 0; i < n; ++i) 10 | { 11 | sum += (mat[i][n-i-1] + mat[i][i]); 12 | } 13 | 14 | sum = (n & 1) ? sum - mat[n/2][n/2] : sum; 15 | 16 | return sum; 17 | 18 | } 19 | }; -------------------------------------------------------------------------------- /1572-matrix-diagonal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1575-count-all-possible-routes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1578-minimum-time-to-make-rope-colorful/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1582-special-positions-in-a-binary-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1605-find-valid-matrix-given-row-and-column-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1608-special-array-with-x-elements-greater-than-or-equal-x/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1609-even-odd-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1614-maximum-nesting-depth-of-the-parentheses/1614-maximum-nesting-depth-of-the-parentheses.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maxDepth(string s) { 4 | 5 | int open = 0, ans = 0; 6 | 7 | for(auto& ch : s) 8 | { 9 | if(ch == '(') 10 | ++open; 11 | else if(ch == ')') 12 | --open; 13 | ans = max(ans, open); 14 | } 15 | 16 | return ans; 17 | } 18 | }; -------------------------------------------------------------------------------- /1614-maximum-nesting-depth-of-the-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1615-maximal-network-rank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1624-largest-substring-between-two-equal-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1637-widest-vertical-area-between-two-points-containing-no-points/1637-widest-vertical-area-between-two-points-containing-no-points.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maxWidthOfVerticalArea(vector>& points) { 4 | 5 | int n = points.size(); 6 | 7 | sort(points.begin(), points.end()); 8 | 9 | int ans = 0; 10 | 11 | for(int i = 1; i < n; ++i) 12 | ans = max(ans, points[i][0] - points[i-1][0]); 13 | 14 | return ans; 15 | 16 | } 17 | }; -------------------------------------------------------------------------------- /1637-widest-vertical-area-between-two-points-containing-no-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1637. Widest Vertical Area Between Two Points Containing No Points.cpp: -------------------------------------------------------------------------------- 1 | // 1637.✅ Widest Vertical Area Between Two Points Containing No Points 2 | 3 | class Solution 4 | { 5 | public: 6 | int maxWidthOfVerticalArea(vector> &points) 7 | { 8 | 9 | sort(points.begin(), points.end()); 10 | int res = 0; 11 | 12 | for (int i = 0; i < points.size() - 1; ++i) 13 | res = max(res, points[i + 1][0] - points[i][0]); 14 | 15 | return res; 16 | } 17 | }; 18 | -------------------------------------------------------------------------------- /1639-number-of-ways-to-form-a-target-string-given-a-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1647-minimum-deletions-to-make-character-frequencies-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1657-determine-if-two-strings-are-close/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1683-invalid-tweets/1683-invalid-tweets.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | select tweet_id from Tweets 4 | where char_length(content) > 15; 5 | 6 | -------------------------------------------------------------------------------- /1683-invalid-tweets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1685-sum-of-absolute-differences-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp: -------------------------------------------------------------------------------- 1 | // 1689.✅ Partitioning Into Minimum Number Of Deci-Binary Numbers 2 | 3 | class Solution { 4 | public: 5 | int minPartitions(string n) { 6 | return *max_element(n.begin(),n.end()) - '0'; 7 | } 8 | }; -------------------------------------------------------------------------------- /1700-number-of-students-unable-to-eat-lunch/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1704-determine-if-string-halves-are-alike/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1716-calculate-money-in-leetcode-bank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1720. Decode XORed Array.cpp: -------------------------------------------------------------------------------- 1 | // 1720.✅ Decode XORed Array 2 | 3 | class Solution 4 | { 5 | public: 6 | // res[i + 1] = res[i] ^ A[i] 7 | vector decode(vector &encoded, int first) 8 | { 9 | 10 | encoded.insert(encoded.begin(), first); 11 | 12 | for (int i = 1; i < encoded.size(); ++i) 13 | { 14 | encoded[i] = encoded[i] ^ encoded[i - 1]; 15 | } 16 | return encoded; 17 | } 18 | }; 19 | -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1727-largest-submatrix-with-rearrangements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1732-find-the-highest-altitude/1732-find-the-highest-altitude.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int largestAltitude(vector& gain) { 4 | 5 | int sum = 0, ans = 0; 6 | 7 | for(auto itr : gain) 8 | { 9 | sum += itr; 10 | ans = max(ans, sum); 11 | } 12 | 13 | return ans; 14 | 15 | } 16 | }; -------------------------------------------------------------------------------- /1732-find-the-highest-altitude/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1732. Find the Highest Altitude.cpp: -------------------------------------------------------------------------------- 1 | // 1732.✅ Find the Highest Altitude 2 | 3 | class Solution 4 | { 5 | public: 6 | int largestAltitude(vector &gain) 7 | { 8 | vector v; 9 | int sum = 0; 10 | 11 | for (int i = 0; i < gain.size(); ++i) 12 | { 13 | sum += gain[i]; 14 | v.push_back(sum); 15 | } 16 | 17 | int mx = *max_element(v.begin(), v.end()); 18 | 19 | if (mx > 0) 20 | return mx; 21 | return 0; 22 | } 23 | }; -------------------------------------------------------------------------------- /1743-restore-the-array-from-adjacent-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1748. Sum of Unique Elements.cpp: -------------------------------------------------------------------------------- 1 | // 1748.✅ Sum of Unique Elements 2 | 3 | class Solution 4 | { 5 | public: 6 | int sumOfUnique(vector &nums) 7 | { 8 | map m; 9 | int sum = 0; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | { 13 | ++m[nums[i]]; 14 | } 15 | 16 | for (auto i : m) 17 | { 18 | if (i.second == 1) 19 | sum += i.first; 20 | } 21 | 22 | return sum; 23 | } 24 | }; -------------------------------------------------------------------------------- /1752. Check if Array Is Sorted and Rotated.cpp: -------------------------------------------------------------------------------- 1 | // 1752.✅ Check if Array Is Sorted and Rotated 2 | 3 | class Solution 4 | { 5 | public: 6 | bool check(vector &nums) 7 | { 8 | int n = nums.size(); 9 | int cnt = 0; 10 | 11 | for (int i = 0; i < n; ++i) 12 | { 13 | if (nums[i] > nums[(i + 1) % n]) 14 | ++cnt; 15 | } 16 | return cnt <= 1; 17 | } 18 | }; 19 | -------------------------------------------------------------------------------- /1757-recyclable-and-low-fat-products/1757-recyclable-and-low-fat-products.sql: -------------------------------------------------------------------------------- 1 | # Write your MySQL query statement below 2 | 3 | select product_id from Products where low_fats = 'Y' and recyclable = 'Y'; 4 | -------------------------------------------------------------------------------- /1757-recyclable-and-low-fat-products/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1758-minimum-changes-to-make-alternating-binary-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1759-count-number-of-homogenous-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1768-merge-strings-alternately/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1780. Check if Number is a Sum of Powers of Three.cpp: -------------------------------------------------------------------------------- 1 | // 1780.✅ Check if Number is a Sum of Powers of Three 2 | 3 | class Solution 4 | { 5 | public: 6 | bool checkPowersOfThree(int n) 7 | { 8 | while (n) 9 | { 10 | if (n % 3 == 2) 11 | return false; 12 | n /= 3; 13 | } 14 | 15 | return true; 16 | } 17 | }; -------------------------------------------------------------------------------- /1791-find-center-of-star-graph/1791-find-center-of-star-graph.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int findCenter(vector>& edges) { 4 | 5 | if(edges[0][0]==edges[1][0] || edges[0][0]==edges[1][1]) 6 | return edges[0][0]; 7 | 8 | else return edges[0][1]; 9 | 10 | } 11 | }; -------------------------------------------------------------------------------- /1791. Find Center of Star Graph.cpp: -------------------------------------------------------------------------------- 1 | // 1791.✅ Find Center of Star Graph 2 | 3 | class Solution 4 | { 5 | public: 6 | int findCenter(vector> &edges) 7 | { 8 | 9 | // KNOCKCAT \\ 10 | 11 | if (edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1]) 12 | return edges[0][0]; 13 | 14 | else 15 | return edges[0][1]; 16 | } 17 | }; -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1797-design-authentication-manager/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1799-maximize-score-after-n-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1802-maximum-value-at-a-given-index-in-a-bounded-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1816. Truncate Sentence.cpp: -------------------------------------------------------------------------------- 1 | // 1816. Truncate Sentence 2 | 3 | class Solution 4 | { 5 | public: 6 | string truncateSentence(string s, int k) 7 | { 8 | string ans = ""; 9 | int cnt = 0; 10 | for (int i = 0; i < s.length(); i++) 11 | { 12 | if (s[i] == ' ') 13 | cnt++; 14 | if (cnt == k) 15 | break; 16 | ans += s[i]; 17 | } 18 | return ans; 19 | } 20 | }; -------------------------------------------------------------------------------- /1822-sign-of-the-product-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1832. Check if the Sentence Is Pangram.cpp: -------------------------------------------------------------------------------- 1 | // 1832. Check if the Sentence Is Pangram 2 | 3 | class Solution 4 | { 5 | public: 6 | bool checkIfPangram(string sentence) 7 | { 8 | 9 | vector cnt(26, 0); 10 | 11 | for (int i = 0; i < sentence.length(); i++) 12 | { 13 | cnt[sentence[i] - 'a']++; 14 | } 15 | 16 | for (int i = 0; i < 26; i++) 17 | { 18 | if (cnt[i] == 0) 19 | return false; 20 | } 21 | return true; 22 | } 23 | }; 24 | -------------------------------------------------------------------------------- /1833-maximum-ice-cream-bars/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1844. Replace All Digits with Characters.cpp: -------------------------------------------------------------------------------- 1 | // 1844.✅ Replace All Digits with Characters 2 | 3 | class Solution 4 | { 5 | public: 6 | string replaceDigits(string s) 7 | { 8 | for (int i = 1; i < s.length(); i += 2) 9 | s[i] += s[i - 1] - '0'; 10 | 11 | return s; 12 | } 13 | }; 14 | -------------------------------------------------------------------------------- /1845-seat-reservation-manager/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1855. Maximum Distance Between a Pair of Values.cpp: -------------------------------------------------------------------------------- 1 | // 1855.✅ Maximum Distance Between a Pair of Values 2 | 3 | class Solution 4 | { 5 | public: 6 | int maxDistance(vector &nums1, vector &nums2) 7 | { 8 | int res = 0, i, j; 9 | i = j = 0; 10 | 11 | while (i < nums1.size() && j < nums2.size()) 12 | { 13 | if (nums1[i] > nums2[j]) 14 | ++i; 15 | else 16 | res = max(res, j++ - i); 17 | } 18 | return res; 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /1857-largest-color-value-in-a-directed-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1863-sum-of-all-subset-xor-totals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1870-minimum-speed-to-arrive-on-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1877-minimize-maximum-pair-sum-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1897-redistribute-characters-to-make-all-strings-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1903-largest-odd-number-in-string/1903-largest-odd-number-in-string.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string largestOddNumber(string num) { 4 | 5 | int n = num.size(); 6 | 7 | for(int i = n-1; i >= 0; --i) 8 | { 9 | if((num[i] - '0') & 1) 10 | return num.substr(0, i+1); 11 | } 12 | 13 | return ""; 14 | 15 | } 16 | }; -------------------------------------------------------------------------------- /1903-largest-odd-number-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1903. Largest Odd Number in String.cpp: -------------------------------------------------------------------------------- 1 | // 1903.✅ Largest Odd Number in String 2 | 3 | class Solution 4 | { 5 | public: 6 | string largestOddNumber(string num) 7 | { 8 | int mx = INT_MIN; 9 | for (int i = num.size() - 1; i >= 0; --i) 10 | { 11 | if (num[i] - '0' & 1) 12 | { 13 | return num.substr(0, i + 1); 14 | } 15 | } 16 | 17 | return ""; 18 | } 19 | }; -------------------------------------------------------------------------------- /1905-count-sub-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1913-maximum-product-difference-between-two-pairs/1913-maximum-product-difference-between-two-pairs.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int maxProductDifference(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | sort(nums.begin(),nums.end()); 8 | 9 | return ((nums[n-1] * nums[n-2]) - (nums[0] * nums[1])); 10 | } 11 | }; -------------------------------------------------------------------------------- /1913-maximum-product-difference-between-two-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1915-number-of-wonderful-substrings/1915-number-of-wonderful-substrings.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | long long wonderfulSubstrings(string word) { 4 | 5 | long cnt[1024] = { 1 }, mask = 0, res = 0; 6 | for (auto ch : word) { 7 | mask ^= 1 << (ch - 'a'); 8 | res += cnt[mask]; 9 | for (auto n = 0; n < 10; ++n) 10 | res += cnt[mask ^ (1 << n)]; 11 | ++cnt[mask]; 12 | } 13 | return res; 14 | } 15 | }; -------------------------------------------------------------------------------- /1920. Build Array from Permutation.cpp: -------------------------------------------------------------------------------- 1 | // 1920. Build Array from Permutation 2 | 3 | class Solution { 4 | public: 5 | vector buildArray(vector& nums) { 6 | vector ans; 7 | for(int i = 0; i getConcatenation(vector &nums) 7 | { 8 | int n = nums.size(); 9 | 10 | for (int i = 0; i < n; i++) 11 | { 12 | nums.push_back(nums[i]); 13 | } 14 | return nums; 15 | } 16 | }; -------------------------------------------------------------------------------- /1930-unique-length-3-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1941. Check if All Characters Have Equal Number of Occurrences.cpp: -------------------------------------------------------------------------------- 1 | // 1941.✅ Check if All Characters Have Equal Number of Occurrences 2 | 3 | class Solution 4 | { 5 | public: 6 | bool areOccurrencesEqual(string s) 7 | { 8 | map m; 9 | 10 | for (auto c : s) 11 | ++m[c]; 12 | 13 | int a = m[s[0]]; 14 | 15 | for (auto i : m) 16 | { 17 | if (a != i.second) 18 | return false; 19 | } 20 | 21 | return true; 22 | } 23 | }; 24 | -------------------------------------------------------------------------------- /1952. Three Divisors.cpp: -------------------------------------------------------------------------------- 1 | // 1952.✅ Three Divisors 2 | 3 | class Solution 4 | { 5 | public: 6 | bool isThree(int n) 7 | { 8 | int cnt = 0; 9 | for (int i = 1; i <= n; ++i) 10 | { 11 | if (n % i == 0) 12 | ++cnt; 13 | } 14 | if (cnt == 3) 15 | return true; 16 | 17 | return false; 18 | } 19 | }; -------------------------------------------------------------------------------- /1957. Delete Characters to Make Fancy String.cpp: -------------------------------------------------------------------------------- 1 | // 1957.✅ Delete Characters to Make Fancy String 2 | 3 | class Solution 4 | { 5 | public: 6 | string ans = ""; 7 | string makeFancyString(string s) 8 | { 9 | for (int i = 0; i < s.length(); i++) 10 | { 11 | if (s[i] != s[i + 1] || s[i] != s[i + 2]) 12 | ans += s[i]; 13 | } 14 | return ans; 15 | } 16 | }; -------------------------------------------------------------------------------- /1961. Check If String Is a Prefix of Array.cpp: -------------------------------------------------------------------------------- 1 | // 1961.✅ Check If String Is a Prefix of Array 2 | 3 | class Solution 4 | { 5 | public: 6 | string str = ""; 7 | bool isPrefixString(string s, vector &words) 8 | { 9 | for (int i = 0; i < words.size(); ++i) 10 | { 11 | str += words[i]; 12 | if (str == s) 13 | return true; 14 | } 15 | return false; 16 | } 17 | }; -------------------------------------------------------------------------------- /1962-remove-stones-to-minimize-the-total/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1964-find-the-longest-valid-obstacle-course-at-each-position/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1967. Number of Strings That Appear as Substrings in Word.cpp: -------------------------------------------------------------------------------- 1 | // 1967.✅ Number of Strings That Appear as Substrings in Word 2 | 3 | class Solution 4 | { 5 | public: 6 | int numOfStrings(vector &patterns, string word) 7 | { 8 | int cnt = 0; 9 | 10 | for (int i = 0; i < patterns.size(); ++i) 11 | { 12 | if (word.find(patterns[i]) != -1) 13 | cnt++; 14 | } 15 | return cnt; 16 | } 17 | }; -------------------------------------------------------------------------------- /1976-number-of-ways-to-arrive-at-destination/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1980-find-unique-binary-string/1980-find-unique-binary-string.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | string findDifferentBinaryString(vector& nums) { 4 | 5 | int n = nums.size(); 6 | 7 | for(int i = 0; i < n; ++i) 8 | { 9 | if(nums[0][i] = nums[i][i] == '0' ? '1' : '0'); 10 | } 11 | 12 | return nums[0]; 13 | } 14 | }; -------------------------------------------------------------------------------- /1980-find-unique-binary-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1985-find-the-kth-largest-integer-in-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1991. Find the Middle Index in Array.cpp: -------------------------------------------------------------------------------- 1 | // 1991.✅ Find the Middle Index in Array 2 | 3 | class Solution 4 | { 5 | public: 6 | int findMiddleIndex(vector &nums) 7 | { 8 | int rightSum = accumulate(nums.begin(), nums.end(), 0); 9 | int leftSum = 0; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | { 13 | rightSum -= nums[i]; 14 | if (leftSum == rightSum) 15 | return i; 16 | leftSum += nums[i]; 17 | } 18 | return -1; 19 | } 20 | }; -------------------------------------------------------------------------------- /2000-reverse-prefix-of-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2000. Reverse Prefix of Word.cpp: -------------------------------------------------------------------------------- 1 | // 2000.✅ Reverse Prefix of Word 2 | 3 | class Solution 4 | { 5 | public: 6 | string reversePrefix(string word, char ch) 7 | { 8 | for (int i = 0; i < word.length(); i++) 9 | { 10 | if (word[i] == ch) 11 | { 12 | reverse(word.begin(), word.begin() + i + 1); 13 | break; 14 | } 15 | } 16 | 17 | return word; 18 | } 19 | }; 20 | -------------------------------------------------------------------------------- /2011. Final Value of Variable After Performing Operations.cpp: -------------------------------------------------------------------------------- 1 | // 2011.✅ Final Value of Variable After Performing Operations 2 | 3 | 4 | class Solution { 5 | public: 6 | int finalValueAfterOperations(vector& operations) { 7 | int X = 0; 8 | for(int i = 0; i &arr, int k) 7 | { 8 | map m; 9 | 10 | for (string str : arr) 11 | { 12 | m[str]++; 13 | } 14 | 15 | for (string str : arr) 16 | { 17 | if (m[str] == 1 && --k == 0) 18 | return str; 19 | } 20 | 21 | return ""; 22 | } 23 | }; -------------------------------------------------------------------------------- /2057. Smallest Index With Equal Value.cpp: -------------------------------------------------------------------------------- 1 | // 2057.✅ Smallest Index With Equal Value 2 | 3 | class Solution 4 | { 5 | public: 6 | int smallestEqual(vector &nums) 7 | { 8 | 9 | set s; 10 | 11 | for (int i = 0; i < nums.size(); ++i) 12 | { 13 | if (i % 10 == nums[i]) 14 | { 15 | s.insert(i); 16 | } 17 | } 18 | 19 | if (s.size() == 0) 20 | return -1; 21 | 22 | return *s.begin(); 23 | } 24 | }; 25 | -------------------------------------------------------------------------------- /2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2073-time-needed-to-buy-tickets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2089. Find Target Indices After Sorting Array.cpp: -------------------------------------------------------------------------------- 1 | // 2089.✅ Find Target Indices After Sorting Array 2 | 3 | class Solution 4 | { 5 | public: 6 | vector targetIndices(vector &nums, int target) 7 | { 8 | vector ans; 9 | sort(nums.begin(), nums.end()); 10 | 11 | for (int i = 0; i < nums.size(); i++) 12 | { 13 | if (target == nums[i]) 14 | ans.push_back(i); 15 | } 16 | 17 | return ans; 18 | } 19 | }; -------------------------------------------------------------------------------- /2090-k-radius-subarray-averages/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2091-removing-minimum-and-maximum-from-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2092-find-all-people-with-secret/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2101-detonate-the-maximum-bombs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2124. Check if All A's Appears Before All B's.cpp: -------------------------------------------------------------------------------- 1 | // 2124.✅ Check if All A's Appears Before All B's 2 | 3 | class Solution 4 | { 5 | public: 6 | bool checkString(string s) 7 | { 8 | return is_sorted(s.begin(), s.end()); 9 | } 10 | }; -------------------------------------------------------------------------------- /2125-number-of-laser-beams-in-a-bank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2134-minimum-swaps-to-group-all-1s-together-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2141-maximum-running-time-of-n-computers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2149-rearrange-array-elements-by-sign/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2160. Minimum Sum of Four Digit Number After Splitting Digits.cpp: -------------------------------------------------------------------------------- 1 | // 2160.✅ Minimum Sum of Four Digit Number After Splitting Digits 2 | 3 | class Solution 4 | { 5 | public: 6 | int minimumSum(int num) 7 | { 8 | string s = to_string(num); 9 | 10 | sort(s.begin(), s.end()); 11 | 12 | int res = (s[0] - '0' + s[1] - '0') * 10 + s[2] - '0' + s[3] - '0'; 13 | 14 | return res; 15 | } 16 | }; -------------------------------------------------------------------------------- /2169. Count Operations to Obtain Zero.cpp: -------------------------------------------------------------------------------- 1 | // 2169.✅ Count Operations to Obtain Zero 2 | 3 | class Solution 4 | { 5 | public: 6 | int countOperations(int num1, int num2) 7 | { 8 | long ind = 0; 9 | while (num1 != 0 && num2 != 0) 10 | { 11 | if (num1 >= num2) 12 | num1 -= num2; 13 | else 14 | num2 -= num1; 15 | ++ind; 16 | } 17 | 18 | return ind; 19 | } 20 | }; 21 | -------------------------------------------------------------------------------- /2177. Find Three Consecutive Integers That Sum to a Given Numbe.cpp: -------------------------------------------------------------------------------- 1 | // 2177.✅ Find Three Consecutive Integers That Sum to a Given Number 2 | 3 | class Solution 4 | { 5 | public: 6 | vector sumOfThree(long long num) 7 | { 8 | 9 | vector v; 10 | 11 | long long x = num / 3; 12 | 13 | if ((x + 1) + x + (x - 1) == num) 14 | { 15 | v.push_back(x - 1); 16 | v.push_back(x); 17 | v.push_back(x + 1); 18 | } 19 | 20 | return v; 21 | } 22 | }; -------------------------------------------------------------------------------- /2187-minimum-time-to-complete-trips/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2218-maximum-value-of-k-coins-from-piles/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2225-find-players-with-zero-or-one-losses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2251-number-of-flowers-in-full-bloom/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2256-minimum-average-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2262-total-appeal-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2264-largest-3-same-digit-number-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2272-substring-with-largest-variance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2279-maximum-bags-with-full-capacity-of-rocks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2290-minimum-obstacle-removal-to-reach-corner/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2300-successful-pairs-of-spells-and-potions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2305-fair-distribution-of-cookies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2306-naming-a-company/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2328-number-of-increasing-paths-in-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2331-evaluate-boolean-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2336-smallest-number-in-infinite-set/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2342-max-sum-of-a-pair-with-equal-sum-of-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2343-query-kth-smallest-trimmed-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2351. First Letter to Appear Twice.cpp: -------------------------------------------------------------------------------- 1 | // 2351.✅ First Letter to Appear Twice 2 | 3 | class Solution 4 | { 5 | public: 6 | char repeatedCharacter(string s) 7 | { 8 | 9 | int count = 0; 10 | map mp; 11 | for (int i = 0; i < s.size(); ++i) 12 | { 13 | ++mp[s[i]]; 14 | if (mp[s[i]] == 2) 15 | return s[i]; 16 | } 17 | 18 | return -1; 19 | } 20 | }; -------------------------------------------------------------------------------- /2352-equal-row-and-column-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2353-design-a-food-rating-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2358-maximum-number-of-groups-entering-a-competition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2358. Maximum Number of Groups Entering a Competition.cpp: -------------------------------------------------------------------------------- 1 | // 2358.✅ Maximum Number of Groups Entering a Competition 2 | 3 | class Solution 4 | { 5 | public: 6 | int maximumGroups(vector &grades) 7 | { 8 | 9 | int n = grades.size(); 10 | int count = 0; 11 | 12 | int i = 1; 13 | while (n > 0) 14 | { 15 | n -= i++; 16 | ++count; 17 | } 18 | 19 | return n == 0 ? count : count - 1; 20 | } 21 | }; -------------------------------------------------------------------------------- /2359-find-closest-node-to-given-two-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2366-minimum-replacements-to-sort-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2369-check-if-there-is-a-valid-partition-for-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2389-longest-subsequence-with-limited-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2390-removing-stars-from-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2391-minimum-amount-of-time-to-collect-garbage/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2402-meeting-rooms-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2405-optimal-partition-of-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2418-sort-the-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2433-find-the-original-array-of-prefix-xor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2439-minimize-maximum-of-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2441-largest-positive-integer-that-exists-with-its-negative/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2444-count-subarrays-with-fixed-bounds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2462-total-cost-to-hire-k-workers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2477-minimum-fuel-cost-to-report-to-the-capital/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2482-difference-between-ones-and-zeros-in-row-and-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2483-minimum-penalty-for-a-shop/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2485-find-the-pivot-integer/2485-find-the-pivot-integer.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int pivotInteger(int n) { 4 | 5 | int tot = (n*(n+1))/2; 6 | 7 | for(int i = 1; i <= n; ++i) 8 | { 9 | int left = (i*(i+1))/2; 10 | int right = tot - left + i; 11 | 12 | if(left == right) 13 | return i; 14 | } 15 | 16 | return -1; 17 | } 18 | }; -------------------------------------------------------------------------------- /2485-find-the-pivot-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2486-append-characters-to-string-to-make-subsequence/2486-append-characters-to-string-to-make-subsequence.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int appendCharacters(string s, string t) { 4 | 5 | int idx = 0; 6 | 7 | for(int i = 0; i < s.size(); ++i) 8 | { 9 | if(t[idx] == s[i]) 10 | ++idx; 11 | if(idx == t.size()) 12 | return 0; 13 | } 14 | 15 | return t.size() - idx; 16 | 17 | } 18 | }; -------------------------------------------------------------------------------- /2487-remove-nodes-from-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | void delete_Node(ListNode* head) 2 | { 3 | ListNode *maxNode = head, *curr = head; 4 | while(curr && curr->next) 5 | { 6 | if(curr->next->val < maxNode->val) 7 | { 8 | ListNode* temp = curr->next; 9 | curr->next = temp->next; 10 | delete(temp); 11 | } 12 | else 13 | { 14 | curr = curr->next; 15 | maxNode = curr; 16 | } 17 | } 18 | } 19 | ListNode* removeNodes(ListNode* head) { 20 | head = reverseList(head); 21 | delete_Node(head); 22 | head = reverseList(head); 23 | return head; 24 | } 25 | }; -------------------------------------------------------------------------------- /2492-minimum-score-of-a-path-between-two-cities/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2508-add-edges-to-make-degrees-of-all-nodes-even/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2512-reward-top-k-students/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2516-take-k-of-each-character-from-left-and-right/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2542-maximum-subsequence-score/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2551-put-marbles-in-bags/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2567-minimum-score-by-changing-two-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2582-pass-the-pillow/2582-pass-the-pillow.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int passThePillow(int n, int time) { 4 | 5 | int fullChunks = time / (n-1); 6 | int extTime = time % (n-1); 7 | 8 | return (fullChunks & 1 ? n - extTime : extTime + 1); 9 | 10 | } 11 | }; -------------------------------------------------------------------------------- /2582-pass-the-pillow/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2591-distribute-money-to-maximum-children/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2597-the-number-of-beautiful-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2607-make-k-subarray-sums-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2610-convert-an-array-into-a-2d-array-with-conditions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2618-check-if-object-instance-of-class/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2619-array-prototype-last/2619-array-prototype-last.js: -------------------------------------------------------------------------------- 1 | Array.prototype.last = function() { 2 | if (this.length === 0) { 3 | return -1; 4 | } else { 5 | return this[this.length - 1]; 6 | } 7 | }; 8 | 9 | /** 10 | * const arr = [1, 2, 3]; 11 | * arr.last(); // 3 12 | */ -------------------------------------------------------------------------------- /2619-array-prototype-last/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2620-counter/2620-counter.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} n 3 | * @return {Function} counter 4 | */ 5 | var createCounter = function(n) { 6 | return function() { 7 | ++n; 8 | return n-1; 9 | }; 10 | }; 11 | 12 | /** 13 | * const counter = createCounter(10) 14 | * counter() // 10 15 | * counter() // 11 16 | * counter() // 12 17 | */ -------------------------------------------------------------------------------- /2620-counter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2621-sleep/2621-sleep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number} millis 3 | */ 4 | async function sleep(millis) { 5 | await new Promise(resolve => setTimeout(resolve, millis)); 6 | } 7 | 8 | /** 9 | * let t = Date.now() 10 | * sleep(100).then(() => console.log(Date.now() - t)) // 100 11 | */ -------------------------------------------------------------------------------- /2621-sleep/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2622-cache-with-time-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2623-memoize/2623-memoize.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {Function} fn 3 | */ 4 | function memoize(fn) { 5 | const mem = {}; 6 | return function(...args) { 7 | if (mem[args] !== undefined) return mem[args]; 8 | mem[args] = fn(...args); 9 | return mem[args] 10 | } 11 | } 12 | 13 | 14 | /** 15 | * let callCount = 0; 16 | * const memoizedFn = memoize(function (a, b) { 17 | * callCount += 1; 18 | * return a + b; 19 | * }) 20 | * memoizedFn(2, 3) // 5 21 | * memoizedFn(2, 3) // 5 22 | * console.log(callCount) // 1 23 | */ -------------------------------------------------------------------------------- /2623-memoize/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2625-flatten-deeply-nested-array/2625-flatten-deeply-nested-array.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {any[]} arr 3 | * @param {number} depth 4 | * @return {any[]} 5 | */ 6 | var flat = function (arr, n) { 7 | 8 | if(n == 0 || arr.every((item) => !Array.isArray(item))) return arr; 9 | const result = []; 10 | for(let i=0;i { 10 | clearTimeout(timeout) 11 | timeout = setTimeout(fn, t, ...args) 12 | } 13 | }; 14 | 15 | /** 16 | * const log = debounce(console.log, 100); 17 | * log('Hello'); // cancelled 18 | * log('Hello'); // cancelled 19 | * log('Hello'); // Logged at t=100ms 20 | */ -------------------------------------------------------------------------------- /2628-json-deep-equal/2628-json-deep-equal.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {any} o1 3 | * @param {any} o2 4 | * @return {boolean} 5 | */ 6 | var areDeeplyEqual = function(o1, o2) { 7 | 8 | 9 | return _.isEqual(o1,o2); 10 | }; -------------------------------------------------------------------------------- /2628-json-deep-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2631-group-by/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2632-curry/2632-curry.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {Function} fn 3 | * @return {Function} 4 | */ 5 | var curry = function(fn) { 6 | return function curried(...args) { 7 | if (fn.length === args.length) { 8 | return fn(...args); 9 | } else { 10 | return function(...newArgs) { 11 | return curried(...args, ...newArgs) 12 | } 13 | } 14 | }; 15 | }; 16 | 17 | /** 18 | * function sum(a, b) { return a + b; } 19 | * const csum = curry(sum); 20 | * csum(1)(2) // 3 21 | */ 22 | -------------------------------------------------------------------------------- /2632-curry/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2633-convert-object-to-json-string/2633-convert-object-to-json-string.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {any} object 3 | * @return {string} 4 | */ 5 | var jsonStringify = function(object) { 6 | 7 | var ans = JSON.stringify(object); 8 | 9 | return ans; 10 | }; -------------------------------------------------------------------------------- /2633-convert-object-to-json-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2634-filter-elements-from-array/2634-filter-elements-from-array.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} arr 3 | * @param {Function} fn 4 | * @return {number[]} 5 | */ 6 | var filter = function(arr, fn) { 7 | 8 | var ans = []; 9 | 10 | for(var i = 0; i < arr.length; ++i) 11 | { 12 | if(fn(arr[i], i)) 13 | ans.push(arr[i]); 14 | } 15 | 16 | return ans; 17 | 18 | }; 19 | 20 | -------------------------------------------------------------------------------- /2634-filter-elements-from-array/2634-filter-elements-from-array.ts: -------------------------------------------------------------------------------- 1 | function filter(arr: number[], fn: (n: number, i: number) => any): number[] { 2 | 3 | const ans : number[] = []; 4 | 5 | for(var i = 0; i < arr.length; ++i) 6 | { 7 | if(fn(arr[i],i)) 8 | ans.push(arr[i]); 9 | } 10 | 11 | return ans; 12 | }; 13 | -------------------------------------------------------------------------------- /2634-filter-elements-from-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2635-apply-transform-over-each-element-in-array/2635-apply-transform-over-each-element-in-array.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} arr 3 | * @param {Function} fn 4 | * @return {number[]} 5 | */ 6 | var map = function(arr, fn) { 7 | var mp = []; 8 | 9 | for(var i = 0; i < arr.length; ++i) 10 | mp.push(fn(arr[i],i)); 11 | 12 | return mp; 13 | }; 14 | -------------------------------------------------------------------------------- /2635-apply-transform-over-each-element-in-array/2635-apply-transform-over-each-element-in-array.ts: -------------------------------------------------------------------------------- 1 | function map(arr: number[], fn: (n: number, i: number) => number): number[] { 2 | 3 | const mp : number[] = []; 4 | 5 | for(var i = 0; i < arr.length; ++i) 6 | mp.push(fn(arr[i],i)); 7 | 8 | return mp; 9 | }; -------------------------------------------------------------------------------- /2635-apply-transform-over-each-element-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2637-promise-time-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2642-design-graph-with-shortest-path-calculator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2648-generate-fibonacci-sequence/2648-generate-fibonacci-sequence.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @return {Generator} 3 | */ 4 | var fibGenerator = function*() { 5 | let a = 0; 6 | let b = 1; 7 | 8 | while (true){ 9 | yield a; 10 | [a,b] = [b,a+b]; 11 | } 12 | 13 | }; 14 | 15 | /** 16 | * const gen = fibGenerator(); 17 | * gen.next().value; // 0 18 | * gen.next().value; // 1 19 | */ -------------------------------------------------------------------------------- /2649-nested-array-generator/2649-nested-array-generator.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {Array} arr 3 | * @return {Generator} 4 | */ 5 | var inorderTraversal = function*(arr) { 6 | 7 | for (let i = 0; i < arr.length; i++){ 8 | 9 | if (Array.isArray(arr[i]))yield* inorderTraversal(arr[i]) 10 | 11 | else yield arr[i] 12 | 13 | } 14 | }; 15 | /** 16 | * const gen = inorderTraversal([1, [2, 3]]); 17 | * gen.next().value; // 1 18 | * gen.next().value; // 2 19 | * gen.next().value; // 3 20 | */ -------------------------------------------------------------------------------- /2649-nested-array-generator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2661-first-completely-painted-row-or-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2665-counter-ii/2665-counter-ii.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {integer} init 3 | * @return { increment: Function, decrement: Function, reset: Function } 4 | */ 5 | var createCounter = function(init) { 6 | let cnt = init; 7 | return{ 8 | increment: () => cnt+=1, decrement: () => cnt-=1, reset: () => (cnt=init), 9 | } 10 | }; 11 | 12 | /** 13 | * const counter = createCounter(5) 14 | * counter.increment(); // 6 15 | * counter.reset(); // 5 16 | * counter.decrement(); // 4 17 | */ 18 | 19 | -------------------------------------------------------------------------------- /2666-allow-one-function-call/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2667-create-hello-world-function/2667-create-hello-world-function.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @return {Function} 3 | */ 4 | var createHelloWorld = function() { 5 | return function(...args) { 6 | return "Hello World"; 7 | } 8 | }; 9 | 10 | /** 11 | * const f = createHelloWorld(); 12 | * f(); // "Hello World" 13 | */ -------------------------------------------------------------------------------- /2675-array-of-objects-to-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2676-throttle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2677-chunk-array/2677-chunk-array.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {Array} arr 3 | * @param {number} size 4 | * @return {Array[]} 5 | */ 6 | var chunk = function(arr, size) { 7 | var ans = []; 8 | var index = 0; 9 | 10 | while (index < arr.length) { 11 | ans.push(arr.slice(index, index + size)); 12 | index += size; 13 | } 14 | 15 | return ans; 16 | }; 17 | -------------------------------------------------------------------------------- /2677-chunk-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2678-number-of-senior-citizens/2678-number-of-senior-citizens.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int countSeniors(vector& details) { 4 | 5 | int cnt = 0; 6 | 7 | for(auto& str : details) 8 | { 9 | cnt += (stoi(str.substr(11, 2)) > 60); 10 | } 11 | 12 | return cnt; 13 | } 14 | }; -------------------------------------------------------------------------------- /2680-maximum-or/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2693-call-function-with-custom-context/2693-call-function-with-custom-context.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {Object} context 3 | * @param {any[]} args 4 | * @return {any} 5 | */ 6 | Function.prototype.callPolyfill = function(context, ...args) { 7 | let a = Symbol(); 8 | context[a] = this; 9 | let res = context[a](...args); 10 | delete context[a]; 11 | 12 | return res; 13 | } 14 | 15 | /** 16 | * function increment() { this.count++; return this.count; } 17 | * increment.callPolyfill({count: 1}); // 2 18 | */ -------------------------------------------------------------------------------- /2695-array-wrapper/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2698-find-the-punishment-number-of-an-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2706-buy-two-chocolates/2706-buy-two-chocolates.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int buyChoco(vector& prices, int money) { 4 | sort(prices.begin(), prices.end()); 5 | int sum = prices[0] + prices[1]; 6 | return (sum > money)?money: (money - sum); 7 | } 8 | }; -------------------------------------------------------------------------------- /2706-buy-two-chocolates/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2709-greatest-common-divisor-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2741-special-permutations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2742-painting-the-walls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2785-sort-vowels-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2811-check-if-it-is-possible-to-split-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2812-find-the-safest-path-in-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2816-double-a-number-represented-as-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2833-furthest-point-from-origin/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2849-determine-if-a-cell-is-reachable-at-a-given-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2864-maximum-odd-binary-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2949-count-beautiful-substrings-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2958-length-of-longest-subarray-with-at-most-k-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2962-count-subarrays-where-max-element-appears-at-least-k-times/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2963-count-the-number-of-good-partitions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2966-divide-array-into-arrays-with-max-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2971-find-polygon-with-the-largest-perimeter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3035-maximum-palindromes-after-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3068-find-the-maximum-sum-of-node-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3110-score-of-a-string/3110-score-of-a-string.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int scoreOfString(string s) { 4 | 5 | int n = s.size(); 6 | 7 | int ans = 0; 8 | 9 | for(int i = 1; i < n; ++i) 10 | { 11 | ans += abs((s[i] - 'a') - (s[i-1] - 'a')); 12 | } 13 | 14 | return ans; 15 | } 16 | }; -------------------------------------------------------------------------------- /3137-minimum-number-of-operations-to-make-word-k-periodic/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3138-minimum-length-of-anagram-concatenation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3139-minimum-cost-to-equalize-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3169-count-days-without-meetings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3186-maximum-total-damage-with-spell-casting/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3202-find-the-maximum-length-of-valid-subsequence-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /6911-continuous-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ --------------------------------------------------------------------------------