LeetCode

Leetcode/FindMinimumInRotatedSortedArray.cpp

@@ -0,0 +1,27 @@
+
+
+//Problem Link :https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
+
+class Solution {
+public:
+    int findMin(vector<int>& nums) {
+        int start=0,end=nums.size()-1;
+        int minValue=INT_MAX;
+        while(start<=end)
+        {
+            int mid=(start+end)/2;
+            if(nums[mid]>=nums[start])
+            {
+                minValue=min(minValue,nums[start]);
+                start=mid+1;
+            }
+            else 
+            {
+                minValue=min(minValue,nums[mid]);
+                end=mid;
+            }
+
+        }
+        return minValue;
+    }
+};

Leetcode/HouseRobber.cpp

@@ -0,0 +1,22 @@
+//Problem Link: https://leetcode.com/problems/house-robber/
+
+
+
+class Solution {
+public:
+    int rob(vector<int>& nums) {
+        int n=nums.size()-1;
+        if(n==0)
+        {
+            return nums[0];
+        }
+        int arr[n+10];
+        arr[0]=nums[0];
+        arr[1]=max(nums[0],nums[1]);
+        for(int i=2;i<=n;i++)
+        {
+            arr[i]=max(nums[i]+arr[i-2],arr[i-1]);
+        }
+        return arr[n];
+    }
+};

Leetcode/JumpGame.cpp

@@ -0,0 +1,20 @@
+//problem Link: https://leetcode.com/problems/jump-game/
+
+
+
+class Solution {
+public:
+    bool canJump(vector<int>& nums) {
+        int maxNow=0;
+        for(int i=0;i<nums.size();i++)
+        {
+            if(i<=maxNow)
+                maxNow=max(maxNow,i+nums[i]);
+            else
+                break;
+        }
+        if(maxNow>=nums.size()-1) return true;
+
+        return false;
+    }
+};