docs: mark done and eliminate created and update dates

Author: bujosa

alternative/medium/number_of_islands.py

@@ -24,11 +24,16 @@ def dfs(i, j):
     return islands
 
 """
-    Algorithm - Breadth First Search
-    1. Iterate through the grid
-    2. If the current element is 1, increment the count and call bfs
-    3. In bfs, mark the current element as 0 and call bfs on all the adjacent elements
-    4. Return the count
+    Algorithm - DFS
+    Time Complexity - O(M*N)
+    Space Complexity - O(M*N)
+    where M is the number of rows and N is the number of columns
+
+    Description:
+    1. Iterate through each cell in the grid.
+    2. If the cell is a '1', then it is the top-left corner of an island.
+    3. Perform a DFS on the cell to mark all the cells in the island as '0'.
+    4. Increment the number of islands and continue the search.
 """
 
 assert numIslands([["1","1","1","1","0"], 

src/readme.md

@@ -82,7 +82,7 @@
   - [x] [167. Two sum II - input array is sorted](../src/medium/two_sum_ii_input_array_is_sorted.rs) -> [Problem Description](../src/medium/readme.md#167-two-sum-ii---input-array-is-sorted)
   - [x] [198. House robber](../src/medium/house_robber.rs) -> [Problem Description](../src/medium/readme.md#198-house-robber)
   - [x] [199. Binary tree right side view](../src/medium/binary_tree_right_side_view.rs) -> [Problem Description](../src/medium/readme.md#199-binary-tree-right-side-view)
-  - [ ] [200. Number of islands](../src/medium/number_of_islands.rs) -> [Problem Description](../src/medium/readme.md#200-number-of-islands)
+  - [x] [200. Number of islands](../src/medium/number_of_islands.rs) -> [Problem Description](../src/medium/readme.md#200-number-of-islands)
   - [x] [208. Implement trie (prefix tree)](../src/medium/implement_trie_prefix_tree.rs) -> [Problem Description](../src/medium/readme.md#208-implement-trie-prefix-tree)
   - [x] [211. Design add and search words data structure](../src/medium/design_add_and_search_words_data_structure.rs) -> [Problem Description](../src/medium/readme.md#211-design-add-and-search-words-data-structure)
   - [x] [213. House robber II](../src/medium/house_robber_ii.rs) -> [Problem Description](../src/medium/readme.md#213-house-robber-ii)

theory/categories/1.arrays_&_hashing/readme.md

@@ -91,7 +91,5 @@
 - [Hashing Techniques](https://www.geeksforgeeks.org/hashing-set-1-introduction/)
 
 Category: `Arrays & Hashing`
-Created on: 2023-06-10 22:00:00
-Last modified on: 2023-06-10 22:00:00
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/2.stack/readme.md

@@ -66,7 +66,5 @@
 - [NeetCode](https://neetcode.io)
 
 Category: `Stack`
-Created on: 2023-06-14 20:00:00
-Last modified on: 2023-06-22 19:00:00
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/2.two_pointers/readme.md

@@ -31,7 +31,5 @@
 - [x] [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](../../../src/hard/trapping_rain_water.rs) | [Problem Description](../../../src/hard/readme.md#42-trapping-rain-water)
 
 Category: `Two Pointers`
-Created on: 2023-06-22 19:10:00
-Last modified on: 2023-07-27 03:24:000
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/3.binary_search/readme.md

@@ -37,7 +37,5 @@
 - [x] [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](../../../src/hard/median_of_two_sorted_arrays.rs) | [Problem Description](../../../src/hard/readme.md#4-median-of-two-sorted-arrays)
 
 Category: `Binary Search`
-Created on: 2023-09-21 01:00
-Last modified on: 2023-10-5 20:32
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/3.linked_list/readme.md

@@ -40,7 +40,5 @@
 - [x] [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](../../../src/hard/reverse_nodes_in_k_group.rs) | [Problem Description](../../../src/hard/readme.md#25-reverse-nodes-in-k-group)
 
 Category: `Linked List`
-Created on: 2023-08-22 01:00:00
-Last modified on: 2023-10-11 17:30:00
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/3.sliding_windows/readme.md

@@ -32,7 +32,5 @@
 - [x] [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](../../../src/hard/sliding_window_maximum.rs)
 
 Category: `Sliding Windows`
-Created on: 2023-07-28 15:14:00
-Last modified on: 2023-08-20 19:30:00
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/4.trees/readme.md

@@ -77,7 +77,5 @@
 - [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](../../../src/hard/serialize_and_deserialize_binary_tree.rs) | [Problem Description](../../../src/hard/readme.md#297-serialize-and-deserialize-binary-tree)
 
 Category: `Trees`
-Created on: 2023-10-07 19:00
-Last modified on: 2023-10-31 02:50
 Status: In Progress
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/5.backtracking/readme.md

@@ -38,7 +38,5 @@
 - [x] [N Queens](https://leetcode.com/problems/n-queens/) | Hard | [Solution](../../../src/hard/n_queens.rs) | [Problem Description](../../../src/hard/readme.md#51-n-queens)
 
 Category: `Backtracking`
-Created on: 2023-10-31 03:01
-Last modified on: 2023-11-02 03:00
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/5.tries/readme.md

@@ -58,7 +58,5 @@
 - [x] [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](../../../src/hard/word_search_ii.rs) | [Problem Description](../../../src/hard/readme.md#212-word-search-ii)
 
 Category: `Tries`
-Created on: 2023-10-31 03:00
-Last modified on: 2023-11-02 20:51
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/6.1d_dp/readme.md

@@ -34,7 +34,5 @@ Dynamic programming and greedy algorithms are similar. Both are optimization met
 
 
 Category: `Dynamic Programming`
-Created on: 2023-11-02 21:12
-Last modified on: 2023-11-04 22:17
 Status: Done
 Author: [David Bujosa](https://github.com/bujosa)

theory/categories/6.graphs/readme.md

@@ -15,7 +15,7 @@ A graph can be implemented using an adjacency list or an adjacency matrix.
 
 ## Problems
 
-- [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](../../../src/medium/number_of_islands.rs) | [Problem Description](../../../src/medium/readme.md#200-number-of-islands)
+- [x] [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](../../../src/medium/number_of_islands.rs) | [Problem Description](../../../src/medium/readme.md#200-number-of-islands)
 - [ ] [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [Solution](../../../src/medium/clone_graph.rs) | [Problem Description](../../../src/medium/readme.md#133-clone-graph)
 - [ ] [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [Solution](../../../src/medium/max_area_of_island.rs) | [Problem Description](../../../src/medium/readme.md#695-max-area-of-island)
 - [ ] [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | Medium | [Solution](../../../src/medium/pacific_atlantic_water_flow.rs) | [Problem Description](../../../src/medium/readme.md#417-pacific-atlantic-water-flow)
@@ -31,7 +31,5 @@ A graph can be implemented using an adjacency list or an adjacency matrix.
 
 
 Category: `Graphs`
-Created on: 2023-11-02 21:12
-Last modified on: 2023-11-04 22:20
 Status: In Progress
 Author: [David Bujosa](https://github.com/bujosa)