how much time did it took to complete the playlist and how many videos were you watching everyday

Bro there is competative programming sheet also, if you have finished that do a deep dive in stl if c++ or collections if in Java, then do math a lot, remember no tutorial can prep you for competitive programming it is just you and you have to go deep dive in it and eventually you will learn ,from some who is 2000 on Codeforces. Best of luck

Mastering Segment tree, BIT,dp and graph will surely put you cm or master level but surely it's gonna take a lot of time and effort.

@@adarshrai1390 bro how you counter questions from the topic that you didn't covered, does that mean you have to first cover all the dsa topics and then start cp, btw congo bro, i respect your rating!!

WILL THE BUCKET WORK IF THE NO,S ARE NOT IN CLUSTERS

@@ArkojyotiDeyOfficial Yes, Works for every possible arrangment of the elements.

both are correct because that line is used to execute the point "num[i] will go to twos if it is in ones" . lets consider the the array be arr={2,2,2,3} step 1: ones=2 and twos=0 step 2: num[i]==2 and ones is also 2 which means we have to delete 2 from ones. now ones==0 if it the first occurrence of 2 then it should be present in ones but it is not (because ones==0) which means it is the second occurrence of 2 which means 2 is now added in twos that why we use the condition that ***it should not be present in ones*** by ~ones.

i didnt understand this concept can you explain

Same Thought Bro

Congratulations bro🎉🎉🎉

kl rashtrapati bhavan aa jana prize lene

@@modiji8706 😂😂😂😂😂😂

Ya similar doubt, I think the array should be sorted....

No it works for unsorted array as well

that's why u are here

this is not wrong the answer will be (6^4)&(~two). ones will change here but if you completely traverse whole array the ones will contain 6

Same vro😢

yes

it will give desired output after the complete traversal of array may be you done some error in your calculation #include using namespace std; int main() { vector arr={1,2,3,2,3,2,3}; int ones=0,twos=0; int n=arr.size(); for(int i=0;i

not update yest..

bro i am also searching for it 🤣🤣

i think we add the number and also delete it if it is duplicate thats why only unique element will remain in ones

as elements are not in even number if we xor 1 1 1 2 then 1^2 will be left at the end

@@artifice_abhi ok ok got it... thank you for the explanation

no, the way in the video is correct. we want to count the number of 1's in each bit position. so we need to iterate through each bit position first, and then each number from the array to count how many 1's there are. hopefully that makes sense

loop will not go ahead after finding 2....2 will be returned

no it only return ans==2 for every index we are checking we will use if(arr[i] != arr[i-1]) return arr[n-1]; it will return n-1 index value

it will give desired output after the complete traversal of array may be you done some error in your calculation. #include using namespace std; int main() { vector arr={1,2,3,2,3,2,3}; int ones=0,twos=0; int n=arr.size(); for(int i=0;i

suggestion for you:: you can also try to get answer from chatgpt . most of the time it will find error in your code . It will save your lot of time.

😂😂 ha bhai sach m kabhi kabhi samjh m aana band ho jata h ,,bhai ki english to nxt lvl hai

U need to take all elements thrice except one element. If u change 6 to 4.. you'll get the correct output.