| .. |
|
alternating-groups-ii.kt
|
kt: add «3208. Alternating Groups II»
|
2025-03-09 20:40:28 +01:00 |
|
apply-operations-to-an-array.kt
|
kt: add «2460. Apply Operations to an Array»
|
2025-03-01 13:52:50 +01:00 |
|
binary-tree-inorder-traversal.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
binary-tree-level-order-traversal.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
check-if-every-row-and-column-contains-all-numbers.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
check-if-number-is-a-sum-of-powers-of-three.kt
|
kt: add «1780. Check if Number is a Sum of Powers of Three»
|
2025-03-04 09:38:55 +01:00 |
|
circular-sentence.kt
|
kt: add «2490. Circular Sentence»
|
2024-11-02 12:59:28 +01:00 |
|
clear-digits.kt
|
kt: add «3174. Clear Digits»
|
2025-02-10 08:54:23 +01:00 |
|
climbing-stairs.kt
|
kt: add «70. Climbing Stairs»
|
2025-02-06 21:59:59 +01:00 |
|
closest-prime-numbers-in-range.kt
|
kt: add «2523. Closest Prime Numbers in Range»
|
2025-03-07 09:41:29 +01:00 |
|
coin-change.kt
|
kt: add «322. Coin Change»
|
2025-03-20 15:24:41 +01:00 |
|
construct-binary-tree-from-preorder-and-postorder-traversal.kt
|
kt: add «889. Construct Binary Tree from Preorder and Postorder Traversal»
|
2025-02-23 20:51:19 +01:00 |
|
construct-smallest-number-from-di-string.kt
|
kt: add «2375. Construct Smallest Number From DI String»
|
2025-02-18 14:57:42 +01:00 |
|
construct-string-from-binary-tree.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
construct-the-lexicographically-largest-valid-sequence.kt
|
kt: add «1718. Construct the Lexicographically Largest Valid Sequence»
|
2025-02-16 21:02:05 +01:00 |
|
container-with-most-water.kt
|
kt: add «11. Container With Most Water»
|
2025-02-08 23:44:24 +01:00 |
|
count-number-of-bad-pairs.kt
|
kt: add «2364. Count Number of Bad Pairs»
|
2025-02-09 14:09:34 +01:00 |
|
count-of-substrings-containing-every-vowel-and-k-consonants-ii.kt
|
kt: add «3306. Count of Substrings Containing Every Vowel and K Consonants II»
|
2025-03-10 18:13:12 +01:00 |
|
count-square-submatrices-with-all-ones.kt
|
kt: add «1277. Count Square Submatrices with All Ones»
|
2024-10-27 22:54:59 +01:00 |
|
count-the-number-of-complete-components.kt
|
kt: add «2685. Count the Number of Complete Components»
|
2025-03-22 23:22:58 +01:00 |
|
count-the-number-of-fair-pairs.kt
|
kt: add «2563. Count the Number of Fair Pairs»
|
2024-11-13 17:19:49 +01:00 |
|
count-total-number-of-colored-cells.kt
|
kt: add «2579. Count Total Number of Colored Cells»
|
2025-03-05 09:26:30 +01:00 |
|
count-unguarded-cells-in-the-grid.kt
|
kt: add «2257. Count Unguarded Cells in the Grid»
|
2024-11-21 23:53:36 +01:00 |
|
defuse-the-bomb.kt
|
kt: add «1652. Defuse the Bomb»
|
2024-11-19 22:51:32 +01:00 |
|
delete-characters-to-make-fancy-string.kt
|
kt: add «1957. Delete Characters to Make Fancy String»
|
2024-11-02 00:01:10 +01:00 |
|
delete-leaves-with-a-given-value.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
double-a-number-represented-as-a-linked-list.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
evaluate-reverse-polish-notation.kt
|
kt: add «150. Evaluate Reverse Polish Notation»
|
2025-02-08 23:25:40 +01:00 |
|
find-champion-ii.kt
|
kt: add «2924. Find Champion II»
|
2024-11-26 15:16:27 +01:00 |
|
find-elements-in-a-contaminated-binary-tree.kt
|
kt: add «1261. Find Elements in a Contaminated Binary Tree»
|
2025-02-21 15:13:26 +01:00 |
|
find-if-array-can-be-sorted.kt
|
kt: add «3011. Find if Array Can Be Sorted»
|
2024-11-06 21:41:21 +01:00 |
|
find-missing-and-repeated-values.kt
|
kt: add «2965. Find Missing and Repeated Values»
|
2025-03-06 09:39:16 +01:00 |
|
find-the-count-of-good-integers.kt
|
kt: refactor «3272. Find the Count of Good Integers»
|
2025-04-12 11:41:24 +02:00 |
|
find-the-number-of-distinct-colors-among-the-balls.kt
|
kt: add «3160. Find the Number of Distinct Colors Among the Balls»
|
2025-02-07 10:21:05 +01:00 |
|
find-the-power-of-k-size-subarrays-i.kt
|
kt: add «3254. Find the Power of K-Size Subarrays I»
|
2024-11-16 21:20:02 +01:00 |
|
find-the-punishment-number-of-an-integer.kt
|
kt: add «2698. Find the Punishment Number of an Integer»
|
2025-02-15 11:14:29 +01:00 |
|
find-unique-binary-string.kt
|
kt: add «1980. Find Unique Binary String»
|
2025-02-20 11:11:23 +01:00 |
|
first-unique-character-in-a-string.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
flip-columns-for-maximum-number-of-equal-rows.kt
|
kt: add «1072. Flip Columns For Maximum Number of Equal Rows»
|
2024-11-22 17:49:39 +01:00 |
|
house-robber-iv.kt
|
kt: add «2560. House Robber IV»
|
2025-03-17 11:20:03 +01:00 |
|
house-robber.kt
|
kt: add «198. House Robber»
|
2025-02-06 22:06:39 +01:00 |
|
integer-to-roman.kt
|
kt: add «12. Integer to Roman»
|
2025-03-05 19:01:30 +01:00 |
|
is-subsequence.kt
|
kt: add «392. Is Subsequence»
|
2025-02-08 23:39:01 +01:00 |
|
iterator-for-combination.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
largest-3-same-digit-number-in-string.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
largest-combination-with-bitwise-and-greater-than-zero.kt
|
kt: add «2275. Largest Combination With Bitwise AND Greater Than Zero»
|
2024-11-07 22:11:06 +01:00 |
|
length-of-last-word.kt
|
kt: add «58. Length of Last Word»
|
2025-02-04 21:22:59 +01:00 |
|
length-of-longest-fibonacci-subsequence.kt
|
kt: add «873. Length of Longest Fibonacci Subsequence»
|
2025-02-27 10:14:37 +01:00 |
|
letter-tile-possibilities.kt
|
kt: add «1079. Letter Tile Possibilities»
|
2025-02-17 18:50:55 +01:00 |
|
linked-list-cycle.kt
|
kt: add «141. Linked List Cycle»
|
2025-02-08 23:10:33 +01:00 |
|
longest-common-prefix.kt
|
kt: add «14. Longest Common Prefix»
|
2025-03-05 20:21:29 +01:00 |
|
longest-increasing-subsequence.kt
|
kt: add «300. Longest Increasing Subsequence»
|
2025-02-06 22:18:48 +01:00 |
|
longest-nice-subarray.kt
|
kt: add «2401. Longest Nice Subarray»
|
2025-03-18 19:08:40 +01:00 |
|
longest-square-streak-in-an-array.kt
|
kt: add «2501. Longest Square Streak in an Array»
|
2024-10-28 22:53:48 +01:00 |
|
lowest-common-ancestor-of-a-binary-search-tree.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
lowest-common-ancestor-of-deepest-leaves.kt
|
kt: add «1123. Lowest Common Ancestor of Deepest Leaves»
|
2025-04-04 12:35:18 +02:00 |
|
max-area-of-island.kt
|
style(kt): reformat ‹695. Max Area of Island›
|
2024-05-17 18:24:25 +02:00 |
|
max-sum-of-a-pair-with-equal-sum-of-digits.kt
|
kt: add «2342. Max Sum of a Pair With Equal Sum of Digits»
|
2025-02-12 22:32:31 +01:00 |
|
maximize-distance-to-closest-person.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
maximum-absolute-sum-of-any-subarray.kt
|
kt: add «1749. Maximum Absolute Sum of Any Subarray»
|
2025-02-26 09:39:49 +01:00 |
|
maximum-candies-allocated-to-k-children.kt
|
kt: add «2226. Maximum Candies Allocated to K Children»
|
2025-03-14 18:26:26 +01:00 |
|
maximum-matrix-sum.kt
|
kt: add «1975. Maximum Matrix Sum»
|
2024-11-24 22:19:59 +01:00 |
|
maximum-number-of-moves-in-a-grid.kt
|
kt: add «2684. Maximum Number of Moves in a Grid»
|
2024-10-29 23:36:45 +01:00 |
|
maximum-sum-of-distinct-subarrays-with-length-k.kt
|
kt: add «2461. Maximum Sum of Distinct Subarrays With Length K»
|
2024-11-19 22:51:32 +01:00 |
|
maximum-units-on-a-truck.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
maximum-xor-for-each-query.kt
|
kt: add «1829. Maximum XOR for Each Query»
|
2024-11-08 14:35:00 +01:00 |
|
merge-two-2d-arrays-by-summing-values.kt
|
kt: add «2570. Merge Two 2D Arrays by Summing Values»
|
2025-03-02 16:40:34 +01:00 |
|
merge-two-sorted-lists.kt
|
kt: add «21. Merge Two Sorted Lists»
|
2025-02-08 23:06:53 +01:00 |
|
minimized-maximum-of-products-distributed-to-any-store.kt
|
kt: add «2064. Minimized Maximum of Products Distributed to Any Store»
|
2024-11-14 22:45:40 +01:00 |
|
minimum-array-end.kt
|
kt: add «3133. Minimum Array End»
|
2024-11-09 23:17:59 +01:00 |
|
minimum-number-of-arrows-to-burst-balloons.kt
|
kt: add «452. Minimum Number of Arrows to Burst Balloons»
|
2025-02-09 22:54:39 +01:00 |
|
minimum-number-of-changes-to-make-binary-string-beautiful.kt
|
kt: add «2914. Minimum Number of Changes to Make Binary String Beautiful»
|
2024-11-06 09:33:27 +01:00 |
|
minimum-number-of-operations-to-make-elements-in-array-distinct.kt
|
kt: add «3396. Minimum Number of Operations to Make Elements in Array Distinct»
|
2025-04-08 19:49:10 +02:00 |
|
minimum-number-of-refueling-stops.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
minimum-number-of-removals-to-make-mountain-array.kt
|
kt: add «1671. Minimum Number of Removals to Make Mountain Array»
|
2024-10-31 00:09:24 +01:00 |
|
minimum-obstacle-removal-to-reach-corner.kt
|
kt: add «2290. Minimum Obstacle Removal to Reach Corner»
|
2024-11-29 22:09:20 +01:00 |
|
minimum-operations-to-make-a-uni-value-grid.kt
|
kt: add «2033. Minimum Operations to Make a Uni-Value Grid»
|
2025-03-26 08:29:21 +01:00 |
|
minimum-recolors-to-get-k-consecutive-black-blocks.kt
|
kt: add «2379. Minimum Recolors to Get K Consecutive Black Blocks»
|
2025-03-08 11:19:33 +01:00 |
|
minimum-time-visiting-all-points.kt
|
chore: unwrap one layer
|
2023-12-12 14:36:00 +01:00 |
|
minimum-total-distance-traveled.kt
|
kt: add «2463. Minimum Total Distance Traveled»
|
2024-10-31 23:38:41 +01:00 |
|
minimum-window-substring.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
most-beautiful-item-for-each-query.kt
|
kt: add «2070. Most Beautiful Item for Each Query»
|
2024-11-12 15:44:00 +01:00 |
|
most-profitable-path-in-a-tree.kt
|
kt: add «2467. Most Profitable Path in a Tree»
|
2025-02-24 10:23:04 +01:00 |
|
number-of-sub-arrays-with-odd-sum.kt
|
kt: add «1524. Number of Sub-arrays With Odd Sum»
|
2025-02-25 15:41:11 +01:00 |
|
partition-array-according-to-given-pivot.kt
|
kt: add «2161. Partition Array According to Given Pivot»
|
2025-03-03 20:37:46 +01:00 |
|
partition-equal-subset-sum.kt
|
kt: add «416. Partition Equal Subset Sum»
|
2025-04-07 12:20:00 +02:00 |
|
partition-labels.kt
|
kt: add «763. Partition Labels»
|
2025-03-30 13:36:09 +02:00 |
|
power-of-three.kt
|
chore: unwrap one layer
|
2023-12-12 14:36:00 +01:00 |
|
prime-subtraction-operation.kt
|
kt: add «2601. Prime Subtraction Operation»
|
2024-11-12 00:03:52 +01:00 |
|
product-of-the-last-k-numbers.kt
|
kt: add «1352. Product of the Last K Numbers»
|
2025-02-14 11:44:01 +01:00 |
|
put-marbles-in-bags.kt
|
kt: add «2551. Put Marbles in Bags»
|
2025-03-31 08:40:12 +02:00 |
|
recover-a-tree-from-preorder-traversal.kt
|
kt: add «1028. Recover a Tree From Preorder Traversal»
|
2025-02-23 20:42:11 +01:00 |
|
remove-all-occurrences-of-a-substring.kt
|
kt: add «1910. Remove All Occurrences of a Substring»
|
2025-02-11 14:33:15 +01:00 |
|
remove-nodes-from-linked-list.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
reverse-words-in-a-string.kt
|
kt: add «151. Reverse Words in a String»
|
2025-02-04 21:20:29 +01:00 |
|
richest-customer-wealth.kt
|
chore: unwrap one layer
|
2023-12-12 14:36:00 +01:00 |
|
roman-to-integer.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
rotate-string.kt
|
kt: add «796. Rotate String»
|
2024-11-03 20:16:21 +01:00 |
|
rotating-the-box.kt
|
kt: add «1861. Rotating the Box»
|
2024-11-24 00:00:13 +01:00 |
|
shortest-common-supersequence.kt
|
kt: add «1092. Shortest Common Supersequence»
|
2025-02-28 08:58:44 +01:00 |
|
shortest-distance-after-road-addition-queries-i.kt
|
kt: add «3243. Shortest Distance After Road Addition Queries I»
|
2024-11-27 22:13:03 +01:00 |
|
shortest-subarray-to-be-removed-to-make-array-sorted.kt
|
kt: add «1574. Shortest Subarray to be Removed to Make Array Sorted»
|
2024-11-15 23:25:03 +01:00 |
|
shortest-subarray-with-or-at-least-k-ii.kt
|
kt: add «3097. Shortest Subarray With OR at Least K II»
|
2024-11-10 19:16:43 +01:00 |
|
shortest-subarray-with-sum-at-least-k.kt
|
kt: add «862. Shortest Subarray with Sum at Least K»
|
2024-11-17 20:40:55 +01:00 |
|
sliding-puzzle.kt
|
kt: add «773. Sliding Puzzle»
|
2024-11-26 00:02:35 +01:00 |
|
solving-questions-with-brainpower.kt
|
kt: add «2140. Solving Questions With Brainpower»
|
2025-04-01 09:38:23 +02:00 |
|
split-array-into-consecutive-subsequences.kt
|
chore: unwrap one layer
|
2023-12-12 14:36:00 +01:00 |
|
string-compression-iii.kt
|
kt: add «3163. String Compression III»
|
2024-11-04 22:21:14 +01:00 |
|
student-attendance-record-ii.kt
|
kt: add «552. Student Attendance Record II»
|
2024-05-27 00:51:20 +02:00 |
|
substring-with-concatenation-of-all-words.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
sum-of-all-subset-xor-totals.kt
|
kt: add «1863. Sum of All Subset XOR Totals»
|
2024-05-20 15:47:02 +02:00 |
|
take-k-of-each-character-from-left-and-right.kt
|
kt: add «2516. Take K of Each Character From Left and Right»
|
2024-11-20 11:39:07 +01:00 |
|
the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.kt
|
kt: add «1415. The k-th Lexicographical String of All Happy Strings of Length n»
|
2025-02-19 08:18:11 +01:00 |
|
TreeNode.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
tuple-with-same-product.kt
|
kt: add «1726. Tuple with Same Product»
|
2025-02-06 15:17:44 +01:00 |
|
unique-morse-code-words.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
|
valid-arrangement-of-pairs.kt
|
kt: add «2097. Valid Arrangement of Pairs»
|
2024-11-30 11:25:07 +01:00 |
|
valid-palindrome.kt
|
kt: add «125. Valid Palindrome»
|
2025-03-05 22:35:34 +01:00 |
|
validate-binary-search-tree.kt
|
kt: keep ‹TreeNode› only once
|
2025-02-21 14:58:55 +01:00 |
|
word-break-ii.kt
|
kt: add «140. Word Break II»
|
2024-05-26 00:41:14 +02:00 |
|
word-ladder-ii.kt
|
style(kt): reformat the files
|
2024-05-17 18:23:38 +02:00 |
