Samsung R&d

# Samsung R&D Research Intern – IIT Patna (On-Campus) Technical round. This one went deep on the candidate's own project and ended with a tricky search problem. ## Round 1 – Technical Introduce yourself. Deep dive on the project mentioned in the intro. The interviewer asked for diagrams of the system: which modules are used, where data is stored, and how the pieces connect. Write a SQL query to insert data into a table. What is context switching? Describe in full detail what actually changes, i.e. what state gets saved and restored. **Two-Strike Array Search.** You're given a hidden sorted boolean array of length N: a run of 0s followed by a run of 1s, e.g. `[0, 0, 0, 0, 1, 1, 1]`. Find the index k of the first 1. You can only read the array through `get(index)`: You get at most 150 calls in total. Reading a 0 costs nothing. Reading a 1 counts as a strike, and you're allowed only two strikes. A third 1 breaks the API and you fail. This is the classic two-egg drop problem in disguise: a strike is a broken egg. With q queries and 2 strikes you can cover q(q+1)/2 positions. Probe at q, then at q + (q-1), then at q + (q-1) + (q-2), and so on. After the first strike, scan linearly upward from the last 0 you saw.