Kivi Capital Quant Researcher Interview Experience Round 1
Interview Experience
I recently interviewed with
Kivi Capital for the
Quant Researcher role. The first round lasted around 60 minutes and consisted of **one algorithmic problem followed by several conceptual c
Full Details
I recently interviewed with
Kivi Capital for the
Quant Researcher role. The first round lasted around 60 minutes and consisted of one algorithmic problem followed by several conceptual computer science questions. --- ## Question 1 – Shipment Delivery Optimization You need to deliver
N shipments. For each shipment, you may hire either
Vendor X or
Vendor Y. * Vendor X delivery times: X = [x₁, x₂, …, xₙ] * Vendor Y delivery times: Y = [y₁, y₂, …, yₙ]
Constraints: *
Vendor X processes shipments sequentially → total time = sum of delivery times assigned to X *
Vendor Y processes shipments in parallel → total time = maximum delivery time among shipments assigned to Y Goal: Minimize the total completion time for delivering all shipments. Let: * Shipments assigned to X → indices (i₁, i₂, …) * Shipments assigned to Y → indices (j₁, j₂, …) Then: * Time taken by X = sum(x[i₁], x[i₂], …) = t₁ * Time taken by Y = max(y[j₁], y[j₂], …) = t₂ Total completion time: max(t₁, t₂) ---
Approach 1. If xᵢ > yᵢ, assigning that shipment to
Vendor Y is always beneficial since Y completes it faster. 2. For cases where xᵢ < yᵢ, the choice is non-trivial because: * Assigning to X increases the sequential sum * Assigning to Y increases the maximum parallel time 3. For such shipments, create pairs (yᵢ, xᵢ) and sort them by yᵢ. 4. Consider partition points in this sorted list: * Shipments up to index k are assigned to Vendor Y * Remaining shipments are assigned to Vendor X 5. Compute: * Vendor Y time = yₖ * Vendor X time = suffix sum of x-values after k 6. Track the minimum value of: max(yₖ, suffix_sum_x)
Time complexity:
O(N log N) due to sorting. --- ## Conceptual / CS Questions Asked After the algorithmic question, the interviewer asked several conceptual questions: * Difference between
Multithreading and Multiprocessing * What is a
Semaphore? * What is a
Mutex Lock? * Difference between
Semaphore and Mutex * Why do we need
Multithreading if we have Async/Await? (use cases) * Difference between
Virtual Memory and Physical Memory * What is a
Page Table?
Topics
About Kivi Capital Interview Reports
This question was reported by a candidate who interviewed at Kivi Capital. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Kivi Capital are the higher-signal extractions to take from this report.
For broader preparation context, the Kivi Capital interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Kivi Capital reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Kivi Capital Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Kivi Capital reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.