CodingReported in a candidate post, Mar 2021
Minimum array sum after k half operations, block grid path, and KLA keyboard
Filed under KLA
The question
First, given an array and k operations where each operation replaces a number with half of it, return the minimum possible array sum after k operations. Second, find if a valid path exists in a 2D array containing blocks that break if reached twice. Third, given 3 keys (Ctrl-A, Ctrl-C, Ctrl-V) and N steps, return the maximum number of 'KLA' words that can be formed.
No write-up yet. Related questions below have one.
Related KLA questions
Collected from public candidate posts and coding forums. Updated Nov 2026.