Skip to content
dronacharya.ai

Navi Technologies

PlacementSoftware

Built from 1 candidate report with 2 first-hand accounts, covering 2023.

Hiring process

2023 · Placement

  1. 1

    Coding test

    Coding / written round
    easy
    SectionQsTopics
    General aptitude-logical reasoning, permutation and combination, probability, algebra, number theory
    Coding-dynamic programming, graphs

    aptitude · dynamic programming · graph DFS

    One account calls it basic but says the number of questions for the time was tight.

  2. 2

    Technical interview

    Interview round 1

    BFS · graph traversals · linked lists · estimation / analytical questions

    Accounts differ: one was graph and linked list questions, the other analytical estimation questions.

  3. 3

    Technical interview

    Interview round 2

    internship · projects · binary tree BFS

  4. 4

    HR interview

    easy

    resume · projects · brain teasers · CS fundamentals · DSA · why a startup · culture fit

    One account calls it the easiest round.

Advice from candidates

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

  • Leetcode and Geeksforgeeks are your best friends.

    preparation · 2023

  • Having a good knowledge of general aptitude questions is sufficient. Knowledge of logical reasoning, permutation and combination, probability, algebra, and number theory would help a lot.

    test · 2023

  • The key thing to note is the actual answer does not matter much, the way in which the question is approached is much more crucial.

    interview · 2023

  • Be clear on what you have done. State clearly what was the role assigned to you (if team project) and how you accomplished it.

    interview · 2023

Loading the other 2…

Question patterns reported

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

  • Codingone DP problem and one DFS graph problem
  • Technicalstandard BFS problem with follow-ups
  • TechnicalFermi estimation of everyday counts
  • Technicaltime for spread across a binary tree from one start node