String Decoding and Contiguous Subarrays Divisible by K
Filed under National Instruments
The question
Find the k-th character in a decoded string given a compressed repetition format, and count the number of contiguous subarrays whose sum is divisible by k.
No write-up yet. Related questions below have one.
Related National Instruments questions
Collected from public candidate posts and coding forums. Updated Nov 2026.