2045. Second Minimum Time to Reach Destination | Hard | Leetcode Daily (POTD) 28 July 2024 | Java

[@vedictechyog]

Great!

[@QuadbTech]

Beautifully explained ! ✨

[@algorithmsbyaditi]

Thank you!

[@crekso398]

thank you so much ..

[@algorithmsbyaditi]

Glad you liked it !

[@AlokKumar-gp2jq]

it showing wrong answer

[@prettyugly_paintings]

import java.util.*; class Solution { class Pair{ int node; int weight; Pair(int node, int weight){ this.node = node; this.weight = weight; } } public int secondMinimum(int n, int[][] edges, int time, int change) { ArrayList adj = new ArrayList(); for (int i = 0; i x.weight - y.weight); pq.add(new Pair(1, 0)); while (!pq.isEmpty()) { Pair curr = pq.poll(); int currNode = curr.node; int currTime = curr.weight; if(currNode == n && secDistance[n] != Integer.MAX_VALUE) return secDistance[n]; if ((currTime / change) % 2 == 1) { // Red light currTime = ((currTime/change)+1)*change; } currTime += time; for (int neighbor : adj.get(currNode)) { if(currTime< distance[neighbor]){ secDistance[neighbor] = distance[neighbor]; distance[neighbor] = currTime; pq.add(new Pair(neighbor, currTime)); } else if(currTime> distance[neighbor] && currTime< secDistance[neighbor]){ secDistance[neighbor] = currTime; pq.add(new Pair(neighbor, currTime)); } } } return -1; } }

[@VinayKumar-xs6el]

sri krishna k naam lekar english mey explain karo

[@AlokKumar-gp2jq]

shut up

[@im_ykp]

Don't you Know Hindi