Leetcode solution Search Insert Position

chetannada · chetannada · commit 0a31cd44e169 · 2023-02-20T23:30:35.000+05:30
diff --git a/2023_year/February_2023/index11.js b/2023_year/February_2023/index11.js
@@ -0,0 +1,36 @@
+// https://leetcode.com/problems/search-insert-position/description/
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function(nums, target) {
+    // Initialize result variavle and set to zero
+    let result = 0;
+    // loop through the every element of an array
+    for(let i= 0; i<nums.length; i++){
+        // check if last value of an array is greater than or equal to target
+        if(nums[nums.length -1] >= target){
+        // check if current item is equal to target
+        if(nums[i] === target){
+            result = i;
+            break;
+        }else if(nums[i] > target){ // check if current item is greater then target
+            result = i;
+            break;
+        }
+        }else{
+            // if last value of array is less than target
+            result = nums.length;
+        }
+    }
+    // check if result is zero the retutn array length value neighter result value
+    return result;
+};
+console.log(searchInsert([1,3,5,6], 5)); // 2
+
+/*
+Input: nums = [1,3,5,6], target = 5
+Output: 2
+*/
diff --git a/index.html b/index.html
@@ -9,6 +9,6 @@
 <body>
     <div id="root"></div>
     
-    <script src="./2023_year/February_2023/index10.js"></script>
+    <script src="./2023_year/February_2023/index11.js"></script>
 </body>
 </html>
