GeeksforGeeks Question · Jul 2025 · Pune

Druva interview experience | Staff Software engineer -Development

Backend Recruiter Senior Easy

Question Details

Recently I got interviewed with Druva Pune. I'm having 2 years of software engineering experience with a FinTech. Round 1 :Recruiter contacted me on LinkedIn and shared a ...

Full Details

Recently I got interviewed with Druva Pune. I'm having 2 years of software engineering experience with a FinTech.

Round 1 Recruiter contacted me on LinkedIn and shared a Test link on Mettl. Format of the exam : (Total time : 75 minutes) Section A- 3 programming questions . Allowed Language (JAVA,Python,C++) , all the questions were of easy-medium level. Section B- 3 sections containing 5 MCQs in each . These sections included questions on C++, Networking & OS and Algorithms and Data Structures respectively.

Round 2 (1 Hour) This was taken by a Senior Software Engineer . Q1. https://www.geeksforgeeks.org/dsa/reverse-alternate-k-nodes-in-a-singly-linked-list/ I explained the approach and coded on a google Doc shared between me and interviewer. Q2. https://www.geeksforgeeks.org/dsa/search-an-element-in-a-sorted-and-pivoted-array/ I explained the process .Interviewer got satisfied with the approach but time ran out while coding.

Round 3 (1 Hour) This round was taken by Principal Engineer. 1. Questions on Denial of Service (DOS) attack and how to prevent it. Questions on sticky sessions. 2. Design a rate limiter which only allows n requests from a particular user. Several approaches were discussed based on IP and user identifier. 3. Design a system which only allows n number of requests to each backend server (in a time frame of K units) and distributes the request . I provided a linkedlist implementation of Queue. With this approach the total number of requests currently processed by a server in last k unit of time can be found out in O(1). (Similar to continuous sum approach in an array) 4. Questions on Sharding and Consistent Hashing- in case of dynamic addition of new servers. 5. https://www.geeksforgeeks.org/problems/rearrange-characters4649/1 O(n)

approach for the above was expected .For coding a google Doc was shared.

Round 4 (1 Hour) This round was taken by Director of Engineering. (Hiring Manager) 1. Describe a challenging project you have done in your current organisation. 2.

Problem statement: An Api is given which is paginated. (Response will not come at once instead you have to call the api with different page numbers in query parameter). You have got K number of threads available write a code which calls this api and returns the whole response. The code should use atmost k threads and the use of these threads should be optimum. Several race conditions were discussed in this and finally with the help of interviewer I was able to code it. 3. https://www.geeksforgeeks.org/dsa/find-number-of-days-between-two-given-dates/ 4. https://www.geeksforgeeks.org/dsa/merge-two-binary-trees-node-sum/ Discussion on interests and reason for change.

Round 5 (1/2 hour) This was more of cultural fit round taken by Director of Product. Discussion on any one project , what are the challenges faced . Discussion from CV. Expectation from Druva etc. The interview process took around a total of 2 weeks. Final verdict selected :) I would like to thank GeeksForGeeks for providing various interview experiences and questions for preparation .

Free preview — 6 questions shown. Unlock all Druva questions →

About This Question

This is a reported interview question from a druva interview for a backend role (senior level) during the recruiter round reported in 2025.

It covers the following topics: Linked List, Trees, Sql, Stack Queue, System Design, Queue, Arrays .

Difficulty rating: Easy

About Druva Interview Reports

This question was reported by a candidate who interviewed at Druva. 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 Druva are the higher-signal extractions to take from this report.

For broader preparation context, the Druva 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 Druva reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Druva 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 Druva 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.