no message

Author: Partho Biswas

README.md

@@ -568,7 +568,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |14| **[130. Surrounded Regions](https://tinyurl.com/tnmbzep)** | [Python](https://tinyurl.com/wu6rdaw/130_Surrounded_Regions.py)|  **[codinginterviewclass.com](https://tinyurl.com/uclclqk)**, **[Art 1](https://tinyurl.com/yx859xh6)**, **[Art 2](https://tinyurl.com/wbnnm8n)** | Medium | **TODO: Solve it using Union Find. Modified BFS and DFS** |
 |15| **[127. Word Ladder](https://tinyurl.com/y99azp8z)** | [Python](https://tinyurl.com/wu6rdaw/127_Word_Ladder.py)|  **[backtobackswe.com](https://tinyurl.com/y9thba6e)**, **[Official](https://tinyurl.com/y99azp8z)**, **[Art 1](https://tinyurl.com/ya3vr264)** | Medium | **Very important and tricky. Modified BFS. Shortest Path finding** |
 |16| **[126. Word Ladder II](https://tinyurl.com/jubpmll)** | [Python](https://tinyurl.com/wu6rdaw/126_Word_Ladder_II.py)|  **[backtobackswe.com](https://tinyurl.com/y9thba6e)**, **[Official](https://tinyurl.com/y99azp8z)**, **[Vid 1](https://tinyurl.com/ws465le)**, **[Vid 2](https://tinyurl.com/y7apdbwu)**, **[Art 1 - Must](https://tinyurl.com/y89mjm4c)** | Hard | **TODO: Not Done. Extremely tricky. Modified BFS. Learned [Bidirectional Search](https://tinyurl.com/vx3oqbf)** |
-|17| **[785. Is Graph Bipartite?](https://tinyurl.com/wvwqw2j)** | [Python](https://tinyurl.com/wu6rdaw/785_Is_Graph_Bipartite.py)|  **[codinginterviewclass.com](https://tinyurl.com/s4qseoz)**, **[Official](https://tinyurl.com/rynbqly)** | Medium | **Important, Learned new things. Undirected Graph** |
+|17| **[785. Is Graph Bipartite?](https://tinyurl.com/wvwqw2j)** | [Python](https://tinyurl.com/wu6rdaw/785_Is_Graph_Bipartite.py)|  **[backtobackswe.com](https://tinyurl.com/y46j3se6)**, **[Official](https://tinyurl.com/rynbqly)** | Medium | **Important, Learned new things. Undirected Graph** |
 |18| **[133. Clone Graph](https://tinyurl.com/y42nwqz8)** | [Python](https://tinyurl.com/wu6rdaw/133_Clone_Graph.py), [Swift](https://tinyurl.com/wuja3c4/133_Clone_Graph.swift) |  **[backtobackswe.com](https://tinyurl.com/y8tluhov)**, **[Official](https://tinyurl.com/usxjk49)** | Medium | **Important, Learned new things. Undirected Graph** |
 |19| **[332. Reconstruct Itinerary](https://tinyurl.com/gn2mv3k)** | [Python](https://tinyurl.com/wu6rdaw/332_Reconstruct_Itinerary.py)|  [Vid 1](https://tinyurl.com/w47evd9), [Vid 2](https://tinyurl.com/uvop34p), [Art 1](https://tinyurl.com/tsy24pl), [Art 2](https://tinyurl.com/srazxo3), [Art 3](https://tinyurl.com/wluob5j), **[Art 4](https://tinyurl.com/y4s9crf6)** | Medium | **Important, Learned new things. Directed Graph. Eulerian path and top Sort** |
 |20| **[1153. String Transforms Into Another String](https://tinyurl.com/sv9hpo8)** | [Python](https://tinyurl.com/wu6rdaw/1153_String_Transforms_Into_Another_String.py)|  **[Vid 1](https://tinyurl.com/ty2ga7d)**, [Vid 2](https://tinyurl.com/vxr9zxp), [Art 1](https://tinyurl.com/rklzgkk), [Art 2](https://tinyurl.com/seb6vqq), [Art 3](https://tinyurl.com/vfjwn5h), [Art 4](https://tinyurl.com/w62hpq2), [Art 5](https://tinyurl.com/tteucry), [Art 6](https://tinyurl.com/uvctnvz) | Extremely Hard | **TODO: Check again. Very Important and tricky, Learned new things. Digraph.** |

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/270_Closest_Binary_Search_Tree_Value.swift

@@ -0,0 +1,6 @@
+import Foundation
+class Solution {
+    func closestValue(_ root: TreeNode?, _ target: Double) -> Int {
+        
+    }
+}

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/721_Accounts_Merge.swift

@@ -5,12 +5,7 @@ class Solution {
         var graph = [String: Set<String>]()
         for account in accounts {
             let (name, emails) = (account[0], account[1...])
-            // print("name: \(name)")
-            // print("emails: \(emails)")
             for email in emails {
-                // print("emails.first: \(emails.first!)")
-                // print("email: \(email)")
-                
                 if graph[emails.first!] == nil {
                     graph[emails.first!] = Set<String>()
                 }
@@ -22,10 +17,6 @@ class Solution {
                 emailToNameMap[email] = name
             }
         }
-        
-        // print("Graph: \(graph)")
-        // print("emailToNameMap: \(emailToNameMap)")
-        
         var seen = Set<String>()
         var result = [[String]]()
         for (node, _) in graph {