File tree Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Original file line number Diff line number Diff line change @@ -378,7 +378,7 @@ If you would like to have collaborator permissions on the repo to merge your own
378
378
<sub>[1514 - Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)</sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](cpp%2F1514-path-with-maximum-probability.cpp)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](java%2F1514-path-with-maximum-probability.java)</div></sub> | <sub><div align='center'>[βοΈ](javascript%2F1514-path-with-maximum-probability.js)</div></sub> | <sub><div align='center'>[βοΈ](kotlin%2F1514-path-with-maximum-probability.kt)</div></sub> | <sub><div align='center'>[βοΈ](python%2F1514-path-with-maximum-probability.py)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](swift%2F1514-path-with-maximum-probability.swift)</div></sub> | <sub><div align='center'>[βοΈ](typescript%2F1514-path-with-maximum-probability.ts)</div></sub>
379
379
<sub>[0778 - Swim In Rising Water](https://leetcode.com/problems/swim-in-rising-water/)</sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](cpp%2F0778-swim-in-rising-water.cpp)</div></sub> | <sub><div align='center'>[βοΈ](csharp%2F0778-swim-in-rising-water.cs)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](go%2F0778-swim-in-rising-water.go)</div></sub> | <sub><div align='center'>[βοΈ](java%2F0778-swim-in-rising-water.java)</div></sub> | <sub><div align='center'>[βοΈ](javascript%2F0778-swim-in-rising-water.js)</div></sub> | <sub><div align='center'>[βοΈ](kotlin%2F0778-swim-in-rising-water.kt)</div></sub> | <sub><div align='center'>[βοΈ](python%2F0778-swim-in-rising-water.py)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](rust%2F0778-swim-in-rising-water.rs)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](swift%2F0778-swim-in-rising-water.swift)</div></sub> | <sub><div align='center'>[βοΈ](typescript%2F0778-swim-in-rising-water.ts)</div></sub>
380
380
<sub >[ 0269 - Alien Dictionary] ( https://leetcode.com/problems/alien-dictionary/ ) </sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( cpp%2F0269-alien-dictionary.cpp ) </div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( csharp%2F0269-alien-dictionary.cs ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( java%2F0269-alien-dictionary.java ) </div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( javascript%2F0269-alien-dictionary.js ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( python%2F0269-alien-dictionary.py ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( swift%2F0269-alien-dictionary.swift ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub >
381
- <sub>[0787 - Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/)</sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](cpp%2F0787-cheapest-flights-within-k-stops.cpp)</div></sub> | <sub><div align='center'>[βοΈ](csharp%2F0787-cheapest-flights-within-k-stops.cs)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](go%2F0787-cheapest-flights-within-k-stops.go)</div></sub> | <sub><div align='center'>[βοΈ](java%2F0787-cheapest-flights-within-k-stops.java)</div></sub> | <sub><div align='center'>[βοΈ](javascript%2F0787-cheapest-flights-within-k-stops.js)</div></sub> | <sub><div align='center'>[βοΈ](kotlin%2F0787-cheapest-flights-within-k-stops.kt)</div></sub> | <sub><div align='center'>[βοΈ](python%2F0787-cheapest-flights-within-k-stops.py)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](typescript%2F0787-cheapest-flights-within-k-stops.ts)</div></sub>
381
+ <sub>[0787 - Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/)</sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](cpp%2F0787-cheapest-flights-within-k-stops.cpp)</div></sub> | <sub><div align='center'>[βοΈ](csharp%2F0787-cheapest-flights-within-k-stops.cs)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](go%2F0787-cheapest-flights-within-k-stops.go)</div></sub> | <sub><div align='center'>[βοΈ](java%2F0787-cheapest-flights-within-k-stops.java)</div></sub> | <sub><div align='center'>[βοΈ](javascript%2F0787-cheapest-flights-within-k-stops.js)</div></sub> | <sub><div align='center'>[βοΈ](kotlin%2F0787-cheapest-flights-within-k-stops.kt)</div></sub> | <sub><div align='center'>[βοΈ](python%2F0787-cheapest-flights-within-k-stops.py)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](swift%2F0787-cheapest-flights-within-k-stops.swift)</div></sub> | <sub><div align='center'>[βοΈ](typescript%2F0787-cheapest-flights-within-k-stops.ts)</div></sub>
382
382
<sub >[ 2421 - Number of Good Paths] ( https://leetcode.com/problems/number-of-good-paths/ ) </sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( go%2F2421-number-of-good-paths.go ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( javascript%2F2421-number-of-good-paths.js ) </div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( kotlin%2F2421-number-of-good-paths.kt ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( rust%2F2421-number-of-good-paths.rs ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( typescript%2F2421-number-of-good-paths.ts ) </div ></sub >
383
383
<sub >[ 1579 - Remove Max Number of Edges to Keep Graph Fully Traversable] ( https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/ ) </sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >[ βοΈ] ( kotlin%2F1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.kt ) </div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub > | <sub ><div align =' center ' >β</div ></sub >
384
384
<sub>[1489 - Find Critical and Pseudo Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)</sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](kotlin%2F1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.kt)</div></sub> | <sub><div align='center'>[βοΈ](python%2F1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.py)</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>β</div></sub> | <sub><div align='center'>[βοΈ](swift%2F1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.swift)</div></sub> | <sub><div align='center'>[βοΈ](typescript%2F1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.ts)</div></sub>
You canβt perform that action at this time.
0 commit comments