2917. Find the K-or of an Array

LeetCodeArrayBit ManipulationOpen on judge ↗

You are given an integer array nums, and an integer k. Let's introduce K-or operation by extending the standard bitwise OR. In K-or, a bit position in the result is set to 1 if at least k numbers in nums have a 1 in that position. Return the K-or of nums. Example 1: Input: nums = [7,12,9,8,9,15], k = 4 Output: 9 Explanation: Represent numbers in binary: Number Bit 3 Bit 2 Bit 1 Bit 0

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI