Skip to content
dronacharya.ai

UnDosTres

PlacementSoftware

Built from 1 candidate report with 1 first-hand accounts, covering 2021-22.

Hiring process

2021-22 · Placement

  1. 1

    Online test

    Online test: DSA MCQs plus coding
    Google Formsonline
    SectionQsTopics
    MCQ20data structures, complexity analysis, pseudocode output
    Coding2greedy grouping, pattern indexing

    arrays · trees · graphs · linked list · stack · queue · hashmap · big O

    MCQ count given as 15-20.

  2. 2

    Technical interview

    Technical interview 1, live coding
    3 questionshard

    arrays · binary trees · heap or sweep line

    Problems given as links to public judges; had to pass all test cases.

  3. 3

    Technical interview

    Technical interview 2, one coding problem
    Google Docs1 questionshard

    deque · prefix sums · complexity discussion

    Brute force and complexity discussed before coding.

  4. 4

    Technical interview

    Technical plus HR round

    basic DSA · edit distance · string similarity grouping

Advice from candidates

5 pieces of advice, in their own words. Names removed.

  • Solved questions on online platforms to gain a good understanding of DSA and Algorithms.

    preparation · 2021-22

  • Read past interview experiences on Geeks for Geeks to gain insights into the process and the type of questions asked

    preparation · 2021-22

  • Company places high focus on problem solving. Data structures and algorithms need to be very strong to have a good chance at cracking this company. One may expect non-standard questions in the interviews.

    general · 2021-22

  • Clear thought and good communication can help you get through the interviews.

    interview · 2021-22

Loading the other 1…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

  • Onlinegreedy bin packing of groups into fixed-capacity vehicles
  • Onlinecompute value at position in repeating numeric pattern
  • Technicalfind duplicate in array with constraints
  • Technicaltime to burn a binary tree
  • Technicalskyline merge, hard
  • Technicalshortest subarray with sum at least K
  • Technicalgroup near-duplicate phone number strings, edit-distance idea