Search Insert Position | Leetcode 35

Search Insert Position
Leetcode problem number 35
Time Complexity: O(logn)
JAVA interview programming playlist:
• Interview Programming ...
Git repo: github.com/Technosagelearning...
#java #interviewquestions #leetcode

[@nigarsultana1739]

Thanks a lot mam!!!

[@abhishekkumaryadav1447]

thank you mam i am a beginner and i was not able to understand the approach from others,you taught in a simple way...thank you

[@user-xr6gx3hb4k]

you explanation is really clear Thank You

[@malleshreddy2553]

Thanks Ma’am new subscriber

[@trying-code3726]

mam i am from bangladesh .. and i like your video ..

[@rishabhkumar493]

mid=start+end/2 may exceed the range of int values in java , Isn't ? We can also use mid = start+(end-start)/2 to remain in range for large values 😊

[@mayappapujari9259]

mam your linkedin link is not working

[@simplified_coder]

Great job mam

[@Hellen-qx3lb]

Thank you

[@bhavikvora07]

if i am beginner and i am solving easy question in leet code after logic understood or half code done or logic not converting in code and i see solution is this right choice ??? Technosage

[@TechnosageLearning]

Absolutely!! If you will keep on solving problems like this .one day you will be able to solve all problems on your own...

[@bhavikvora07]

@@TechnosageLearning Thank You for ur advice 🙏

[@trying-code3726]

What software are you using to write ?

[@TechnosageLearning]

I am using open board to write

[@anoopshetty3580]

let val =0; if(target==0 || nums.length==1) { val = 0 return val } for(let i=0; inums.length) { val = nums.length } } return val is my solu fully wrong ?