Search Insert Position

Author: ishpreet-singh

10.cpp

@@ -0,0 +1,34 @@
+/*
+
+Search Insert Position
+----------------------
+
+Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+
+You may assume no duplicates in the array.
+
+Example 1:
+
+Input: [1,3,5,6], 5
+Output: 2
+Example 2:
+
+Input: [1,3,5,6], 2
+Output: 1
+Example 3:
+
+Input: [1,3,5,6], 7
+Output: 4
+Example 4:
+
+Input: [1,3,5,6], 0
+Output: 0
+*/
+
+class Solution {
+public:
+    int searchInsert(vector<int>& nums, int target) {
+        if(binary_search(nums.begin(), nums.end(), target)) return lower_bound(nums.begin(), nums.end(), target) - nums.begin(); 
+        else return upper_bound(nums.begin(), nums.end(), target - 1) - nums.begin();
+    }
+};

8.cpp

@@ -0,0 +1,30 @@
+/*
+
+Power of Two
+------------
+
+Given an integer, write a function to determine if it is a power of two.
+
+Example 1:
+
+Input: 1
+Output: true 
+Explanation: 20 = 1
+Example 2:
+
+Input: 16
+Output: true
+Explanation: 24 = 16
+Example 3:
+
+Input: 218
+Output: false
+*/
+
+class Solution {
+public:
+    bool isPowerOfTwo(int n) {
+        long long m = n;
+        return m && (!(m&(m-1)));
+    }
+};

9.cpp

@@ -0,0 +1,44 @@
+/*
+
+Is Subsequence
+--------------
+
+Given a string s and a string t, check if s is subsequence of t.
+
+A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).
+
+Follow up:
+If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?
+
+Credits:
+Special thanks to @pbrother for adding this problem and creating all test cases.
+
+ 
+
+Example 1:
+
+Input: s = "abc", t = "ahbgdc"
+Output: true
+Example 2:
+
+Input: s = "axc", t = "ahbgdc"
+Output: false
+ 
+
+Constraints:
+
+0 <= s.length <= 100
+0 <= t.length <= 10^4
+Both strings consists only of lowercase characters.
+*/
+
+class Solution {
+public:
+    bool isSubsequence(string s, string t) {
+        int j=0;
+        for(int i=0; i<t.size(); i++) {
+            if(j < s.size() && t[i] == s[j]) j++;
+        }
+        return j == s.size();
+    }
+};

README.md

@@ -1 +1,14 @@
-# leetcode-june-challenge
+# LeetCode June Challenge
+
+| S No |             Problem            |                                          URL                                         |
+|:----:|:------------------------------:|:------------------------------------------------------------------------------------:|
+|   1  |       Invert Binary Tree       |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/1.cpp) |
+|   2  |  Delete Node in a Linked List  |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/2.cpp) |
+|   3  |       Two City Scheduling      |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/3.cpp) |
+|   4  |         Reverse String         |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/4.cpp) |
+|   5  |     Random Pick with Weight    |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/5.cpp) |
+|   6  | Queue Reconstruction by Height |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/6.cpp) |
+|   7  |          Coin Change 2         |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/7.cpp) |
+|   8  |          Power of Two          |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/8.cpp) |
+|   9  |         Is Subsequence         |  [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/9.cpp) |
+|  10  |     Search Insert Position     | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/10.cpp) |