Updated Readme

Author: yvrakesh

README.md

@@ -6,4 +6,5 @@ Click on difficulty buttons (Easy, Medium, Hard) or Tags or company to filter th
 |#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
 | - | - | - | - | - |  - | - | - |
 |200|[Number Of Islands](https://leetcode.com/problems/number-of-islands/)|[<img src="images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0001-to-0499/200-Number-Of-Islands)|[<img src="images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Medium](images/MediumBlue.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Medium)|O(MN)|O(Min(M,N))|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [BFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/BFS), [DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Matrix](https://github.com/yvrakesh/Leetcode/tree/main/tag/Matrix), [Union Find](https://github.com/yvrakesh/Leetcode/tree/main/tag/Union-Find)
-|937|[Reorder Data In Log Files](https://leetcode.com/problems/reorder-data-in-log-files/)|[<img src="images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0500-to-0999/937-Reorder-Data-In-Log-Files)|[<img src="images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Easy](images/EasyGreen.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Easy)|O(NlogN)|O(N)|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [String](https://github.com/yvrakesh/Leetcode/tree/main/tag/String), [Sorting](https://github.com/yvrakesh/Leetcode/tree/main/tag/Sorting)
+|937|[Reorder Data In Log Files](https://leetcode.com/problems/reorder-data-in-log-files/)|[<img src="images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0500-to-0999/937-Reorder-Data-In-Log-Files)|[<img src="images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Easy](images/EasyGreen.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Easy)|O(NlogN)|O(N)|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [String](https://github.com/yvrakesh/Leetcode/tree/main/tag/String), [Sorting](https://github.com/yvrakesh/Leetcode/tree/main/tag/Sorting)
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)

company/Amazon/README.md

@@ -8,4 +8,5 @@ Special Thanks to [Krishnadey30](https://github.com/krishnadey30). Question Data
 |#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
 | - | - | - | - | - |  - | - | - |
 |937|[Reorder Data In Log Files](https://leetcode.com/problems/reorder-data-in-log-files/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0500-to-0999/937-Reorder-Data-In-Log-Files)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Easy](../../images/EasyGreen.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Easy)|O(NlogN)|O(N)|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [String](https://github.com/yvrakesh/Leetcode/tree/main/tag/String), [Sorting](https://github.com/yvrakesh/Leetcode/tree/main/tag/Sorting)
-|200|[Number Of Islands](https://leetcode.com/problems/number-of-islands/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0001-to-0499/200-Number-Of-Islands)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Medium](../../images/MediumBlue.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Medium)|O(MN)|O(Min(M,N))|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [BFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/BFS), [DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Matrix](https://github.com/yvrakesh/Leetcode/tree/main/tag/Matrix), [Union Find](https://github.com/yvrakesh/Leetcode/tree/main/tag/Union-Find)
+|200|[Number Of Islands](https://leetcode.com/problems/number-of-islands/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0001-to-0499/200-Number-Of-Islands)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Medium](../../images/MediumBlue.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Medium)|O(MN)|O(Min(M,N))|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [BFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/BFS), [DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Matrix](https://github.com/yvrakesh/Leetcode/tree/main/tag/Matrix), [Union Find](https://github.com/yvrakesh/Leetcode/tree/main/tag/Union-Find)
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](../../images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)

difficulty/Hard/README.md

@@ -3,5 +3,6 @@ Leetcode Questions Practice - Hard
 
 Click on difficulty buttons (Easy, Medium, Hard) or Tags or company to filter that category problems only.
 
-|#|Title|Sol|Companies|Difficulty|Tags|
-| - | - | - | - | - |  - |
+|#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
+| - | - | - | - | - |  - | - | - |
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](../../images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)

tag/Biconnected-Components/README.md

@@ -4,4 +4,5 @@ Leetcode Questions Practice - Biconnected Components
 Click on difficulty buttons (Easy, Medium, Hard) or Tags or company to filter that category problems only.
 
 |#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
-| - | - | - | - | - |  - | - | - |
+| - | - | - | - | - |  - | - | - |
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](../../images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)

tag/DFS/README.md

@@ -5,4 +5,5 @@ Click on difficulty buttons (Easy, Medium, Hard) or Tags or company to filter th
 
 |#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
 | - | - | - | - | - |  - | - | - |
-|200|[Number Of Islands](https://leetcode.com/problems/number-of-islands/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0001-to-0499/200-Number-Of-Islands)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Medium](../../images/MediumBlue.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Medium)|O(MN)|O(Min(M,N))|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [BFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/BFS), [DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Matrix](https://github.com/yvrakesh/Leetcode/tree/main/tag/Matrix), [Union Find](https://github.com/yvrakesh/Leetcode/tree/main/tag/Union-Find)
+|200|[Number Of Islands](https://leetcode.com/problems/number-of-islands/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-0001-to-0499/200-Number-Of-Islands)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Medium](../../images/MediumBlue.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Medium)|O(MN)|O(Min(M,N))|[Array](https://github.com/yvrakesh/Leetcode/tree/main/tag/Array), [BFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/BFS), [DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Matrix](https://github.com/yvrakesh/Leetcode/tree/main/tag/Matrix), [Union Find](https://github.com/yvrakesh/Leetcode/tree/main/tag/Union-Find)
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](../../images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)

tag/Graph/README.md

@@ -4,4 +4,5 @@ Leetcode Questions Practice - Graph
 Click on difficulty buttons (Easy, Medium, Hard) or Tags or company to filter that category problems only.
 
 |#|Title|Sol|Companies|Difficulty|Time|Space|Tags|
-| - | - | - | - | - |  - | - | - |
+| - | - | - | - | - |  - | - | - |
+|1192|[Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/)|[<img src="../../images/github.svg" width="27" title="Solution" />](https://github.com/yvrakesh/Leetcode/tree/main/code-1000-to-1499/1192-Critical-Connections-In-A-Network)|[<img src="../../images/amazon.svg" width="27" title="Amazon" />](https://github.com/yvrakesh/Leetcode/tree/main/company/Amazon)&nbsp; |[![Hard](../../images/HardRed.svg)](https://github.com/yvrakesh/Leetcode/tree/main/difficulty/Hard)|O(E+V)|O(E+V)|[DFS](https://github.com/yvrakesh/Leetcode/tree/main/tag/DFS), [Graph](https://github.com/yvrakesh/Leetcode/tree/main/tag/Graph), [Biconnected Components](https://github.com/yvrakesh/Leetcode/tree/main/tag/Biconnected-Components)