Derived from 1 submission for ALL. Format details may vary across different teams or locations.
Kivi Capital visited a tier-1 college for a quant developer role. Out of 250 candidates, 18 were shortlisted for the OA, and 5 were selected for interviews. The candidate reached the final round but was not selected. The process included an OA, DSA and puzzle rounds, and a subjects and puzzle round.
OA was conducted in college labs. The questions asked were: 1. You are given three arrays A, B, C (each of length <= 10^5) of varying length. You need to find the minimum value of (Ai - Bj)^2 + (Bj - Ck)^2 + (Ai - Ck)^2. 2. You are given two integers N, K. You need to find the number of ways to build a sequence of N-2 numbers such that no two adjacent elements are the same. The first number is 1 and the last is K of the sequence. (1<=N<=10^5) 3. You are given an array A of n numbers and q queries. For each query, you need to find if you can create the query number from the bitwise OR of any subsequence of the array A. (1<=n<=10^5, 1<=q<=10^5)
Initial online assessment conducted in college labs. Out of 250 candidates, 18 were shortlisted based on resume and OA performance.
First interview round focused on Data Structures and Algorithms (DSA) and puzzles. Three questions were asked, covering prime number transformations, step combinations to return to the origin, and a probability puzzle involving socks. Three candidates were selected for the next round.
You need to convert one prime number to another prime number. Given the condition that you can change one digit of the number to another in one step and the new number formed should also be a prime number.
You are given a number n. Initially, you are at the 0 index. You need to find the number of combinations of steps such that you remain at the index 0 only. In one step, you can move one step left, one step right, or stay in place. You can move outside n and 0.
There is a drawer with red and blue socks. You take two socks out, and the probability that both are red is 1/2. Find the minimum number of socks that should be present in the drawer to satisfy this probability. (Answer: 4 socks, 3 red and 1 blue)
Second interview round focused on subjects like thread parallelism, concurrency, and puzzles. The round included questions on code output prediction, deadlock avoidance, and a puzzle about maximizing cake slices with K cuts. Two candidates were selected after this round.
The interviewers asked about thread parallelism and concurrency problems. They showed a code snippet and asked about its output and how to make it concurrent.
Consider a system with 3 processes sharing 4 instances of the same resource type. Each process can request a maximum of K instances. Resources can be requested and released only one at a time. What is the largest value of K that will always avoid deadlock? Also, generalize the formula for P processes and R resources.
You are given a cake. You need to make K cuts on the cake. The slices need not be equal in size. Find the maximum number of slices you can make after K cuts.
InterviewDigest