interviewquestions.

Big tech

Amazon4 rounds · $110.5k-$160kApple4 rounds · $145kGoogle6 rounds · $118k-$170kMeta6 rounds · $137kMicrosoft5 rounds · $84.2k-$165.2k

US and global tech

Netflix6 rounds · $100k-$300kUber5 rounds · $150k-$158kAirbnb6 rounds · $128k-$142kStripe7 rounds · $122.1k-$134.4kSalesforce3 rounds · $110k-$153kAdobe3 rounds · $76.7k-$152.2kLinkedIn6 rounds · $154kIntuit4 rounds · $55.5-$75/hrCisco4 rounds · $92.1k-$136kAtlassian3 rounds · $122.4k-$159.8kSpotify6 rounds · $125.6k-$179.4kTwitter4 rounds · $127k-$297kOpenAI5 rounds · $230k-$490kPalantir5 rounds · $145k-$155kTesla5 rounds · $140k-$300kTikTok5 rounds · $128k-$256kDatabricks6 rounds · $137.8k-$155kSnowflake5 rounds · $42-$60/hrDatadog6 rounds · $100k-$110kCloudflare6 rounds · $150k-$216kCoinbase6 rounds · $60/hrDoorDash6 rounds · $107.4k-$158kRoblox6 rounds · $153kEpic Systems5 rounds · $110kShopify5 rounds · $110kRobinhood6 rounds · $166k-$195k

Wall Street, banks and payments

Goldman Sachs4 rounds · $110k-$115kJP Morgan4 rounds · $95k-$125kMorgan Stanley3 rounds · $70k-$110kBank of America4 rounds · $94.2kCiti5 rounds · $80k-$115kWells Fargo5 rounds · $48.08/hrCapital One5 rounds · $140kBlackRock4 rounds · $105k-$125kBloomberg5 rounds · $158kD. E. Shaw4 rounds · $25kAmerican Express3 rounds · $78k-$124.8kMastercard2 rounds · $72k-$115kVisa4 rounds · $108k-$120kPayPal4 rounds · $116.5k-$173.3kDeutsche Bank4 rounds · $100kBarclays3 rounds · $110kHSBC5 rounds · ₹6-10 LPAArcesium4 rounds · $10kCitadel5 rounds · $200k-$250kJane Street4 rounds · $300kHudson River Trading5 rounds · $300kSusquehanna (SIG)5 rounds · $300kFidelity Investments4 rounds · $92kPNC5 rounds · $39.1k-$126.5kCharles Schwab4 rounds · $26.01/hrEdward Jones5 roundsVanguard4 rounds · $52k-$55kU.S. Bank5 rounds · $20-$22/hr

Consulting and Big 4

McKinsey4 rounds · $120kBCG4 rounds · $110kBain4 rounds · $120kDeloitte3 rounds · $75k-$78kEY3 rounds · $75k-$100kKPMG3 rounds · $78k-$90kPwC3 rounds · $61k-$100kAccenture5 rounds · ₹4.5-6.5 LPAIBM3 rounds · $121k-$181.4kZS Associates5 rounds · $90k-$102k

Enterprise and cloud

Oracle3 rounds · $61.2k-$141.2kServiceNow4 rounds · $130k-$136kDell3 rounds · $101.7k-$131.7kVMware5 rounds · ₹18-30 LPASAP5 rounds · ₹18-28 LPAAkamai5 rounds · $114.3k-$136.3kADP4 rounds · ₹6-11 LPAOptum4 rounds · $58.8k-$105k

Semiconductors and hardware

NVIDIA3 rounds · $100k-$166.75kIntel3 rounds · $105.7k-$149.2kQualcomm3 rounds · $122.8k-$184.2kTexas Instruments3 rounds · $100k-$137.5kCadence3 rounds · $74.2k-$137.8kSynopsys5 rounds · $92.6kMathWorks4 rounds · $100k-$130kSamsung3 rounds · ₹14-28 LPAAMD5 rounds · $119k-$170k

Retail and industrial

Walmart4 rounds · $80k-$155kTarget4 rounds · $34/hrHoneywell4 rounds · $68k-$115kSiemens4 rounds · $32.69-$58.84/hrBosch3 rounds · ₹6-9 LPAABB5 rounds · $80kCaterpillar7 rounds · $89.2k-$145kSchneider Electric4 rounds · $84k

Aerospace and defense

Boeing6 rounds · $82k-$89kLockheed Martin5 rounds · $91kNorthrop Grumman4 rounds · $62.3k-$114.4kRaytheon4 rounds · $68.9k-$144.2kSpaceX5 rounds · $125k-$145kBooz Allen Hamilton6 rounds · $52.9k-$108kLeidos5 rounds · $57.9k-$125.7kGeneral Dynamics6 rounds · $19.55-$34.5/hrAnduril Industries4 rounds · $112k-$149k

Telecom, media and consumer brands

Verizon5 rounds · $16-$21/hrT-Mobile5 rounds · $19.5/hrAT&T5 rounds · $21.43-$24.95/hrComcast6 rounds · $19/hrDisney5 roundsProcter & Gamble5 rounds · $85k-$122.2kPepsiCo5 rounds · $21.07-$25.8/hrThe Coca-Cola Company (and bottlers)5 rounds · $19.75-$27/hrNike5 rounds · $17/hr

Insurance, healthcare and pharma

State Farm6 rounds · $63.1k-$71.7kGEICO7 rounds · $20.65-$25.81/hrProgressive6 rounds · $54k-$63.5kUSAA6 rounds · $43.8k-$45.8kHumana5 rounds · $71.1k-$97.8kKaiser Permanente5 rounds · $38.15-$40.14/hrHCA Healthcare4 rounds · $19.29-$24.81/hrJohnson & Johnson5 rounds · $23.5-$52.5/hrPfizer4 rounds · $76k-$199.6k

Stores, grocery and pharmacies

Costco5 rounds · $20-$32.9/hrKroger4 rounds · $17-$26.85/hrPublix4 roundsTrader Joe's4 rounds · $16-$20/hrWhole Foods Market5 rounds · $17-$25.4/hrALDI (US)5 rounds · $18-$18.5/hrH-E-B6 roundsDollar General5 rounds · $18.31-$18.56/hrHome Depot5 rounds · $18.5-$21.5/hrLowe's5 rounds · $15.92-$16.15/hrCVS Health6 rounds · $16.5-$25/hrWalgreens5 rounds · $19.5-$23/hrBest Buy4 rounds · $16.9-$21.45/hrTJX (TJ Maxx, Marshalls, HomeGoods)5 rounds · $12.75-$13.25/hrMacy's5 rounds · $15-$19.51/hrKohl's4 rounds · $15/hrNordstrom4 rounds · $17.7-$21.9/hrSephora5 rounds · $22.6-$26/hrUlta Beauty5 rounds · $16.9-$24/hrDick's Sporting Goods5 rounds · $12.5-$31.5/hrPetSmart5 rounds · $15.08-$22.08/hrlululemon4 rounds

Restaurants and coffee

Starbucks4 rounds · $15.25-$24.69/hrChick-fil-A5 rounds · $15-$18/hrChipotle4 rounds · $20-$21/hrMcDonald's4 rounds · $15.5-$19.89/hrTaco Bell4 rounds · $14.42-$22.04/hrWendy's4 rounds · $11.5-$22.29/hrBurger King4 rounds · $12-$19.5/hrDunkin'3 rounds · $15-$20/hrPanera Bread4 rounds · $15-$20/hrDomino's4 rounds · $9/hr

Airlines, hotels and delivery

American Airlines5 rounds · $37.91/hrUnited Airlines5 rounds · $37.1/hrSouthwest Airlines5 rounds · $32.62/hrDelta Air Lines5 roundsMarriott International4 rounds · $16-$22/hrHilton4 rounds · $21/hrEnterprise Mobility (Enterprise Rent-A-Car)5 rounds · $62.7kFedEx4 rounds · $17.75-$18.25/hrUPS5 rounds · $21/hrUSPS (United States Postal Service)6 rounds

India: product companies and startups

Flipkart5 rounds · ₹22-28 LPAPaytm4 rounds · ₹16-22 LPASwiggy4 rounds · ₹16-22 LPAZoho6 rounds · ₹5-7 LPAZomato4 rounds · ₹18-25 LPAMeesho4 rounds · ₹25-35 LPANykaa4 rounds · ₹10-18 LPAOLA4 rounds · ₹16-22 LPACRED5 rounds · ₹18-25 LPAGroww5 rounds · ₹15-28 LPAPhonePe5 rounds · ₹18-25 LPARazorpay4 rounds · ₹18-25 LPAZerodha4 rounds · ₹12-25 LPADream114 rounds · ₹15-30 LPABrowserStack5 rounds · ₹15-28 LPAFreshworks4 rounds · ₹20-28 LPABlinkit5 rounds · ₹18-25 LPADunzo5 rounds · ₹12-18 LPALicious4 rounds · ₹12-18 LPAUrban Company4 rounds · ₹18-25 LPABigBasket4 rounds · ₹6-10 LPABYJU'S4 rounds · ₹4-8 LPADelhivery4 rounds · ₹10-20 LPAUnacademy5 rounds · ₹12-18 LPAJuspay5 roundsLenskart5 rounds

India: IT services and analytics

TCS4 rounds · ₹3.4-3.6 LPAInfosys3 rounds · ₹3.6-4.5 LPAWipro3 rounds · ₹4-4.5 LPAHCL3 rounds · ₹4-4.5 LPATech Mahindra6 rounds · ₹3.5-4.5 LPACognizant4 rounds · ₹4-4.5 LPACapgemini4 roundsThoughtworks4 rounds · ₹10-18 LPAAmdocs4 rounds · ₹5-7 LPACGI5 rounds · ₹4.5-7 LPACoforge4 rounds · ₹4.5-7 LPADXC Technology4 rounds · ₹4-4.5 LPAEPAM6 rounds · ₹8-14 LPAGenpact4 rounds · ₹3-4.5 LPAGlobalLogic4 rounds · ₹5-9 LPAGlobant3 rounds · ₹7-12 LPAHexaware6 rounds · ₹4 LPALTTS3 rounds · ₹4-4.5 LPAMindtree3 rounds · ₹4.0-4.5 LPAmPhasis5 rounds · ₹4-5 LPANagarro4 rounds · ₹6-10 LPANTT Data4 rounds · ₹4-5.5 LPAPersistent Systems4 rounds · ₹5-8 LPAPublicis Sapient3 rounds · ₹8-12 LPAVirtusa4 rounds · ₹4-5.5 LPAZensar4 rounds · ₹4-6.5 LPABirlasoft4 rounds · ₹4-6.5 LPAEXL6 rounds · ₹5-9 LPAFractal Analytics5 rounds · ₹8-14 LPAMuSigma6 rounds · ₹6-9 LPATiger Analytics4 rounds · ₹8-14 LPAWNS6 rounds · ₹5.6 LeClerx6 rounds · ₹2.8-3.1 L

India: banks, conglomerates and PSUs

SBI6 rounds · ₹21.97 LHDFC Bank4 rounds · ₹4-6 LPAICICI Bank4 rounds · ₹6-8 LPAAxis Bank3 rounds · ₹5-10 LPABank of Baroda4 rounds · ₹4-8 LPACanara Bank5 rounds · ₹4-8 LPABajaj Finserv4 rounds · ₹8-12 LPAAirtel5 rounds · ₹6-12 LPAJio5 rounds · ₹6-14 LPAL&T4 rounds · ₹8-15 LPAReliance3 rounds · ₹7.5 LPAAdani4 rounds · ₹8-15 LPABHEL4 rounds · ₹6-10 LPAMahindra3 rounds · ₹8-14 LPAMaruti Suzuki4 rounds · ₹7-12 LPATata Motors4 rounds · ₹7-13 LPAISRO3 rounds · ₹8-12 LPADRDO6 rounds · ₹8-12 LPABARC3 rounds · ₹74,000/moBEL5 rounds · ₹10-14 LPANTPC4 rounds · ₹7.2-12 LPABPCL4 rounds · ₹12-16 LPAHPCL5 rounds · ₹17.7-18.1 LIOCL5 rounds · ₹12-17 LPAONGC4 rounds · ₹20-26 LPAcdac4 rounds · ₹6-12 LPA

Delhivery

India · product companies and startups · Gurugram, India · Updated Oct 31, 2026

Delhivery interview process for campus and referral SDE-1 hires

Delhivery’s loop is short (often under a week) but technically dense - a long, multi-problem DSA marathon followed by a design-and-behavioral round that leans on Delhivery’s own logistics-scale problems rather than generic prompts.

Delhivery interview process

  1. Online Assessment (HackerEarth)60-90 min
  2. Technical Interview 160-120+ min
  3. Technical Interview 245-60 min
  4. HR Discussion20-30 min
Round Duration What it tests
Online Assessment (HackerEarth) 60-90 min CS fundamentals MCQs + 3 medium coding problems
Technical Interview 1 60-120+ min Long DSA session (multiple problems) + project deep-dive
Technical Interview 2 45-60 min Low-level design, SQL, behavioral, sometimes a puzzle
HR Discussion 20-30 min Fit, offer discussion

Delhivery interview questions with answers

Q: How do you design a stack that returns the minimum in O(1)?

Keep a second “min stack” alongside the main stack. On every push, also push the smaller of the new value and the current min-stack top onto the min stack; on every pop, pop both stacks. Then top() reads the main stack’s top and getMin() reads the min stack’s top, so all four operations are O(1) time at the cost of O(n) extra space. The space-optimized variant stores only the encoded value 2*x - min when a new minimum arrives, letting you recover the previous minimum on pop without a second stack.

Q: How do you find all pairs in an array that sum to a target?

Iterate once with a hash map of values already seen. For each element x, check whether target - x is present; if so you have a pair, then insert x. This runs in O(n) time and O(n) space and handles negatives and unsorted input. If the array is already sorted and you must use O(1) extra space, use two pointers from both ends, moving the left pointer right when the sum is too small and the right pointer left when it is too large. Use a count map instead of a set when duplicates must be counted.

Q: Write a SQL query to find the Nth highest salary in a table.

The portable approach uses a window function: SELECT DISTINCT salary FROM (SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) AS rnk FROM employees) t WHERE rnk = N; DENSE_RANK is the right choice because it gives tied salaries the same rank, so the “second highest” stays correct when two people earn the same amount. A simpler MySQL form is SELECT DISTINCT salary FROM employees ORDER BY salary DESC LIMIT 1 OFFSET N-1; Mention that the query returns nothing when fewer than N distinct salaries exist - interviewers often probe that edge case.

Q: How would you design a database for warehouses and shipment tracking?

Core entities are Warehouse/Hub (id, geo coordinates, capacity), Shipment (AWB number, origin, destination, current status, SLA date), ShipmentEvent (shipment_id, hub_id, event_type, timestamp), and Vehicle/Trip linking hubs. The key insight is that ShipmentEvent is an append-only, write-heavy fact table - you never update the shipment row in place for every scan; you insert an event and keep a denormalized current_status column for fast reads. Partition events by date and shard by a hash of the shipment id, index on (shipment_id, timestamp) for the tracking page, and move older partitions to cold storage. That write-heavy, geographically distributed framing is exactly what Delhivery’s interviewers look for.

Q: Explain the CAP theorem with a distributed database example.

CAP says a distributed system facing a network partition must choose between consistency (every read sees the latest write) and availability (every request gets a non-error response); partition tolerance is not optional on real networks. A CP store like HBase or ZooKeeper refuses reads or writes on the minority side of a partition rather than serve stale data. An AP store like Cassandra or DynamoDB keeps accepting writes on both sides and reconciles later using last-write-wins or vector clocks. For hub scan events you usually pick AP so a hub can keep scanning during a network blip, but for a payment or COD ledger you pick CP.

Q: How would you design a URL shortening service?

Store a mapping table with short_code as primary key plus long_url, created_at, expiry, and owner_id. Generate codes either by base62-encoding an auto-increment or Snowflake-style id, which guarantees uniqueness without collision checks, or by hashing the URL and taking the first seven characters with a retry on collision. Seven base62 characters give roughly 3.5 trillion codes, which is ample. Redirects are heavily read-dominated, so front the datastore with a cache keyed on short_code, and return HTTP 301 for permanent links or 302 when you need every hit to reach your servers for click analytics.

Q: When would you use the Singleton, Factory, and Builder patterns?

Singleton guarantees one instance with a global access point - suitable for a connection pool or config registry, though it hurts testability and needs double-checked locking with a volatile field to be thread-safe. Factory Method centralizes object creation behind an interface, so a caller asks for a CourierPartner without knowing whether it gets a third-party or in-house implementation; that is the natural fit when new subtypes appear often. Builder handles objects with many optional fields - a Shipment with optional COD amount, insurance, and fragile flags - giving readable chained construction and an immutable result instead of a telescoping constructor.

Q: How do you detect and remove a loop in a linked list?

Use Floyd’s cycle detection: advance a slow pointer one node and a fast pointer two nodes per step; if they ever meet, a cycle exists. To find the loop’s start, reset one pointer to the head and then move both one step at a time - they meet at the entry node. To remove the loop, walk to the node just before that entry and set its next pointer to null. The algorithm is O(n) time and O(1) space, which is why interviewers prefer it over the hash-set approach that costs O(n) memory.

Q: How do you print a matrix in spiral order?

Maintain four boundaries - top, bottom, left, right. Traverse top row left→right, right column top→bottom, bottom row right→left (if still valid), left column bottom→top (if still valid), then shrink the boundaries inward until they cross. Each element is visited once, so time is O(m×n) and extra space is O(1) besides output. Delhivery OA lists on GeeksforGeeks also cite array sorting (0/1/2 Dutch flag), merge sort, and LRU cache as recurring patterns - worth timed practice even if your loop skips OA.

Q: What backend topics show up beyond DSA in recent Delhivery loops?

Lateral and full-stack reports mention live SQL (joins, indexes), Kafka basics, Spring transaction boundaries, and LLD prompts such as a simplified sports-score or shipment-tracking module with schema design. Java full-stack candidates should expect framework theory (Spring/Hibernate) plus one LLD round, not only LeetCode mediums.

Delhivery interview questions by role

These topics come from GfG Delhivery interview experiences and GfG’s Delhivery recruitment process page.

Role Reported questions and topics
SDE (campus) Round 1 (1 hour): your internship, character frequency with hashing, unordered vs ordered map, an inner-join SQL query on two tables, post-order traversal of a BST, big data and Hadoop, what kind of language JavaScript is. Round 2 (30 minutes): when the clock hands overlap between 2 and 3, your best project, React and JSX with Babel and the virtual DOM, Hooks and Promises.
SDE-1 (referral / lateral) A 2+ hour Codepair round with five DSA problems (string, array with a hard DP follow-up, a well-known tree problem with a follow-up), then a same-day round with LLD, Amazon-style behavioral questions and a puzzle.
2025 Software Developer and backend intern Code360 entries from 2025: a walk-in Software Developer loop of 3 rounds with 4 coding problems, and a backend intern loop of 2 rounds with 6 coding problems. Specific problems are not public in the snippets.
Earlier campus SDE drives Minimum cost path (DP, then BFS), a postman delivering on a 4x4 grid in minimum time, overlapping rectangles, reversing letters in place while special characters stay put in O(n) time and O(1) space, and user-level vs kernel-level threads.

Asked across every role: tell me about yourself, your favorite subject, and a detailed walk through your best project.

Delhivery online assessment: quick answers

These answers are compiled from public candidate reports and prep guides, not from an official Delhivery notice, and drives differ.

Question Answer
How many questions and how long? A 2021 campus test ran 90 minutes on HackerEarth: 10 MCQs (4 marks each) on SQL, OS, DBMS, trees, linked lists, OOP, networks and system security, plus 3 coding problems - Max Subarray (50 marks), Cheapest Buy (20) and Finding Pairs (20). An older drive had 2 coding problems and 39 data-analysis MCQs, and a November 2019 campus test on Mettl ran 90 minutes with an English section (15 questions, 10 minutes) and an aptitude section (25 questions, 40 minutes).
Does it have negative marking? No public report mentions any.
Is there a sectional cutoff? Not reported. The weighting matters more: one coding problem was worth more than all 10 MCQs combined, so solve the heavy problem first.
How much is the cutoff? Not published, and the filter is steep: about 200 students sat the 2021 campus test and 6 advanced, and in a November 2023 campus drive 146 took the test and 12 reached interviews. No CGPA or backlog rule is published in GfG’s process guide or the campus reports.
Which platform is it on? HackerEarth in the 2021 campus test (a 2019 drive used Mettl); later live coding is on Codepair or Google Meet.
Which branches can apply? The 2021 campus SDE drive was open to CSE, ECE and EEE. GfG’s process guide lists B.E., B.Tech or M.Sc. in computer science or a related field.
Is there always an OA? No. A referral SDE-1 candidate had no online test and went straight to a 2+ hour Codepair interview, and a February 2025 Software Developer candidate on Code360 was hired through a walk-in drive advertised on LinkedIn.

Online Assessment

Hosted on HackerEarth: MCQs spanning computer networks, OOP, DBMS, SQL, operating systems, and system security, combined with 3 coding problems at medium difficulty, often on trees and linked lists.

Eligibility (campus drives, candidate-reported): No CGPA or backlog rule is published; GfG’s process guide lists B.E., B.Tech or M.Sc. in computer science or a related field, and the 2021 drive was open to CSE, ECE and EEE. Some SDE-1 referral loops skip a separate OA and start directly on a long Codepair technical - confirm in the HR mail.

Common questions

  • MCQs on TCP/IP basics, normalization, OOP pillars, and process scheduling
  • Tree and linked-list manipulation problems
  • SQL query MCQs (joins, aggregations)
  • Basic system-security conceptual questions

Technical Interview 1

A genuinely long DSA round - one candidate account on GeeksforGeeks describes a 2+ hour Codepair session with 5 problems and thorough edge-case probing - paired with a detailed project discussion.

Common questions

  • Find pairs in an array that sum to a given target
  • Design a stack that supports push, pop, top, and retrieving the minimum in O(1)
  • Tree/linked-list problems with follow-up edge-case questions
  • Detailed walkthrough of a resume project - architecture, hardest bug, trade-offs

Round-by-round narratives are on the Delhivery interview experience page.

Technical Interview 2

Shifts to low-level design and SQL, sometimes run same-day as Round 1. Design prompts commonly borrow from Delhivery’s own logistics domain rather than staying purely abstract.

Common questions

  • Design a URL-shortening service - schema and scaling approach
  • Design a database for warehouses - entities, relationships, query patterns
  • Explain the CAP theorem with a distributed-database scenario
  • Write a SQL query to find the Nth highest salary/value in a table
  • Which design pattern (Singleton, Factory, Builder, Abstract Factory) fits a given scenario, and why

HR Discussion

A closing conversation on motivation, logistics-domain interest, and offer details.

Common questions

  • Tell me about yourself and why Delhivery
  • How would you design a system to track a shipment across thousands of hubs in near real time
  • Tell me about a time you optimized a slow SQL query or a process end to end
  • Are you comfortable with the operational, high-volume nature of logistics tech

Sample answer frameworks for each of these are on the Delhivery HR interview questions page.

Why Delhivery’s design questions feel different

Because Delhivery runs a physical logistics network at national scale - warehouses, hubs, and delivery partners generating constant high-volume writes - its low-level and system-design questions are usually anchored to that reality: a warehouse database schema, a shipment-tracking system, or a URL-shortener-style service used internally for tracking links. Candidates who can reason about write-heavy, geographically distributed data (not just a textbook CRUD app) tend to stand out more than those who only rehearse generic LLD templates.

Common question clusters (with frameworks)

Logistics-tech themes: DSA, routing or warehouse sketches, and ops-aware behavior.

1. OA or Codepair DSA

Framework: Medium problems with clean complexity talk. Some SDE-1 loops lean live coding heavily.

2. Routing and optimization intuition

Framework: State constraints (capacity, SLA, hubs), propose a heuristic, discuss what breaks at festival peaks.

3. LLD plus behavioral hybrids

Framework: Design a small service, then ownership or conflict STAR in the same conversation.

4. Why logistics tech

Framework: Gurugram or Bengaluru hubs, real-world constraint love, not only “I like coding”.

How to prepare for Delhivery interviews

  1. Loop map: Online Assessment (HackerEarth); Technical Interview 1; Technical Interview 2; HR Discussion. Confirm timings from the drive mail.
  2. Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
  3. Experiences: Study round-wise notes on the interview experience page.
  4. HR: Three STAR stories + a specific “Why Delhivery?” on the HR page.

A practical Delhivery prep plan

Use this as a default four-week loop before a Delhivery drive. Adjust to your invite timeline.

  1. Week 1: Timed aptitude + one easy coding problem a day, plus a one-page cs fundamentals sheet. Open the Delhivery previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
  2. Week 2: Most Delhivery drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
  3. Week 3: Technical interviews at Delhivery usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practice “Why Delhivery?” with one concrete product, lab, or business line - not a slogan.
  4. Week 4: Two full mocks, then only error-log topics - no new patterns. If you still have energy, redo only the questions you failed in week 2.

10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.

Compensation notes

Candidate-reported fresher/early-career packages for Delhivery often cite ₹10-20 LPA fresher band.

Frequently asked questions about Delhivery interviews

Does the Delhivery online assessment have negative marking?

No public report mentions negative marking. In a 2021 campus test on HackerEarth, each of the 10 MCQs carried 4 marks and the 3 coding problems carried 50, 20 and 20 marks, and no candidate report describes deductions for wrong answers.

What is the cutoff for the Delhivery online assessment?

Not published; shortlists are relative to the batch and tight. In a 2021 NIT Jamshedpur drive, about 200 students took the test and 6 advanced; the candidate who cleared it solved the 50-mark coding problem and answered all MCQs correctly. A November 2023 campus report on Code360 had 146 students take the test and 12 reach interviews. No CGPA cutoff is published; the 2021 drive was open to CSE, ECE and EEE.

What is Delhivery’s interview process for freshers?

Delhivery’s process typically runs 3-4 rounds: 1. Online Assessment (on HackerEarth) - MCQs on computer networks, OOP, DBMS, SQL, operating systems, and 3 medium-difficulty coding problems. 2. Technical Interview 1 - a long DSA session (candidates report 5+ problems solved live on a shared coding pad) plus project deep-dive. 3. Technical Interview 2 - low-level design, SQL, and behavioral/puzzle questions, sometimes same-day as Round 1. 4. HR discussion - fit and offer. The full loop can move fast, sometimes wrapping within about a week.

What does Delhivery’s online assessment cover?

It’s hosted on HackerEarth and combines MCQs (computer networks, OOP, DBMS, SQL queries, operating systems, system security) with 3 coding problems of medium difficulty covering data structures like trees and linked lists.

How many technical rounds does Delhivery have?

Most candidates go through 2 technical interviews after the OA, followed by an HR discussion - so 3-4 rounds total. Given Delhivery is a logistics-technology company, expect at least one round to touch practical, scale-oriented problems (like designing a warehouse database or a URL-shortener-style service) rather than pure textbook DSA.

How should I prepare for Delhivery interviews?

Practice medium-level coding problems (trees, linked lists, arrays, and a stack-with-getMin-in-O(1) style question), revise SQL and be ready to write queries live (e.g., finding the Nth highest salary), brush up on OOP/DBMS/OS/networking basics, and practice low-level design fundamentals - design patterns (Singleton, Factory, Builder), CAP theorem, and a warehouse or shipment-tracking data model - since Delhivery’s business is logistics at high volume.

Is Delhivery’s technical round long?

Candidate reports describe the DSA round as unusually long and marathon-like - one GeeksforGeeks account describes a 2+ hour Codepair session with multiple problems and full edge-case discussion, followed by a same-day second round covering low-level design, behavioral questions, and a puzzle. Pace yourself and don’t rush the first problem expecting a short round.

Does Delhivery ask logistics-domain system design questions?

Yes. Beyond generic LLD, interviewers frame design questions around Delhivery’s actual domain - a database design for warehouses, a URL-shortening-style service, or a system for tracking shipments across hubs at scale. Being able to reason about high-write-volume, geographically distributed data (not just a textbook CRUD app) is a real differentiator here.

Does Delhivery ask system design for freshers?

Often, at a practical level - many loops include routing, warehouse, or tracking sketches. Focus on constraints and failure modes more than trendy architecture buzzwords.

Where does Delhivery hire engineers?

Commonly cited tech locations include Gurugram, Bengaluru, and Hyderabad. Confirm on your specific role.

Delhivery campus hiring vs referral SDE-1 hiring

Campus drives start with a 90-minute HackerEarth test (MCQs plus weighted coding problems), then one or two short technical rounds that mix DSA, SQL, CS basics and questions on whatever stack your resume lists, and a final technical and managerial round.

Referral and lateral SDE-1 hiring usually skips the online test. Candidates go straight to a long Codepair DSA round (2+ hours, about five problems with follow-ups), then a same-day round on LLD, behavior and a puzzle, then HR. This page covers both routes; if you came through a referral, prepare for the long live-coding session rather than MCQs.

Sources

For round-by-round stories, see the Delhivery interview experience page. For OA papers and coding drills, use Delhivery on placementpapers.app. OA quick answers and role-wise questions draw on GfG’s Delhivery interview experiences (on-campus 2021, SDE-1 referral and earlier sets), GfG’s Delhivery recruitment process page (updated July 2025), and Code360 Delhivery interview experiences (2019 and November 2023 campus, February and May 2025) seen through search snippets.

Popular

↑↓ navigate↵ open