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

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain the question triplet with bit-wise and equal to zero using bit manipulation in data structure in Java. In this problem, we define triplets and state the problem where we are required to find the number of triplets.

#bitmanipulation #bitmasking

Рекомендации по теме
Комментарии
Автор

even if its not optimal its very understandable approach

arjunjadhav
Автор

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

harshitsharma
Автор

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

jonusbrothers
Автор

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

sushilkrsoni
Автор

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

trevorPhillips
Автор

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

ShubhamKumar-rtnb