Katkat
Back

Solve Reported OA Coding Problems

UpstartSoftware Engineer · Online Assessment
MediumSoftware EngineerOnline AssessmentCoding & Algorithms

Last updated

This prompt evaluates algorithmic problem-solving skills across grid-based ordering constraints, array pair-sum identification, and minimum-difference computation, testing knowledge of data structures, time/space complexity, and correctness conditions.

The post describes several algorithm questions from an online assessment. The concrete problems that can be reconstructed are:

  1. Remove Blocks in a Grid You are given an m x n grid of 0s and 1s, where 1 means a block exists. A block at position (r, c) can be removed only if there is no remaining block in the same row at any column k > c. Remove blocks one at a time until all blocks are gone, and return any valid removal order as a list of coordinates. If multiple answers exist, return any one of them.

  2. Find Two Indices for a Target Sum You are given an integer array nums and an integer target. Return two distinct indices i and j such that nums[i] + nums[j] = target. If multiple answers exist, return any valid pair. Aim for linear time.

  3. Compute the Minimum Gap You are given an integer array nums. Return the minimum absolute difference between any two distinct elements in the array.