LeetCode:3970. Shortest Path With At Most K Consecutive Identical Characters

🚀 *LeetCode 3970: Shortest Path With At Most K Consecutive Identical Characters | Java Solution* In this video, we solve *LeetCode Problem 3970 – Shortest Path With At Most K Consecutive Identical Characters* using Java. We will understand how to combine *Dijkstra's Algorithm with an expanded state (Node, Count)* to find the shortest valid path in a weighted graph. 📌 *Topics Covered:* Graph Representation using Adjacency List Dijkstra's Shortest Path Algorithm Priority Queue in Java Tracking Consecutive Identical Characters 2D Distance Array Step-by-Step Problem Explanation ⏱️ *Time and Space Complexity:* *Time Complexity:* O((N + E) × K × log(N × K)) *Space Complexity:* O(N × K + E × K) Where: N = Number of nodes E = Number of edges K = Maximum allowed consecutive identical characters 💻 *Approach:* Dijkstra's Algorithm + State Tracking 🎯 This video is helpful for students preparing for coding interviews, LeetCode contests, and SDE roles. If you find this video helpful: 👍 Like the video 💬 Comment your doubts 🔔 Subscribe for more Java DSA and LeetCode solutions! #LeetCode3970 #LeetCode #Java #DijkstraAlgorithm #GraphAlgorithms #DSA #ShortestPath #CodingInterview #JavaDSA #CompetitiveProgramming #leetcodechallenge