Interview Experience
Problem Overview Find all distinct goodness values for this problem, where goodness is the bitwise-OR of any strictly increasing subsequence, and return them sorted. Input: int arr[n]; Output:
Full Details
🔒
Unlock all Citadel questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a candidate experience report from a citadel interview for a swe role during the coding round.
It covers the following topics: Bit Manipulation .
Difficulty rating: 0