chore: add base files for remaining exercises

Author: jhonnymoreira

src/backtracking/all-paths-from-source-to-target.ts

@@ -0,0 +1 @@
+export function () {}

src/backtracking/combination-sum-iii.ts

@@ -0,0 +1 @@
+export function () {}

src/backtracking/generate-parentheses.ts

@@ -0,0 +1 @@
+export function () {}

src/backtracking/letter-combinations-of-a-phone-number.ts

@@ -0,0 +1 @@
+export function () {}

src/backtracking/numbers-with-same-consecutive-differences.ts

@@ -0,0 +1 @@
+export function () {}

src/binary-search/divide-chocolate.ts

@@ -0,0 +1 @@
+export function () {}

src/binary-search/find-the-smallest-divisor-given-a-threshold.ts

@@ -0,0 +1 @@
+export function () {}

src/binary-search/longest-subsequence-with-limited-sum.ts

@@ -0,0 +1 @@
+export function () {}

src/binary-search/search-insert-position.ts

@@ -0,0 +1 @@
+export function () {}

src/binary-search/split-array-largest-sum.ts

@@ -0,0 +1 @@
+export function () {}

src/bonus/cheapest-flights-within-k-stops.ts

@@ -0,0 +1 @@
+export function () {}

src/bonus/hamming-distance.ts

@@ -0,0 +1 @@
+export function () {}

src/bonus/implement-trie-prefix-tree.ts

@@ -0,0 +1 @@
+export function () {}

src/bonus/insert-interval.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/climbing-stairs.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/coin-change.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/min-cost-climbing-stairs.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/minimum-falling-path-sum.ts

@@ -0,0 +1 @@
+export function () {}

src/dynamic-programming/unique-paths-ii.ts

@@ -0,0 +1 @@
+export function () {}

src/greedy/how-many-apples-can-you-put-into-the-basket.ts

@@ -0,0 +1 @@
+export function () {}

src/greedy/maximum-69-number.ts

@@ -0,0 +1 @@
+export function () {}

src/greedy/maximum-units-on-a-truck.ts

@@ -0,0 +1 @@
+export function () {}

src/greedy/reduce-array-size-to-the-half.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/contiguous-array.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/counting-elements.ts

@@ -0,0 +1 @@
+export function countElements(nums: number[]): number {}

src/hashing/find-players-with-zero-or-one-losses.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/jewels-and-stones.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/largest-unique-number.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/longest-substring-without-repeating-characters.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/maximum-number-of-balloons.ts

@@ -0,0 +1 @@
+export function () {}

src/hashing/ransom-note.ts

@@ -0,0 +1 @@
+export function () {}

src/heaps/k-closest-points-to-origin.ts

@@ -0,0 +1 @@
+export function () {}

src/heaps/kth-largest-element-in-a-stream.ts

@@ -0,0 +1 @@
+export function () {}

src/heaps/kth-largest-element-in-an-array.ts

@@ -0,0 +1 @@
+export function () {}

src/heaps/minimum-cost-to-connect-sticks.ts

@@ -0,0 +1 @@
+export function () {}

src/heaps/remove-stones-to-minimize-the-total.ts

@@ -0,0 +1 @@
+export function () {}

src/linked-lists/middle-of-the-linked-list.ts

@@ -0,0 +1 @@
+export function () {}

src/linked-lists/remove-duplicates-from-sorted-list.ts

@@ -0,0 +1 @@
+export function () {}

src/linked-lists/reverse-linked-list-ii.ts

@@ -0,0 +1 @@
+export function () {}

src/stacks-and-queues/make-the-string-great.ts

@@ -0,0 +1 @@
+export function () {}

src/stacks-and-queues/moving-average-from-data-stream.ts

@@ -0,0 +1 @@
+export function () {}

src/stacks-and-queues/next-greater-element-i.ts

@@ -0,0 +1 @@
+export function () {}

src/stacks-and-queues/online-stock-span.ts

@@ -0,0 +1 @@
+export function () {}

src/stacks-and-queues/simplify-path.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/binary-tree-zigzag-level-order-traversal.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/closest-binary-search-tree-value.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/deepest-leaves-sum.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/detonate-the-maximum-bombs.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/diameter-of-binary-tree.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/find-if-path-exists-in-graph.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/insert-into-a-binary-search-tree.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/jump-game-iii.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/max-area-of-island.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/maximum-difference-between-node-and-ancestor.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/minimum-depth-of-binary-tree.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/minimum-genetic-mutation.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/nearest-exit-from-entrance-in-maze.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/number-of-connected-components-in-an-undirected-graph.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/reachable-nodes-with-restrictions.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/snakes-and-ladders.ts

@@ -0,0 +1 @@
+export function () {}

src/trees-and-graphs/word-ladder.ts

@@ -0,0 +1 @@
+export function () {}

tests/backtracking/all-paths-from-source-to-target.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/backtracking/all-paths-from-source-to-target.js';
+
+describe.todo('Backtracking: All Paths From Source to Target')

tests/backtracking/combination-sum-iii.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/backtracking/combination-sum-iii.js';
+
+describe.todo('Backtracking: Combination Sum III')

tests/backtracking/generate-parentheses.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/backtracking/generate-parentheses.js';
+
+describe.todo('Backtracking: Generate Parentheses')

tests/backtracking/letter-combinations-of-a-phone-number.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/backtracking/letter-combinations-of-a-phone-number.js';
+
+describe.todo('Backtracking: Letter Combinations of a Phone Number')

tests/backtracking/numbers-with-same-consecutive-differences.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/backtracking/numbers-with-same-consecutive-differences.js';
+
+describe.todo('Backtracking: Numbers With Same Consecutive Differences')

tests/binary-search/divide-chocolate.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/binary-search/divide-chocolate.js';
+
+describe.todo('Binary Search: Divide Chocolate')

tests/binary-search/find-the-smallest-divisor-given-a-threshold.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/binary-search/find-the-smallest-divisor-given-a-threshold.js';
+
+describe.todo('Binary Search: Find the Smallest Divisor Given a Threshold')

tests/binary-search/longest-subsequence-with-limited-sum.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/binary-search/longest-subsequence-with-limited-sum.js';
+
+describe.todo('Binary Search: Longest Subsequence With Limited Sum')

tests/binary-search/search-insert-position.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/binary-search/search-insert-position.js';
+
+describe.todo('Binary Search: Search Insert Position')

tests/binary-search/split-array-largest-sum.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/binary-search/split-array-largest-sum.js';
+
+describe.todo('Binary Search: Split Array Largest Sum')

tests/bonus/cheapest-flights-within-k-stops.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/bonus/cheapest-flights-within-k-stops.js';
+
+describe.todo('Bonus: Cheapest Flights Within K Stops')

tests/bonus/hamming-distance.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/bonus/hamming-distance.js';
+
+describe.todo('Bonus: Hamming Distance')

tests/bonus/implement-trie-prefix-tree.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/bonus/implement-trie-prefix-tree.js';
+
+describe.todo('Bonus: Implement Trie (Prefix Tree)')

tests/bonus/insert-interval.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/bonus/insert-interval.js';
+
+describe.todo('Bonus: Insert Interval')

tests/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown.js';
+
+describe.todo('Dynamic Programming: Best Time to Buy and Sell Stock with Cooldown')

tests/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee.js';
+
+describe.todo('Dynamic Programming: Best Time to Buy and Sell Stock with Transaction Fee')

tests/dynamic-programming/climbing-stairs.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/climbing-stairs.js';
+
+describe.todo('Dynamic Programming: Climbing Stairs')

tests/dynamic-programming/coin-change.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/coin-change.js';
+
+describe.todo('Dynamic Programming: Coin Change')

tests/dynamic-programming/min-cost-climbing-stairs.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/min-cost-climbing-stairs.js';
+
+describe.todo('Dynamic Programming: Min Cost Climbing Stairs')

tests/dynamic-programming/minimum-falling-path-sum.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/minimum-falling-path-sum.js';
+
+describe.todo('Dynamic Programming: Minimum Falling Path Sum')

tests/dynamic-programming/unique-paths-ii.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/dynamic-programming/unique-paths-ii.js';
+
+describe.todo('Dynamic Programming: Unique Paths II')

tests/greedy/how-many-apples-can-you-put-into-the-basket.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/greedy/how-many-apples-can-you-put-into-the-basket.js';
+
+describe.todo('Greedy: How Many Apples Can You Put into the Basket')

tests/greedy/maximum-69-number.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/greedy/maximum-69-number.js';
+
+describe.todo('Greedy: Maximum 69 Number')

tests/greedy/maximum-units-on-a-truck.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/greedy/maximum-units-on-a-truck.js';
+
+describe.todo('Greedy: Maximum Units on a Truck')

tests/greedy/reduce-array-size-to-the-half.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/greedy/reduce-array-size-to-the-half.js';
+
+describe.todo('Greedy: Reduce Array Size to The Half')

tests/hashing/contiguous-array.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/contiguous-array.js';
+
+describe.todo('Hashing: Contiguous Array')

tests/hashing/counting-elements.test.ts

@@ -0,0 +1,16 @@
+import { countElements } from '@/hashing/counting-elements.js';
+
+describe('Hashing: Counting Elements', () => {
+  test.each([
+    {
+      nums: [1, 2, 3],
+      output: 0,
+    },
+    {
+      nums: [1, 1, 3, 3, 5, 5, 7, 7],
+      output: 0,
+    },
+  ])('countElements($nums) === $output', ({ nums, output }) => {
+    expect(countElements(nums)).toStrictEqual(output);
+  });
+});

tests/hashing/find-players-with-zero-or-one-losses.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/find-players-with-zero-or-one-losses.js';
+
+describe.todo('Hashing: Find Players With Zero or One Losses')

tests/hashing/jewels-and-stones.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/jewels-and-stones.js';
+
+describe.todo('Hashing: Jewels and Stones')

tests/hashing/largest-unique-number.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/largest-unique-number.js';
+
+describe.todo('Hashing: Largest Unique Number')

tests/hashing/longest-substring-without-repeating-characters.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/longest-substring-without-repeating-characters.js';
+
+describe.todo('Hashing: Longest Substring Without Repeating Characters')

tests/hashing/maximum-number-of-balloons.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/maximum-number-of-balloons.js';
+
+describe.todo('Hashing: Maximum Number of Balloons')

tests/hashing/ransom-note.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/hashing/ransom-note.js';
+
+describe.todo('Hashing: Ransom Note')

tests/heaps/k-closest-points-to-origin.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/heaps/k-closest-points-to-origin.js';
+
+describe.todo('Heaps: K Closest Points to Origin')

tests/heaps/kth-largest-element-in-a-stream.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/heaps/kth-largest-element-in-a-stream.js';
+
+describe.todo('Heaps: Kth Largest Element in a Stream')

tests/heaps/kth-largest-element-in-an-array.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/heaps/kth-largest-element-in-an-array.js';
+
+describe.todo('Heaps: Kth Largest Element in an Array')

tests/heaps/minimum-cost-to-connect-sticks.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/heaps/minimum-cost-to-connect-sticks.js';
+
+describe.todo('Heaps: Minimum Cost to Connect Sticks')

tests/heaps/remove-stones-to-minimize-the-total.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/heaps/remove-stones-to-minimize-the-total.js';
+
+describe.todo('Heaps: Remove Stones to Minimize the Total')

tests/linked-lists/middle-of-the-linked-list.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/linked-lists/middle-of-the-linked-list.js';
+
+describe.todo('Linked Lists: Middle of the Linked List')

tests/linked-lists/remove-duplicates-from-sorted-list.test.ts

@@ -0,0 +1,3 @@
+import {} from '@/linked-lists/remove-duplicates-from-sorted-list.js';
+
+describe.todo('Linked Lists: Remove Duplicates from Sorted List')