SOTI interview questions

Tech / SWE · 9 questions · last reported Mar 2026
Report an interview →

Browse 9 SOTI interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time, internship roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Online assessment (OA), Onsite, Phone screen
Practice topics
coding (7), arrays (4), hashmap (2), math (2), sorting (2), binary (1), brain-teaser (1), data-structures (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what SOTI will ask. Locked question details require points. Public examples below are free to read.

Read 3 free SOTI interview question examples

Browse all SOTI questions

9 questions

Free SOTI interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Amplifier Array

Easy · Online assessment (OA) · Full-time

I had a 3-hour coding round with 3 questions. The first one they gave me was pretty straightforward. I got an array of amplifiers where each one multiplies the input signal by its value. Starting from signal strength 1, I needed to find the maximum number of adjacent amplifiers that would produce exactly some target value S. If there was no way to get S from any contiguous subarray, I had to return -1. I went with a sliding window approach since all the values were positive, meaning the product only grows as the window gets bigger, so two pointers worked perfectly. One of the examples was A = {1, 2, 3, 4, 6} with S = 12, which returns 2 because 3 * 4 = 12. Another was A = {2, 1, 3, 4, 6} with S = 12, returning 3 since 1 * 3 * 4 = 12.

Binary Message

Medium · Online assessment (OA) · Full-time

This was the second question in the same 3-hour coding round and it was a medium. They gave me a binary string S and an array of 5-bit binary codes, where each code maps to a lowercase letter. I had to decode the binary string into the lexicographically smallest possible alphabetic string. So basically I needed to figure out how to split the binary string using the available codes so the result comes out as small as possible alphabetically. One of the test cases was S = "0000100101" with codes like "00000", "00001", "00010", "00011", and the answer was "bd". The hard part was when multiple valid decodings existed and I had to make sure I was always picking the smallest one. I ended up going with a greedy approach where I tried to match the smallest available code at each position in the string.

Rectangle Stack

Hard · Online assessment (OA) · Full-time

This was the hard problem in the same 3-hour round and it definitely took me the longest. I got a list of rectangles with width and height, and I needed to stack them to maximize the total height. The catch was that each rectangle on top had to have both width and height less than or equal to the one below it. I sorted them first and then used a DP approach similar to longest increasing subsequence. One example was rectangles like [(1, 2), (2, 3), (3, 4), (4, 5)] where the answer was 4 since they all fit on top of each other. The tricky edge cases were when rectangles had equal dimensions and making sure I was checking both width and height constraints at the same time, not just one.