more solutions

Author: Arthav24

Easy difficulty/README.md

@@ -1,2 +1,4 @@
 # LeetCode Submissions
- My archive for leet code problem submissions
+my profile : https://leetcode.com/arthav24/
+leet code problem submissions
+Difficulty : Easy 

Easy difficulty/climb.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int climbStairs(int n)
+{
+    if (n <= 0)
+        return 0;
+    else
+    {
+        int stair[n + 1];
+        stair[0] = 1;
+        stair[1] = 1;
+        for (int i = 2; i <= n; i++)
+            stair[i] = stair[i - 1] + stair[i - 2];
+    
+    return stair[n];
+    }
+}
+int main()
+{
+    cout << climbStairs(4);
+
+    return 0;
+}

Easy difficulty/str.cpp renamed to Easy difficulty/str palindrome.cpp

@@ -0,0 +1,4 @@
+# LeetCode Submissions
+my profile : https://leetcode.com/arthav24/
+leet code problem submissions
+Difficulty : Medium

Medium difficulty/README.md

@@ -0,0 +1,29 @@
+int extremeInsertionIndex(vector<int> nums, int target, bool l) {
+        int left = 0;
+        int right = nums.size();
+
+         while (left < right) {
+            int mid = left+(right-left) / 2;
+            if (nums[mid] > target || (l && target == nums[mid])) {
+             right = mid;
+            }
+            else {
+                left = mid+1;
+            }
+        }
+
+        return left;
+    }
+    vector<int> searchRange(vector<int>& nums, int target) {
+        vector<int> r = {-1, -1};
+
+        int leftIdx = extremeInsertionIndex(nums, target, true);
+        if (leftIdx == nums.size() || nums[leftIdx] != target) {
+            return r;
+        }
+
+        r[0] = leftIdx;
+        r[1] = extremeInsertionIndex(nums, target, false)-1;
+
+        return r;
+    }

Medium difficulty/firstnlastpos.cpp

@@ -0,0 +1,23 @@
+int findMin(vector<int>& nums) {
+         if (nums.size()== 1) 
+      return nums[0];
+    int left = 0, right = nums.size() - 1;
+    if (nums[right] > nums[0]) {
+      return nums[0];
+    }
+    while (right >= left) {
+      int mid = left + (right - left) / 2;
+      if (nums[mid] > nums[mid + 1]) {
+        return nums[mid + 1];
+      }
+      if (nums[mid - 1] > nums[mid]) {
+        return nums[mid];
+      }
+      if (nums[mid] > nums[0]) {
+        left = mid + 1;
+      } else {
+        right = mid - 1;
+      }
+    }
+    return -1;
+    }

Medium difficulty/mininrotatedarray.cpp

@@ -0,0 +1,8 @@
+ int findPeakElement(vector<int>& nums) {
+     vector<int> ori(nums);
+     if(nums.size() == 0)
+    return -1;
+    make_heap(nums.begin(),nums.end());
+    return (find(ori.begin(),ori.end(),nums.front())-ori.begin());
+    
+  }

Medium difficulty/peakelement.cpp

@@ -0,0 +1,12 @@
+int search(vector<int>& nums, int target) {
+        vector<int> ori(nums);
+        sort(nums.begin(),nums.end());
+        int left=0,right=nums.size()-1;
+        while(left<=right){
+            int mid=left+(right-left)/2;
+            if(nums.at(mid)==target) return (find(ori.begin(),ori.end(),nums.at(mid))-ori.begin());
+            else if(nums.at(mid)<target) left=mid+1;
+            else right=mid-1;
+        }   
+        return -1;
+}

Easy difficulty/romantoint.cpp renamed to Medium difficulty/roman-int int-roman.cpp

@@ -0,0 +1,3 @@
+# LeetCode Submissions
+My archive for leet code problem submissions
+my profile : https://leetcode.com/arthav24/

Medium difficulty/searchinrotatedarray.cpp

@@ -35,9 +35,6 @@ void inorder(struct node *root)
         inorder(root->right);
     }
 }
-int romanToInt(string s)
-{
-}
 
 int main()
 {
@@ -52,6 +49,5 @@ int main()
     insert(root, 1);
     inorder(root);
 
-    //cout<<romanToInt("II");
     return 0;
 }