chore: Add README

Author: jhonnymoreira

README.md

@@ -0,0 +1,85 @@
+## Progress
+
+- [x] Arrays and Strings
+  - [x] [Reverse String](./src/arrays-and-strings/reverse-string.ts)
+  - [x] [Squares of a Sorted Array](./src/arrays-and-strings/squares-of-a-sorted-array.ts)
+  - [x] [Maximum Average Subarray I](./src/arrays-and-strings/maximum-average-subarray-i.ts)
+  - [x] [Max Consecutive Ones III](./src/arrays-and-strings/max-consecutive-ones-iii.ts)
+  - [x] [Running Sum of 1D Array](./src/arrays-and-strings/running-sum-of-1-d-array.ts)
+  - [x] [Minimum Value to Get Positive Step by Step Sum](./src/arrays-and-strings/minimum-value-to-get-positive-step-by-step-sum.ts)
+  - [x] [K Radius Subarray Averages](./src/arrays-and-strings/k-radius-subarray-averages.ts)
+- [ ] Hashing
+  - [x] [Check if the Sentence Is Pangram](./src/hashing/check-if-the-sentence-is-pangram.ts)
+  - [x] [Missing Number](./src/hashing/missing-number.ts)
+  - [ ] [Counting Elements](./src/hashing/counting-elements.ts)
+  - [ ] [Find Players With Zero or One Losses](./src/hashing/find-players-with-zero-or-one-losses.ts)
+  - [ ] [Largest Unique Number](./src/hashing/largest-unique-number.ts)
+  - [ ] [Maximum Number of Balloons](./src/hashing/maximum-number-of-balloons.ts)
+  - [ ] [Contiguous Array](./src/hashing/contiguous-array.ts)
+  - [ ] [Ransom Note](./src/hashing/ransom-note.ts)
+  - [ ] [Jewels and Stones](./src/hashing/jewels-and-stones.ts)
+  - [ ] [Longest Substring Without Repeating Characters](./src/hashing/longest-substring-without-repeating-characters.ts)
+- [ ] Linked Lists
+  - [ ] [Middle of the Linked List](./src/linked-lists/middle-of-the-linked-list.ts)
+  - [ ] [Remove Duplicates from Sorted List](./src/linked-lists/remove-duplicates-from-sorted-list.ts)
+  - [ ] [Reverse Linked List II](./src/linked-lists/reverse-linked-list-ii.ts)
+- [ ] Stacks and Queues
+  - [ ] [Simplify Path](./src/stacks-and-queues/simplify-path.ts)
+  - [ ] [Make The String Great](./src/stacks-and-queues/make-the-string-great.ts)
+  - [ ] [Moving Average from Data Stream](./src/stacks-and-queues/moving-average-from-data-stream.ts)
+  - [ ] [Next Greater Element I](./src/stacks-and-queues/next-greater-element-i.ts)
+  - [ ] [Online Stock Span](./src/stacks-and-queues/online-stock-span.ts)
+- [ ] Trees and Graphs
+  - [ ] [Minimum Depth of Binary Tree](./src/trees-and-graphs/minimum-depth-of-binary-tree.ts)
+  - [ ] [Maximum Difference Between Node and Ancestor](./src/trees-and-graphs/maximum-difference-between-node-and-ancestor.ts)
+  - [ ] [Diameter of Binary Tree](./src/trees-and-graphs/diameter-of-binary-tree.ts)
+  - [ ] [Deepest Leaves Sum](./src/trees-and-graphs/deepest-leaves-sum.ts)
+  - [ ] [Binary Tree Zigzag Level Order Traversal](./src/trees-and-graphs/binary-tree-zigzag-level-order-traversal.ts)
+  - [ ] [Insert into a Binary Search Tree](./src/trees-and-graphs/insert-into-a-binary-search-tree.ts)
+  - [ ] [Closest Binary Search Tree Value](./src/trees-and-graphs/closest-binary-search-tree-value.ts)
+  - [ ] [Find if Path Exists in Graph](./src/trees-and-graphs/find-if-path-exists-in-graph.ts)
+  - [ ] [Number of Connected Components in an Undirected Graph](./src/trees-and-graphs/number-of-connected-components-in-an-undirected-graph.ts)
+  - [ ] [Max Area of Island](./src/trees-and-graphs/max-area-of-island.ts)
+  - [ ] [Reachable Nodes With Restrictions](./src/trees-and-graphs/reachable-nodes-with-restrictions.ts)
+  - [ ] [Nearest Exit from Entrance in Maze](./src/trees-and-graphs/nearest-exit-from-entrance-in-maze.ts)
+  - [ ] [Snakes and Ladders](./src/trees-and-graphs/snakes-and-ladders.ts)
+  - [ ] [Minimum Genetic Mutation](./src/trees-and-graphs/minimum-genetic-mutation.ts)
+  - [ ] [Jump Game III](./src/trees-and-graphs/jump-game-iii.ts)
+  - [ ] [Detonate the Maximum Bombs](./src/trees-and-graphs/detonate-the-maximum-bombs.ts)
+  - [ ] [Word Ladder](./src/trees-and-graphs/word-ladder.ts)
+- [ ] Heaps
+  - [ ] [Remove Stones to Minimize the Total](./src/heaps/remove-stones-to-minimize-the-total.ts)
+  - [ ] [Minimum Cost to Connect Sticks](./src/heaps/minimum-cost-to-connect-sticks.ts)
+  - [ ] [Kth Largest Element in an Array](./src/heaps/kth-largest-element-in-an-array.ts)
+  - [ ] [K Closest Points to Origin](./src/heaps/k-closest-points-to-origin.ts)
+  - [ ] [Kth Largest Element in a Stream](./src/heaps/kth-largest-element-in-a-stream.ts)
+- [ ] Greedy
+  - [ ] [Maximum 69 Number](./src/greedy/maximum-69-number.ts)
+  - [ ] [Maximum Units on a Truck](./src/greedy/maximum-units-on-a-truck.ts)
+  - [ ] [How Many Apples Can You Put into the Basket](./src/greedy/how-many-apples-can-you-put-into-the-basket.ts)
+  - [ ] [Reduce Array Size to The Half](./src/greedy/reduce-array-size-to-the-half.ts)
+- [ ] Binary Search
+  - [ ] [Search Insert Position](./src/binary-search/search-insert-position.ts)
+  - [ ] [Longest Subsequence With Limited Sum](./src/binary-search/longest-subsequence-with-limited-sum.ts)
+  - [ ] [Find the Smallest Divisor Given a Threshold](./src/binary-search/find-the-smallest-divisor-given-a-threshold.ts)
+  - [ ] [Divide Chocolate](./src/binary-search/divide-chocolate.ts)
+  - [ ] [Split Array Largest Sum](./src/binary-search/split-array-largest-sum.ts)
+- [ ] Backtracking
+  - [ ] [All Paths From Source to Target](./src/backtracking/all-paths-from-source-to-target.ts)
+  - [ ] [Letter Combinations of a Phone Number](./src/backtracking/letter-combinations-of-a-phone-number.ts)
+  - [ ] [Generate Parentheses](./src/backtracking/generate-parentheses.ts)
+  - [ ] [Numbers With Same Consecutive Differences](./src/backtracking/numbers-with-same-consecutive-differences.ts)
+  - [ ] [Combination Sum III](./src/backtracking/combination-sum-iii.ts)
+- [ ] Dynamic Programming
+  - [ ] [Climbing Stairs](./src/dynamic-programming/climbing-stairs.ts)
+  - [ ] [Min Cost Climbing Stairs](./src/dynamic-programming/min-cost-climbing-stairs.ts)
+  - [ ] [Coin Change](./src/dynamic-programming/coin-change.ts)
+  - [ ] [Best Time to Buy and Sell Stock with Transaction Fee](./src/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee.ts)
+  - [ ] [Best Time to Buy and Sell Stock with Cooldown](./src/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown.ts)
+  - [ ] [Unique Paths II](./src/dynamic-programming/unique-paths-ii.ts)
+  - [ ] [Minimum Falling Path Sum](./src/dynamic-programming/minimum-falling-path-sum.ts)
+- [ ] Bonus
+  - [ ] [Implement Trie (Prefix Tree)](./src/bonus/implement-trie-prefix-tree.ts)
+  - [ ] [Hamming Distance](./src/bonus/hamming-distance.ts)
+  - [ ] [Insert Interval](./src/bonus/insert-interval.ts)
+  - [ ] [Cheapest Flights Within K Stops](./src/bonus/cheapest-flights-within-k-stops.ts)