Scale AI New Grad SWE OA: Server Segments and Bitwise OR

The OA had two coding problems.

The first was Count Stable Server Subsegments. You were given an array of server values and had to count contiguous segments with at least three servers where both endpoints were equal to the sum of everything between them.

The second was Distinct OR Values of Increasing Subsequences. You had to return every different bitwise-OR value that could be made from a strictly increasing subsequence. The answers had to be sorted, and zero from the empty subsequence was included. Each array value was below 1024.

They didn’t pass the OA.