LIVE_YOUTUBE - Developer Bhaiya - 2 problems, 1 script typing test

Author: rachitiitr

LeetCode/45.jump-game2.cpp

@@ -0,0 +1,35 @@
+ass Solution {
+public:
+    int jump(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> dp(n, INT_MAX - 1); 
+        // dp[i] = min steps to reach the end of array if we are at ith index
+        dp[n-1] = 0; 
+        for(int i = n-2; i >= 0; i--) {
+            for(int j = i+1; j <= i+nums[i]; j++) {
+                if(j >= n) break;
+                dp[i] = min(dp[i], 1 + dp[j]);
+            }
+        }
+        
+        return dp[0];
+    }
+};
+
+/*
+Find: min steps to reach the end of array
+
+Given: i -> we can jump a length of nums[i]
+0 index
+
+_ _ _ _ 7 _ _ _ _ _ _ _ _ _
+        i x x x x x x x
+        
+dp[i] = min steps to reach the end of array if we are at ith index
+
+for(j=i+1; j<=i+7; j++) {
+    dp[i] = min(dp[i], 1 + dp[j]);
+}
+
+return dp[0]
+*/

LeetCode/841.keys-and-room.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    bool canVisitAllRooms(vector<vector<int>>& rooms) {
+        int n = rooms.size();
+        vector<bool> vis(n, 0);
+        
+        queue<int> q;
+        q.push(0);
+        vis[0] = 1;
+        while(!q.empty()) {
+            int cur = q.front();
+            q.pop();
+            for(int child: rooms[cur]) {
+                if (!vis[child]) {
+                    vis[child] = 1;
+                    q.push(child);
+                }
+            }
+        }
+        for(int i = 0; i < n; i++) {
+            if(!vis[i]) return 0;
+        }
+        return 1;
+    }
+};
+
+/*
+Input: [[1,3],[3,0,1],[2],[0]]
+0 --> 1
+|
+|
+3
+*/