1. Druva Exam Pattern & Selection Rounds (2026)
The 2026 Druva Data Solutions selection pipeline eliminates ~75% of candidates in Round 1 on HackerRank. Review the exact round-by-round timing and difficulty matrix below:
| Selection Stage / Section | Questions / Format | Duration | Difficulty Level |
|---|---|---|---|
| Online Coding & OS/AWS MCQs | 2 Coding + 20 MCQs | 90 Mins | Medium–Hard |
| Technical Round 1 (Go/Python/C++ DSA) | Live Coding | 60 Mins | Hard |
| Technical Round 2 (AWS Cloud & Systems) | Design | 60 Mins | Hard |
| Managerial & HR | Behavioral | 30 Mins | Easy |
2. High-Weightage Syllabus & Eligibility Criteria
Minimum Eligibility Cutoff: 7.0 CGPA in CS/IT. Hiring locations include Pune, Bangalore.
- Priority Area 1: AWS S3, DynamoDB, Lambda & Cloud Backup Architecture
- Priority Area 2: Go / Python / C++ Concurrency & File Systems
- Priority Area 3: DSA Trees, Graphs & Bitwise Deduplication
- Priority Area 4: OS Threads, Locks & Network Protocols
3. Frequently Asked Druva Coding & Technical Questions (With Solutions)
Q1. Shortest Path in Weighted Graph (Dijkstra's Algorithm with Min-Heap)
Compute shortest path distances from source node src to all vertices in a non-negative weighted graph using a priority queue in O((V + E) log V).
import heapq
def dijkstra(n, edges, src):
graph = [[] for _ in range(n)]
for u, v, w in edges:
graph[u].append((v, w))
dist = [float('inf')] * n
dist[src] = 0
pq = [(0, src)]
while pq:
d, u = heapq.heappop(pq)
if d > dist[u]:
continue
for v, w in graph[u]:
if d + w < dist[v]:
dist[v] = d + w
heapq.heappush(pq, (dist[v], v))
return dist
Q2. Thread-Safe Rate Limiter (Token Bucket in Python)
Implement a thread-safe Token Bucket rate limiter preventing concurrent race conditions in multi-threaded backend services.
import time, threading
class TokenBucket:
def __init__(self, capacity: int, refill_rate: float):
self.capacity = capacity
self.tokens = float(capacity)
self.rate = refill_rate
self.last_ts = time.monotonic()
self.lock = threading.Lock()
def allow_request(self) -> bool:
with self.lock:
now = time.monotonic()
self.tokens = min(self.capacity, self.tokens + (now - self.last_ts) * self.rate)
self.last_ts = now
if self.tokens >= 1.0:
self.tokens -= 1.0
return True
return False
Q3. Detect Cycle in a Directed Graph (Kahn's Topological Sort)
Check whether a task dependency graph (microservices/build targets) contains a circular dependency deadlock in O(V + E).
from collections import deque
def has_cycle(num_nodes, edges):
adj = [[] for _ in range(num_nodes)]
indeg = [0] * num_nodes
for u, v in edges:
adj[u].append(v)
indeg[v] += 1
q = deque([i for i in range(num_nodes) if indeg[i] == 0])
visited = 0
while q:
node = q.popleft()
visited += 1
for nxt in adj[node]:
indeg[nxt] -= 1
if indeg[nxt] == 0:
q.append(nxt)
return visited != num_nodes
4. Frequently Asked Questions — Druva Recruitment 2026
What is the Druva placement test pattern in 2026?
The 2026 Druva Data Solutions recruitment drive consists of 4 stages starting on HackerRank (90 Mins), followed by technical DSA/system interviews and HR fitment.
What salary package does Druva offer freshers in India?
Selected freshers and entry-level engineers earn ₹14.0 – ₹26.0 LPA across Pune, Bangalore.
How can 4Achievers help me crack the Druva interview?
4Achievers runs intensive DSA, Full Stack, Data Analytics, and Cloud interview bootcamps with live mentor sessions, 1-on-1 mock panels, and dedicated placement support across 15 Physical Training Centers and live online batches.