Video

Got it we doin thay for complexities

Yes for FAANG companies they will insist on logarithmic solution even for SDE I role@@arshiyanx

@@codingForFAANG yes yes but how one can go for optimal solution should start with our logic then Go for optimal?

A good interviewer will guide you towards looking for a logarithmic solution. But i have seen cases where no guidance was given. The general rule is look for a logarithmic solution whenever the data is sorted. My advice is to take your time before starting to code and discuss the solution with the interviewer. After he is satisfied with the logic then go ahead @@arshiyanx

@@codingForFAANG yeah that's great 👍❤️

Let me know if there is an easier solution

Thank You!

Thank you! Peace be on you too. Can you please post your question in English as I cant speak Arabic and Google translate is doing a bad job.

@@codingForFAANG May the peace, blessings, and mercy of God be upon you.. Thanks for the great work you do on this channel. I wanted to ask: Is it possible to use binary search to search for a number in which, when dividing by another known number, the remainder of the division is equal to zero? And what is the criterion for moving between the numbers that we choose for that? Please reply please.. Thank you very much

Binary search algorithm is used to search for numbers in a sorted array. It takes advantage of the fact that since the array is sorted we can cut the area to search by half each time. It works by finding the midpoint and based on whether the target is greater or lesser than the mid point, we divide the area to process the search. Consider array - [10, 14, 26, 27, 31, 33, 44], and we are trying to search for 33, binary search will work as follows Step 1: Find midpoint. For given array low index = 0, high index= 7. (0 + 7)/2 = 3 (we round to the nearest integer) Step 2: find value of mid, In the array value saved at index 3 is 27 Step 3: Compare with target, since 31 is greater than 27, then target is saved in the right half of the array. Step 4: We set low index = 4(mid + 1), high index = 7. Step 5 We repeat again from Step 1 See www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search for more details. Hope that helps.

@@codingForFAANG thank you very very much for your help and support.

@@Mmmoijj No problem Happy to help

Yes, earlier I used Quick Time player to record my videos. I did not realize that the volume was being lowered after youtube upload. I have started using iMovie to adjust the sound now. Moving forward it will be fine.

Thank you 😃

Hi, Thanks for watching! I started by solving the Easy problems with the highest acceptance rate. I like to use filters that are present in the leetcode search (eg) Top 100 Liked Questions. They cover a wide range of algorithms. Link - leetcode.com/problemset/algorithms/?sorting=W3sic29ydE9yZGVyIjoiREVTQ0VORElORyIsIm9yZGVyQnkiOiJBQ19SQVRFIn1d&difficulty=EASY&page=1&listId=79h8rn6 I started by solving 2-3 Easy problems a day to get into the groove. Later I started focussing on Medium/Hard questions that get asked during coding interviews. Hope that helps!

@@codingForFAANG Thanks that helps. Just wanted to know where is the best place to learn algorithm and data structures. Before going to leet code.

@@abdirahmanahmed2472 I recommend the following books 1. Cracking the Coding Interview www.amazon.com/Cracking-Coding-Interview-Programming-Questions/dp/0984782850/ You should find a copy of this book in any library 2. Data Structures and Problem Solving www.amazon.com/Data-Structures-Problem-Solving-Using/dp/0321541405/ This was the recommended book by my university

Thanks! Yes that solution works too. I avoid Arrays.sort() Collections.sort() in my solutions since worst case time complexity can be O(n^2).