Triplets - 1 | Find Number of Triplets | Bit Manipulation Interview Questions

[@arjunjadhav6275]

even if its not optimal its very understandable approach

[@partharora5309]

Sir eska 0(n) approach bhi h

[@notcountdankula]

Yes. But that takes o(n) space complexity also

[@riteshseth9300]

Awesome explanation

[@Pepcoding]

Thankyou beta, keep learning

[@rohitshinde8478]

Thank you sir

[@Pepcoding]

I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms ) Keep learning and keep loving Pepcoding😊

[@PrashantKumar-gg5qd]

gajab question

[@jonusbrothers2067]

Hello Sir! I am in 4th year, As good and average companies have started their OFF-CAMPUS hiring, But i am not prepared.(Don't know algorithms, have basic knowledge about Data structures). Will be difficult for me to crack company's first coding round also.... I will give my best in September, and will cover most of the foundation. --MY QUESTION-- 1.Should i wait this september and prepare myself, and start applying in companies in october? 2.Should i apply now, because only god knows, when will again companies post their job openings later in this year...? **KEEPING IN MIND, THAT MANY COMPANIES HAVE CRITERIA THAT..YOU CAN'T REAPPLY IN 6MONTHS/YEAR. Thanks

[@Pepcoding]

No no !! Keep practicing and also start applying side by side

[@harshitsharma5647]

Sir can we complete in better approach like in O(n). If any approach please tell me

[@sushilkrsoni2796]

Can someone please give that brute force n^3 solution (code) ?

[@trevorPhillips284]

Sir ye property yaad rakhni h ya iska koi logic h?

[@nishthagoyal5018]

nice

[@ShubhamKumar-rt8nb]

sir i think this problem can be done in O(n) time

[@jaigupta2001]

how?

[@jobanpreetsingh2370]

How??? Please tell 😭😭

[@kartik4063]

using hashmap, prefix sum array