Delhivery
Delhivery

Java Full Stack Developer

Find Duplicate in Read-Only Array

Medium
TechnicalcodingCandidate Not Selected

The array cannot be modified. Size = N + 1, values range from 1 to N. Find any duplicate. Time Complexity: O(N), Space Complexity: O(1). Example: Input: {10,1,2,3,5,4,9,8,5,6,4} → Output: 5

This question was asked in

Delhivery Java Full Stack Developer Interview Experience

The interview process at Delhivery consisted of two rounds focused on technical skills and low-level design. Candidates faced a variety of questions ranging from architecture choices to coding challenges and database design concepts. The overall difficulty was medium, with a blend of theoretical and practical questions that tested both knowledge and application skills.

AI Powered

Share Your Story

Share your interview in your own words — our AI handles the rest. Hardly takes 2 minutes.

Mock Interviews & 1:1 Guidance

Practice mock interviews or book a 1:1 call for career guidance, resume reviews, and more.

AI Interview Prep

AI interview prep powered by real interview data.

Show Your Love!

Connect with us on social media