Bringing computer science concepts closer to people
This is the perfect spot for college students eager to conquer computer science and rock placements!
What's in Store?
In-Depth Tutorials: Algorithms, data structures, programming languages. Real Coding Examples: Practice makes perfect - follow along with our coding demos. Expert Guidance: Learn from experienced instructors passionate about helping you succeed.
This is the best video on this problem. There are many videos on coding dp solution. But no one explains through recursion the intuition behind DP. Thank you.
A similar problem "Permutations of a given string" for practice. It uses the same technique explained in this video. www.geeksforgeeks.org/problems/permutations-of-a-given-string2041/1
Let's modify the original problem slightly. 🤔 Instead of returning the second middle node, can you adapt code to return the first middle node if there are two middle nodes?
Yes, Moor's voting algorithm works only if there is an element which occurs > n/2 times. Hence, for the example 1 0 1 0 2 2 it wont work. If such an input is possible, we need to do the second pass and verify that the candidate is indeed majority element. But, the problem statement here clearly states that majority element always exists. So, we need not handle that.
This example doesn't have majority element (element which occurs >n/2 times). This input is not possible as per the assumption given that majority element always exist.
Good one madam. But second pass is needed to confirm whether what we found is really the majority ele. I saw some arrays where without second pass the presumed one may not be majority ele. Reference- wiki It says the following However, it is possible to perform a second pass over the same input sequence in order to count the number of times the reported element occurs and determine whether it is actually a majority. This second pass is needed, as it is not possible for a sublinear-space algorithm to determine whether there exists a majority element in a single pass through the input.
Nice! Telugu lo chepachu kada madam. In fact lot of youtubers cover these stuff. Hardly any telugu algorithm based youtubers baring language based. My opinion Few telugu based youtubers have ~4 lakh subscribers Don't think local language base is small. Being a satiating pond is better than being a drop in ocean.
I had similar thought process and started as Telugu channel. Did a few videos on algorithms in Telugu two years ago. But the reality was different. No views 😀 So, I stopped. ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-wNqa2ohsYn8.html With feedback and encouragement from students, restarted recently with things that would be useful for them. Lets see how this episode goes.
@@codepatasala But i came to your channel when i googled for coding problems in telugu. Hardly any in fact and your channel was in mid of 1st page. In fact in english, there are many too gud. Erichtoo , colin, and many more...
Hi, depending on your branch and current comfort level, you have to practice coding problems. LeetCode is a good platform. You should be able to solve atleast 100 easy and medium problems there before interviews. After that, participating in hackathons is a good way to get off campus calls. A good summer internship plays a very good role. If you need more information, you can get in touch via WhatsApp at codepatasala.com/#contact
I am glad that you liked it. Planning to do a complete series of around 160+ problems to help prepare for tech interviews. 🤞 Thank you so much for the feedback. Will work on improving handwriting, still learning to write on screen.
