704. Binary Search - LeetCode - Python - Tamil

[@codemeal]

LeetCode Problems List: 1drv.ms/x/s!AkgNDNNKPSs3lB5Y7B51R0OfDERa?e=JFjlOc

[@srijasabarinathan]

Bro dsa in python nenga mattu dha bro puriyara maari sollitharinga very thanks bro and helpful too 😢❤

[@RiseWithUdaya-q8m]

S bro super

[@JK-de2gh]

best dsa in python youtuber❤❤...comeback bro...

[@sivag98]

Thanks for posting dsa videos from leetcode. Especially in our tamil language its very easy to understanding bro... Keep posting more dsa problems using python.. Inspiring!!!

[@codemeal]

Thank you so much for you appreciation bro.. 💖 I will try to upload more problems from DSA bro 💥

[@RiseWithUdaya-q8m]

Thanks very much keep doing.one day or day one🎉

[@selvarani7232]

Please comeback and upload more videos....In this teaching field you have a best future

[@eatlive2708]

Unmaiya enakee intrest vanthu iruku padikaa❤ thanks bro❤ place aagitu comment panren❤❤

[@Growth__Hub_2805]

Nalla explain panringa bro,,

[@codemeal]

Thanks bro ❤️

[@PrAsHaNtHdUke1093]

bro super video thanks..

[@gouthamans690]

Vera mathri bro

[@jayaprakashs4412]

array sorted ah illana enna algorithm use pannanum?

[@likes4389]

Thanks ,bro Bro dsa algorthem video podunga like greedy athumathri algorithem matum explain pannunga pls

[@codemeal]

Sure bro weekend days la antha maathiri videos podren bro ❤️

[@shamrinasiya8108]

Thank you brooooo🥹💗

[@naveenanimationtamil9785]

Bro suppose ascending order ilama randoma eruntha enthan time complexity la varum bro

[@freakwithcomali5680]

Binary search tree,trees,heap,linked list updates this concept bro .pls do it bro

[@SABARI-t7]

Bro equal uh iruntha matum the index return Panna solringa appo elif condition ku yen return kudukala??

[@tamilkodi61]

👍

[@tamilkodi61]

Descending orderla iruntha apply pannalama

[@codemeal]

Yes bro panalam condition matum inverse la podanum avlothan

[@ArunKumar-sg6jf]

log 6 is 2.5

[@manideva6]

The two-pointer technique is generally not applicable to binary search in its traditional sense. In binary search, you maintain two pointers (left and right) to represent the current search interval. These pointers are updated based on whether the target value is greater or less than the middle element of the current interval, but they don't simultaneously traverse the array from two different ends, which is the characteristic of the two-pointer technique. However, you could argue that the concept of having two pointers (left and right) resembles the two-pointer technique to some extent, but it's not the same in practice. The two-pointer technique is typically used for tasks like finding a pair of elements that sum up to a target value or solving problems related to window sliding, while binary search is specifically designed for searching sorted arrays efficiently by dividing the search interval in half with each iteration.

[@codemeal]

Thanks for your interesting comment! You are absolutely correct. I understand how it might seem confusing. In my video, I mentioned using the two-pointer technique to solve binary search. While both techniques do involve the use of two pointers, it's important to note that they are applied differently. In binary search, the pointers are used to define the search interval and narrow down the search space by dividing it in half with each iteration. This is different from the traditional two-pointer technique, where both pointers usually traverse the array from two different ends simultaneously. So while I referred to it as the 'two-pointer technique', it's more specifically used within the context of binary search in my explanation. I hope this clears up any confusion! Thank you for bringing this up, and I'll make sure to provide more precise explanations in future videos.