CodeSignal OA Bank Interview Questions
Curated from verified interview reports: a large generic CodeSignal online-assessment question bank spanning system design (banking, in-memory DB, file storage, employee management), graph/tree algorithms, and array/string optimization.
20 real interview questions reported from CodeSignal OA Bank Software Engineer interviews (OA round): 10 medium, 10 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.
CodeSignal OA Bank OA round questions (20)
- OA[CodeSignal] Cloud File Storage System - Hard, free preview
Build an in-memory cloud-storage service with file lookup, search, users, and capacity limits. - OA [CodeSignal] Count Palindrome Paths in Tree - Hard, free preview
Count node pairs whose path characters have at most one odd frequency. - OA[CodeSignal] Design Banking System - Hard
Process banking-system operations including activity ranking and account merges. - [CodeSignal] Drone Hub Travel - Medium
Visit requested hubs on a circular Amazon drone ring where each move costs the time to leave the current hub, not a plain edge weight. - OA[CodeSignal] Employee Management System - Hard
Track work sessions, pending promotions, role leaderboards, and salary earned across completed sessions. - OA [CodeSignal] Final Prices After Discount - Medium
Reduce every price by the nearest later price that does not exceed it. - [CodeSignal] House Segments After Destruction - Hard
After each destroyed house, report how many contiguous house segments remain on the street. - OA[CodeSignal] In-Memory Database - Hard
Implement a versioned in-memory database with filtering, TTL, backup, restore, and point-in-time queries. - OA [CodeSignal] Longest Subsequence With Limited Sum - Medium
Sort the numbers once and answer each query with a prefix-sum upper bound. - [CodeSignal] Matrix Command Engine - Medium
Apply row reversals, row swaps, and clockwise rotations to a matrix, remembering that a rotation changes which row indices future commands refer to. - OA [CodeSignal] Maximum Protected City Population - Medium
Shift guards one city to the left at most once each, in whatever order helps, so the guarded population is as large as possible. - [CodeSignal] Maximum Secure Deliveries - Medium
Split delivery logs across exactly k warehouses so the bottom half remains as large as possible after the largest k/2 warehouses are compromised. - OA [CodeSignal] Minimum Edge Reversal Root - Hard
Choose the tree root that minimizes how many directed edges must be reversed to point outward. - OA [CodeSignal] Minimum Operation To Reduce n To 0 - Medium
Reach zero in the fewest moves by adding or subtracting powers of two. - [CodeSignal] Minimum Security Groups - Medium
Group equal-security servers into batches whose sizes differ by at most one, using as few groups as possible. - [CodeSignal] Permutation Sorter - Hard
Sort a permutation using only whole-array reverse and one-step left rotation, taking the minimum number of operations. - OA [CodeSignal] Prime Jumps - Medium
Maximize the landing-score sum while jumping by 1 or by prime distances that end in digit 3. - OA [CodeSignal] Purchase Optimization - Hard
Answer each shopping query by taking the longest affordable prefix from a sorted suffix of cubicles. - OA [CodeSignal] Shortest Good Subarray - Medium
Find the length of the tightest window that holds k or more distinct integers. - [CodeSignal] Synchronized Pipeline Delays - Hard
Increase edge delays in a perfect binary tree until every root-to-leaf path has the same total delay.