| .. |
|
2-keys-keyboard.go
|
go: add «650. 2 Keys Keyboard»
|
2024-08-19 12:01:36 +02:00 |
|
all-ancestors-of-a-node-in-a-directed-acyclic-graph.go
|
go: add «2192. All Ancestors of a Node in a Directed Acyclic Graph»
|
2024-06-29 14:17:47 +02:00 |
|
append-characters-to-string-to-make-subsequence.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
asteroid-collision.go
|
go: add «735. Asteroid Collision»
|
2024-08-12 23:43:50 +02:00 |
|
average-waiting-time.go
|
go: add «1701. Average Waiting Time»
|
2024-07-09 09:52:12 +02:00 |
|
balance-a-binary-search-tree.go
|
go: add «1382. Balance a Binary Search Tree»
|
2024-06-26 14:33:37 +02:00 |
|
binary-search-tree-to-greater-sum-tree.go
|
go: add «1038. Binary Search Tree to Greater Sum Tree»
|
2024-06-25 17:35:08 +02:00 |
|
build-a-matrix-with-conditions.go
|
go: add «2392. Build a Matrix With Conditions»
|
2024-07-21 23:13:29 +02:00 |
|
continuous-subarray-sum.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
count-number-of-nice-subarrays.go
|
go: add «1248. Count Number of Nice Subarrays»
|
2024-06-22 19:42:32 +02:00 |
|
count-triplets-that-can-form-two-arrays-of-equal-xor.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
crawler-log-folder.go
|
go: add «1598. Crawler Log Folder»
|
2024-07-10 10:06:31 +02:00 |
|
delete-nodes-and-return-forest.go
|
go: add «1110. Delete Nodes And Return Forest»
|
2024-07-17 09:25:50 +02:00 |
|
diameter-of-binary-tree.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
domino-and-tromino-tiling.go
|
go: add «790. Domino and Tromino Tiling»
|
2024-08-03 21:41:39 +02:00 |
|
edit-distance.go
|
go: add «72. Edit Distance»
|
2024-08-05 00:03:44 +02:00 |
|
filling-bookcase-shelves.go
|
go: add «1105. Filling Bookcase Shelves»
|
2024-07-31 10:49:26 +02:00 |
|
find-center-of-star-graph.go
|
go: add «1791. Find Center of Star Graph»
|
2024-06-27 22:13:20 +02:00 |
|
find-common-characters.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
find-k-th-smallest-pair-distance.go
|
go: add «719. Find K-th Smallest Pair Distance»
|
2024-08-14 21:39:14 +02:00 |
|
find-peak-element.go
|
go: add «162. Find Peak Element»
|
2024-08-19 21:19:11 +02:00 |
|
find-the-minimum-and-maximum-number-of-nodes-between-critical-points.go
|
go: add «2058. Find the Minimum and Maximum Number of Nodes Between Critical Points»
|
2024-07-05 13:20:47 +02:00 |
|
find-the-winner-of-the-circular-game.go
|
go: add «1823. Find the Winner of the Circular Game»
|
2024-07-08 13:52:37 +02:00 |
|
find-valid-matrix-given-row-and-column-sums.go
|
go: add «1605. Find Valid Matrix Given Row and Column Sums»
|
2024-07-20 22:18:52 +02:00 |
|
get-equal-substrings-within-budget.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
go.mod
|
chore(go): use older minimal version
|
2024-08-06 23:16:27 +02:00 |
|
go.sum
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
greatest-common-divisor-of-strings.go
|
go: add «1071. Greatest Common Divisor of Strings»
|
2024-08-12 17:40:55 +02:00 |
|
grumpy-bookstore-owner.go
|
go: add «1052. Grumpy Bookstore Owner»
|
2024-06-21 23:04:40 +02:00 |
|
height-checker.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
implement-queue-using-stacks.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
implement-queue-using-stacks_test.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
implement-trie-prefix-tree.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
increasing-triplet-subsequence.go
|
go: add «334. Increasing Triplet Sequence»
|
2024-08-12 20:39:49 +02:00 |
|
intersection-of-two-arrays-ii.go
|
go: add «350. Intersection of Two Arrays II»
|
2024-07-02 15:38:49 +02:00 |
|
ipo.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
is-subsequence.go
|
go: add «392. Is Subsequence»
|
2024-08-12 20:48:41 +02:00 |
|
keys-and-rooms.go
|
go: add «841. Keys and Rooms»
|
2024-08-09 00:17:56 +02:00 |
|
listnode.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.go
|
go: add «1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit»
|
2024-06-23 22:17:38 +02:00 |
|
longest-palindrome.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
magnetic-force-between-two-balls.go
|
go: add «1552. Magnetic Force Between Two Balls»
|
2024-06-20 19:57:55 +02:00 |
|
make-two-arrays-equal-by-reversing-subarrays.go
|
go: add «1460. Make Two Arrays Equal by Reversing Subarrays»
|
2024-08-03 17:47:12 +02:00 |
|
max-number-of-k-sum-pairs.go
|
go: add «1679. Max Number of K-Sum Pairs»
|
2024-08-15 18:27:01 +02:00 |
|
maximum-distance-in-arrays.go
|
go: add «624. Maximum Distance in Arrays»
|
2024-08-16 11:19:25 +02:00 |
|
maximum-number-of-vowels-in-a-substring-of-given-length.go
|
go: add «1456. Maximum Number of Vowels in a Substring of Given Length»
|
2024-08-12 17:15:28 +02:00 |
|
maximum-score-from-removing-substrings.go
|
go: add «1717. Maximum Score From Removing Substrings»
|
2024-07-12 11:09:11 +02:00 |
|
maximum-total-importance-of-roads.go
|
go: add «2285. Maximum Total Importance of Roads»
|
2024-06-28 23:56:30 +02:00 |
|
merge-nodes-in-between-zeros.go
|
go: add «2181. Merge Nodes in Between Zeros»
|
2024-07-04 13:51:06 +02:00 |
|
middle-of-the-linked-list.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
minimum-deletions-to-make-string-balanced.go
|
go: add «1653. Minimum Deletions to Make String Balanced»
|
2024-07-30 11:30:23 +02:00 |
|
minimum-difference-between-largest-and-smallest-value-in-three-moves.go
|
go: add «1509. Minimum Difference Between Largest and Smallest Value in Three Moves»
|
2024-07-03 09:57:36 +02:00 |
|
minimum-increment-to-make-array-unique.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
minimum-number-of-days-to-make-m-bouquets.go
|
go: add «1482. Minimum Number of Days to Make m Bouquets»
|
2024-06-19 10:38:59 +02:00 |
|
minimum-number-of-k-consecutive-bit-flips.go
|
go: add «995. Minimum Number of K Consecutive Bit Flips»
|
2024-06-24 16:52:40 +02:00 |
|
minimum-number-of-moves-to-seat-everyone.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
most-profit-assigning-work.go
|
go: add «826. Most Profit Assigning Work»
|
2024-06-18 12:10:43 +02:00 |
|
number-of-atoms.go
|
go: add «726. Number of Atoms»
|
2024-07-14 22:36:19 +02:00 |
|
number-of-atoms_test.go
|
go: add «726. Number of Atoms»
|
2024-07-14 22:36:19 +02:00 |
|
number-of-steps-to-reduce-a-number-in-binary-representation-to-one.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
odd-even-linked-list.go
|
go: add «328. Odd Even Linked List»
|
2024-08-15 20:23:28 +02:00 |
|
palindrome-partitioning.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
palindromic-substrings.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
pass-the-pillow.go
|
go: add «2582. Pass the Pillow»
|
2024-07-06 11:05:16 +02:00 |
|
patching-array.go
|
go: add «330. Patching Array»
|
2024-06-16 11:46:41 +02:00 |
|
patching-array_test.go
|
go: add «330. Patching Array»
|
2024-06-16 11:46:41 +02:00 |
|
range-sum-of-sorted-subarray-sums.go
|
go: add «1508. Range Sum of Sorted Subarray Sums»
|
2024-08-04 14:36:18 +02:00 |
|
regions-cut-by-slashes.go
|
go: add «959. Regions Cut By Slashes»
|
2024-08-10 11:13:11 +02:00 |
|
relative-sort-array.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
remove-max-number-of-edges-to-keep-graph-fully-traversable.go
|
go: add «1579. Remove Max Number of Edges to Keep Graph Fully Traversable»
|
2024-06-30 12:34:59 +02:00 |
|
remove-nth-node-from-end-of-list.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
reorder-routes-to-make-all-paths-lead-to-the-city-zero.go
|
go: add «1466. Reorder Routes to Make All Paths Lead to the City Zero»
|
2024-08-12 12:46:02 +02:00 |
|
reverse-substrings-between-each-pair-of-parentheses.go
|
go: add «1190. Reverse Substrings Between Each Pair of Parentheses»
|
2024-07-11 15:29:12 +02:00 |
|
robot-collisions.go
|
go: add «2751. Robot Collisions»
|
2024-07-13 14:51:07 +02:00 |
|
rotting-oranges.go
|
go: add «994. Rotting Oranges»
|
2024-08-06 23:19:54 +02:00 |
|
same-tree.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
score-of-a-string.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
search-suggestions-system.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
single-number-iii.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
sort-an-array.go
|
go: add «912. Sort an Array»
|
2024-07-25 12:06:39 +02:00 |
|
sort-colors.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
special-array-with-x-elements-greater-than-or-equal-x.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
subarray-sums-divisible-by-k.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
subsets.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
sum-of-square-numbers.go
|
go: add «633. Sum of Square Numbers»
|
2024-06-18 12:10:01 +02:00 |
|
the-number-of-beautiful-subsets.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
three-consecutive-odds.go
|
go: add «1550. Three Consecutive Odds»
|
2024-07-01 20:41:32 +02:00 |
|
treenode.go
|
go: allow testing
|
2024-06-16 11:44:08 +02:00 |
|
ugly-number-ii.go
|
go: add «264. Ugly Number II»
|
2024-08-18 12:23:00 +02:00 |
|
water-bottles.go
|
go: add «1518. Water Bottles»
|
2024-07-07 17:15:52 +02:00 |
