Find the two non-repeating elements in an array of repeating elements | Bit Manipulation | DSA Sheet

#bit #bitmanipulation #bitmasking #competitiveprogramming #coding #dsa
Hey, Guys in this video I have explained how we can solve the problem 'Find the two non-repeating elements in an array of repeating elements'.
--------------------------------------------------------------------------------
Unacademy Links--
Use my code "YOGESH" to access all FREE classes and get a 10% Discount on Paid Courses.
Career as a Developer: unacademy.com/goal/career-as-...
Approaching CodeChef: bit.ly/Unacademy-Yogesh-Softw...
--------------------------------------------------------------------------------
Join our Telegram Channel for more Information
🔰 Telegram Channel Link = t.me/CodeLibrary1
🔰 Telegram Discussion Group Link = t.me/CodeLibraryDiscussion
Subscribe Our 2nd Channel = / @codeupwithtwins6728
🔰 Array Playlist = • Love Babbar DSA 450 Qu...
🔰 String Playlist = • Love Babbar DSA 450 Qu...
🔰 Searching and Sorting Playlist = • Love Babbar DSA 450 Qu...
🔰 Binary Tree Playlist = • Love Babbar DSA 450 Qu...
🔰 Linked List Playlist = • Love Babbar DSA 450 Qu...
🔰 Graph Playlist = • Love Babbar DSA 450 Qu...
🔰 Dynamic Programming Playlist = • Love Babbar DSA 450 Qu...
🔰 Informative Videos = • Informative Videos
🔰 Love Babbar DSA Sheet: drive.google.com/file/d/1FMdN...
Follow us on Instagram:
🔰 Shailesh Yogendra : / shaileshyogendra
🔰 Yogesh Yogendra : / i_am_yogesh_here
Follow us on LinkedIn:
🔰 Yogesh Yogendra : / yogesh-yogendra-26bbb518a
🔰 Shailesh Yogendra : / shailesh-yogendra-8b13...
Hope you like it. Comment if you have any doubt
LIKE | SHARE | SUBSCRIBE
Time Stamps
0:00 Intro + Example
2:16 promo
3:46 Explanation + Code

[@anuraggulati2167]

bhai maza aagya thankyou... i recently started DSA sheet this videos is helpfull keep it up

[@vivekjaiswal4391]

Really a great teacher ......keep it up

[@aadityasharma6855]

Crystal clear explaination, thank you so much.

[@pratapp.s.p.6264]

Bhai kuch kuch numbers pe ye sahi nhi run ho raha

[@nikhillumesh2457]

what if both the elements are even ?
or both the elements are odd ?
then how do we split ?

[@saptarshirajsinha1140]

right most bit...but the formula XOR & ~(XOR-1) will come automatically

[@SaumyaSharma007]

thanks, bros.

[@ashutoshyadav1529]

what if both non repeating numbers are even example: 1,1,2,3,3,4,5,5 will this code run for it?

[@BaljeetSingh-ul3yo]

class Solution {
public int[] singleNumber(int[] nums) {
int res = 0,setBit=1;
int[] result = new int[2];
for(int i=0;i

[@shivanigowda3526]

very nice explaination

[@sukritiguin5637]

great explanation

[@user-ou9kp4vn2g]

at line 30you sort the elenment ? doesn't it takes TC nlogn?

[@Mandeepsingh-jo5cf]

thanks!

[@melodytunes2204]

bhai apka explanation toh kamal hai

[@jobaerhassan4870]

awesome voice +explaination

[@AmanMishra-rg3jd]

i know java i have one doubt that while using Vector ans will our space complexity be O(n) ? in solution we want O(1) ? Correct me if i am wrong!

[@anshikaagrawal2356]

same doubt 😑

[@vineethchivukula]

We don't consider the answer vector when calculating space complexity.

[@NikitaSingh-kz2ii]

can anyone plz share the code for sorting approach

[@shubhamgond2884]

Nice explanation

[@SreejanjiVlogss]

can anyone please explain what is happening in line 17 and and how we get the formula xor & ~(xor-1) ?

[@senkaku7705]

a&(~(a-1)) gives "1" where the right most bit is "1" and "0" in other places

[@SreejanjiVlogss]

@@senkaku7705 thnxs🙂

[@showsshorts4696]

bhaiya rightmost bit xor&1 karke bhi toh nikali jaa shakti thi what is the catch in this

[@shrutiomatic]

5:54
Sort
Hash map
Bits

[@official.frostburn]

Bro, zoho ke level 2 Hai Mera 27 ko, zoho vale konse topics pr focus karte Hai?

[@CodeLibrary]

level 2 focus more on array,strings,hashing and matrix

[@Manishkumar-wt9tf]

sir aapne odd number aur even number ko alg kar dene ko agar non repeating element dono odd ya even ho to usko thori na find out kar skate hain.

[@BaljeetSingh-ul3yo]

class Solution {
public int[] singleNumber(int[] nums) {
int res = 0,setBit=1;
int[] result = new int[2];
for(int i=0;i

[@hariprasadcr5936]

excellent explanation , :)

[@Skm-mq1sw]

Bro heap ka bhi bna do

[@CodeLibrary]

ya will make

[@nomaanahmad5851]

Bhaiya please graph ke upload karo

[@CodeLibrary]

graph ke toh bahut sare upload kiye hue hai....have a look in playlist

[@nomaanahmad5851]

@@CodeLibrary nhi bhai uske aage ki baat kr rha hu

[@CodeLibrary]

will do that don't worry

[@nomaanahmad5851]

@@CodeLibrary bhaiya ye batao apne experience se kya ye sheet sirf solve kr lene ke baad yahi question repeat hoga interview me

[@CodeLibrary]

jaruri nhi hai new questions bhi aa sakte hai but agar tum ye sheet solve kar lete ho toh tumhe new questions karne ka confidence aa jaega

[@MohitKumar-is2xg]

vahyaad explaination

[@anujprajapati2905]

Bro please provide the code in python too.

[@tanaypatidar2825]

abhi bhi short hi bol rahe ho bhai, short == sort