Solving Arrays Questions | Find the element that appears once | GeeksForGeeks | Nishant Chahar Ep-13

Bhaiya this approach going to take O(n) time complexity but in gfg we have to solve it in O(log n) so how we can do it by using Binary search ?

name of this question in leetcode??

if an element appears more than once and odd number of times it doesn't work... what should i do then... in other words this method only works when the non-unique numbers are present even number of times..

What if n is even

Fantastic

what if there are multiple elements which occur only once

what if I use a nested for loop and not a different array;

but it did'nt get applied on number i.e occuring odd no. of times please so, provide sol. for that

Itna bhi easy nhi tha O(log n) me krna tha , O(n) me kr k dikha diya qsn pdh bhi lo yrr

like toh banta hai

bruteforce Approach :
*JAVA*
static int brute(int[] nums, int n) {
for(int i = 0; i < n; i++) {
int cnt = 0;
for(int j = 0; j < n; j ++) {
if(nums[j] == nums[i]) cnt++;
}
if(cnt == 1) return nums[i];
}
return -1;
}

1 no...

explanation is very easy to understand ,,,,thank you bhaiya😊

Kaafi shi trah s samjhaya 🔥
Keep going bhaiya and sorry aaj aapke live m nii aaska

Understood

Thanks bhaiya

Day 38 Done ✅

Bhai o question log n time pe Diya hai not in o of n

It's look like mathematical reasoning

Very helpful video bro 😍

bro plz make video on how ty\o learn html

Hi @nishant can you please make review on kunal kushwaha interview, placement series....
It will be very much helpful
thanks for the educational content you are providing in such a simplified manner without animations Hat's off to you.

Day 38 - Done with watching and understood the concept. Will practice now. @/codein10❤️ @/consistency❤️

Bhaiya is Computer Science and Communication Engineering good? Does it deals with coding ? Is it a IT branch? Do we become a software engineer after completing it?

Bhaiya aap pagal ho gye kya. Yaar mtlb manana pdega after placement after full time job aisi consistency. Oh bhai. This is called selfless hardwork. Thank you so much bhaiya. Wow 🤩🤩🤩🤩🤩. Love you so much...... 🙏

The concept was explained very clearly and without fail you upload the videos daily.. Great work bhaiya

Sir plzz give assignment 🥺

bhiya java complete course kab aayega

Java series bhi chalaye sir

Sir thank you

Day 38
Solving Array Questions
Everything was clearly explained by you. You work incredibly hard and you are very much committed to your daily work. You are close to reaching 30 K subscribers. Congratulations in advance for that. Keep producing remarkable content like this. I have been viewing your videos every day for the past 38 days. I can't believe how quickly time has flown by. It's all a result of your commitment to the explanation and the bond you have built with the audience. I deeply appreciate all of your knowledge and work from the start. I am learning so much, and I value your guidance and support. You invest a lot of effort and dedication in everything you achieve. I look forward to meeting you soon and getting to know you better while learning valuable knowledge from you. You are the best, Nishant bhaiya!

Loving your content

Bro can you please add the subtitles?? If it is in English it will be easy for those who don't understand Hindi..(like me)

I love your reels & the main channel videos.. Keep doing this Nishant Bro 👍🏻👏🏻❤️

Well explained💛

Sir web page create karne ke liye HTML jarurat he to pls HTML padhaiye

we can use two pointer approach as well as they clearly mentioned sorted array

Thank you bhaiya for the day❤

thanks for today

Thank you very much bhaiya 💗

XOR: a. 0 ke sath kisi no ka XOR = same number.... b. different number(0/1) = XOR value is 1.. Thanks Nishant, this is very useful

Keep this series on💥💥💥

Aare bhai Arrays Solve karthai 🤣 .
Bhai WelCome to Hyderabad 🫂

Can we hit 30k by this week💕

Yesh yesh we can💕🎉

Bohot badhiya se samjhaya bro ✨

Day 38 ✅🔥

Voice sound low hai bahut