Канал: Base Case

LeetCode 1283. Find the Smallest Divisor Given a Threshold | Binary Search Part 1

LeetCode 1283. Find the Smallest Divisor Given a Threshold | Binary Search Part 1

LeetCode 875. Koko Eating Bananas | Binary Search Part 2

LeetCode 875. Koko Eating Bananas | Binary Search Part 2

LeetCode 1011. Capacity To Ship Packages Within D Days | Binary Search Part 3

LeetCode 1011. Capacity To Ship Packages Within D Days | Binary Search Part 3

LeetCode 2064. Minimized Maximum of Products Distributed to Any Store | Binary Search Part 4

LeetCode 2064. Minimized Maximum of Products Distributed to Any Store | Binary Search Part 4

LeetCode 1482. Minimum Number of Days to Make m Bouquets | Binary Search Part 5

LeetCode 1482. Minimum Number of Days to Make m Bouquets | Binary Search Part 5

Dijkstra's Algorithm | Dijkstra's shortest path algorithm | Graph Algorithm | Dijkstra Part 1

Dijkstra's Algorithm | Dijkstra's shortest path algorithm | Graph Algorithm | Dijkstra Part 1

LeetCode 743. Network Delay Time | Dijkstra Part 2 | Graph

LeetCode 743. Network Delay Time | Dijkstra Part 2 | Graph

LeetCode 1514. Path with Maximum Probability | Dijkstra Part 3 | Graph

LeetCode 1514. Path with Maximum Probability | Dijkstra Part 3 | Graph

LeetCode 1631. Path With Minimum Effort | Dijkstra Part 4 | Graph

LeetCode 1631. Path With Minimum Effort | Dijkstra Part 4 | Graph

LeetCode 285. Inorder Successor in BST | Inorder Successor in BST Part 1 | Tree

LeetCode 285. Inorder Successor in BST | Inorder Successor in BST Part 1 | Tree

LeetCode 510. Inorder Successor in BST II | Inorder Successor in BST Part 2 | Tree

LeetCode 510. Inorder Successor in BST II | Inorder Successor in BST Part 2 | Tree

LeetCode 300. Longest Increasing Subsequence | LIS Part 1 | Dynamic Programming

LeetCode 300. Longest Increasing Subsequence | LIS Part 1 | Dynamic Programming

LeetCode 673. Number of Longest Increasing Subsequence | LIS Part 2 | Dynamic Programming

LeetCode 673. Number of Longest Increasing Subsequence | LIS Part 2 | Dynamic Programming

Nearest Smaller Elements | Monotonic Stack Part 1 | Stack | Array | JAVA

Nearest Smaller Elements | Monotonic Stack Part 1 | Stack | Array | JAVA

LeetCode 1475. Final Prices With a Special Discount in a Shop | Monotonic Stack Part 2 | Array

LeetCode 1475. Final Prices With a Special Discount in a Shop | Monotonic Stack Part 2 | Array

LeetCode 739. Daily Temperatures | Monotonic Stack Part 3 | Stack | Array

LeetCode 739. Daily Temperatures | Monotonic Stack Part 3 | Stack | Array

LeetCode 84. Largest Rectangle in Histogram | Monotonic Stack Part 4 | Stack | Array

LeetCode 84. Largest Rectangle in Histogram | Monotonic Stack Part 4 | Stack | Array

LeetCode 1135. Connecting Cities With Minimum Cost | MST Part 4 | Graph Algorithm | JAVA

LeetCode 1135. Connecting Cities With Minimum Cost | MST Part 4 | Graph Algorithm | JAVA

Kruskal's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 3

Kruskal's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 3

LeetCode 1584. Min Cost to Connect All Points | MST Part 2 | Graph Algorithm | C#

LeetCode 1584. Min Cost to Connect All Points | MST Part 2 | Graph Algorithm | C#

Prim's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 1

Prim's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 1

LeetCode 63. Unique Paths II | Paths in a Grid Part 1 | Dynamic Programming | C#

LeetCode 63. Unique Paths II | Paths in a Grid Part 1 | Dynamic Programming | C#

LeetCode 62. Unique Paths | Paths in a Grid Part 1 | Dynamic Programming | C#

LeetCode 62. Unique Paths | Paths in a Grid Part 1 | Dynamic Programming | C#

LeetCode 2685. Count the Number of Complete Components | Union Find Part 5 | C#

LeetCode 2685. Count the Number of Complete Components | Union Find Part 5 | C#

LeetCode 2316. Count Unreachable Pairs of Nodes in an Undirected Graph | Union Find Part 4 | C#

LeetCode 2316. Count Unreachable Pairs of Nodes in an Undirected Graph | Union Find Part 4 | C#

LeetCode 684. Redundant Connection | Union Find Part 3 | C#

LeetCode 684. Redundant Connection | Union Find Part 3 | C#

LeetCode 547. Number of Provinces | Union Find Part 2 | C#

LeetCode 547. Number of Provinces | Union Find Part 2 | C#

Union Find | Introduction | Graph Algorithm | Union Find Part 1

Union Find | Introduction | Graph Algorithm | Union Find Part 1

LeetCode 1254. Number of Closed Islands | Island Matrix Part 5 | C#

LeetCode 1254. Number of Closed Islands | Island Matrix Part 5 | C#

LeetCode 130. Surrounded Regions | Island Matrix Part 4 | C#

LeetCode 130. Surrounded Regions | Island Matrix Part 4 | C#

LeetCode 695. Max Area of Island | Island Matrix Part 3 | C#

LeetCode 695. Max Area of Island | Island Matrix Part 3 | C#

LeetCode 200. Number of Islands | Island Matrix Part 2 | C#

LeetCode 200. Number of Islands | Island Matrix Part 2 | C#

LeetCode 733. Flood Fill | Island Matrix Part 1 | C#

LeetCode 733. Flood Fill | Island Matrix Part 1 | C#