Solving Arrays Questions | Find the element that appears once | GeeksForGeeks | Nishant Chahar Ep-13
ฝัง
- เผยแพร่เมื่อ 6 ก.ค. 2022
- In this video, we'll are going to solve some more questions of the array. Arrays are really important because we are going to use them a lot in future topics. So make sure that you watch this lecture carefully.
Question link: practice.geeksforgeeks.org/pr...
Previous lecture: • What are Arrays? | Def...
You can use my code NISHANT to get 15% Off on all GFG courses.
✨ Important Links ✨
- Don't Click Here: bit.ly/3afmPha
- Telegram Link: t.me/codeIn10byNishant
- Github Repo Link: github.com/chaharnishant11/Co...
✨ Hashtags ✨
#NishantChahar #Microsoft #DSA #Recursion #FAANG #NSIT #NSUT #engineering #internship #college
✨tags ✨
Where to learn dp
where to learn graphs
where to learn dsa
how to start programming
how to start coding
where to learn trees
what is memoisation
what is tabulation
what are graphs
where to learn Operating systems
where to learn dbms
where to learn oops
where to learn computer networks
where to learn low level design
where to learn cs fundamentals
Sanchit jain
Gaurav sen
Gate smashers
Placement guide
How to start programming
where to learn cpp
where to learn python
where to learn javascript
where to learn java
Placement guide
Nishant Chahar Placement Guide
languages to learn
resources to learn data structures
Projects development
AR/VR
Blockchain Machine learning
Deep Learning
Software developer engineer ,
Side projects ,
Importance of side projects ,
Machine Learning Engineer,
How to become a machine learning engineer ,
Associate engineer
Data structures Algorithms
College Life, College, Memories
Fun Fests Chill Enjoy
IITD Mood indigo rendezvous IIT
NSUT Moksha DTU Engifest
Bits Bitsgoa
Namaste Javascript
Namaste Javascript Akshay Saini
Apna college
Apna college c++
apna college DSA
Where to learn dp
where to learn graphs
where to learn dsa
how to start programming
how to start coding
where to learn trees
what is memoisation
what is tabulation
what are graphs
where to learn programming
how to start coding
where to learn coding
where to learn DSA
resources to learn programming
how to crack amazon
how to crack placement
blockchain
what is blockchain
blockchain technology
blockchain technology explained
blockchain explained
blockchain technology in hindi
web development roadmap
roadmap to learn web development
android development roadmap
MERN stack roadmap
machine learning roadmap
roadmap to learn machine learning
roadmap for deep learning
roadmap for 2nd years
roadmap for opensource
roadmap for ios development
roadmap for deep learning
roadmap to learn DSA
![[TH] VCT Pacific Stage 2 - Playoffs Grand Final // GEN vs DRX](http://i.ytimg.com/vi/Su6gA_UPs9s/mqdefault.jpg)
The concept was explained very clearly and without fail you upload the videos daily.. Great work bhaiya
Never gets bored while taking your lecture 38 completed.Learning and growing 🥰
explanation is very easy to understand ,,,,thank you bhaiya😊
We believe in you
Great teaching by great mentor
Road to 50k
❤🔥
we can use two pointer approach as well as they clearly mentioned sorted array
Kaafi shi trah s samjhaya 🔥
Keep going bhaiya and sorry aaj aapke live m nii aaska
Coincidence mene Aaj hi yeh question solve kiya 🔥
Explanation and consistency 💯
thanks for the Video bhaiya............
full support
consistency OP
Thanks so much bro
Loving your content
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!
Nichant bhaiya 💗
Video was good 👍 👌 👏
Keep going 💯
Keep learning 💯
Thanks 😊
Great Bhaiya 👍
uploading videos everyday is not a joke✌ you teaches very well brother💓💓
You are Great 👉
Thank you very much bhaiya 💗
Well explained💛
Well explained ✨
Enjoying and solving ❣️
Day 38 video to smj aari h bhaiya thanks :) bs result kb aaega ye smj ni aa rha ;)
Fantastic
Very helpful video bro 😍
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
is this approach valid if numbers repeating three times
Thank you bhaiya for the day❤
thanks for today
Good 👍
Bohot badhiya se samjhaya bro ✨
Great 👍
The moment you said " Find the element that appears once" I was like "maja aa gaya ye toh maine kiya hai"
I really like this question and the intuition behind the solution is very easy to be understood as I was so so in "Digital Electronics"
and I loved the logical gate part a lot
Again thanks for this fun challenge
Thankyou Brother ❤️
Sir thank you
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 ?
Understood
Nice 💕
Today is also done 👍
Day 38 - Done with watching and understood the concept. Will practice now. #Codein10❤️ #consistency❤️
Day 38 - Done with watching and understood the concept. Will practice now. @/codein10❤️ @/consistency❤️
Thanks bhaiya
30 k subscribers soon ❤
Keep this series on💥💥💥
#CodeIn10 ❤❤
your great bhaiya.
present here 38 days completed successfully thankyou Nishant bhaiya for your support ❤️#nishantchahar.
very excited for Microsoft ture 😅😅😅😅
Aare bhai Arrays Solve karthai 🤣 .
Bhai WelCome to Hyderabad 🫂
1 no...
Day 38 🔥😎
Thanx bhai💟💯
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;
}
bhiya java complete course kab aayega
Day 38 - done successfully #arrays #Codein10
name of this question in leetcode??
Thank you bhaiya for everything... Consistency day 38 :)
🔥🔥🔥
I wrote this code my self for the answer of this vdeo... But still I am not getting how to do this code in geeks for geeks ;(
#include
using namespace std;
int main() {
int arr[] = {1,2,5,8,5,3,8,5,7,6,1,7,9,4,7};
int times = 0;
int size = 15;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (arr[i] == arr[j]) {
times += 1;
}
}
// cout
👍
what if there are multiple elements which occur only once
bro plz make video on how ty\o learn html
Day-38 done ✅
Dp plzz bro
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.
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...... 🙏
Day 37 done
Can we hit 30k by this week💕
Yesh yesh we can💕🎉
Day 38 Done ✅
What if n is even
Sir web page create karne ke liye HTML jarurat he to pls HTML padhaiye
Java series bhi chalaye sir
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?
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..
Sort karo. Phir check Karo jiska left ya right mein equal value nehi hai, to wo unique element hai
Day 38 ✅🔥
Week - 6 started
Very much excited
There is no feeling of getting bored by stretching all these 5 weeks feels good and more capable of doing more & more coding everyday
Thanks bhaiya😎
Shiv
Arrays++
Day-38 done ✅
Dp plzz bro
30 k subscribers soon ❤
Bhai o question log n time pe Diya hai not in o of n
It's look like mathematical reasoning
Ok
Voice sound low hai bahut
Bhaiya I am from mechanical branch and in tier -3 clg and interested so much in coding what should I do to get placed in top MNC
Your reply will be valuable 🙏
Koi bootcamp join karlo
Sir plzz give assignment 🥺
like toh banta hai
it wont work if you have more than 1 unique number😄
Bro take this in English bro fully plss....
Itna bhi easy nhi tha O(log n) me krna tha , O(n) me kr k dikha diya qsn pdh bhi lo yrr
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 👍🏻👏🏻❤️
Bhaiya wait hi kar rha tha video ki(first comment)
preetkatiyar999