Me postulé a través de una facultad o universidad. El proceso tomó 1 semana. Acudí a una entrevista en OneDirect (India) (Noida) en ago 2019
Entrevista
On campus
There were 4 rounds.
1- Shortlisting round
( General information along with profiles on coding websites like codechef, hackerrank, hackerearth, github) and some behavioural questions.
2- Two technical Interviews
3- Culture fit round
(A form with behavioral questions)
Preguntas de entrevista [1]
Pregunta 1
Given a mXn matrix you need to find the maximum sum of path from the top row to the bottom row given that you can move only bottom or diagonally (left/right).
Me postulé a través de una facultad o universidad. El proceso tomó 1 semana. Acudí a una entrevista en OneDirect (India) (Bengaluru) en mar 2022
Entrevista
round1- resume screening round
related to full stack developer role
round2- coding round
4 questions on the Hacker Earth platform
round3- technical interview phase1 round
live coding + SQL + about your projects
round4- technical interview phase2 round
about your projects + Data Structure(Linked List, Stack)
round5- HR round
discussion round
Offer letter
Me postulé a través de una facultad o universidad. El proceso tomó 3 días. Acudí a una entrevista en OneDirect (India) (Bengaluru) en mar 2021
Entrevista
First round students were shortlisted based on their previous projects
second round was coding
third round was tech HR
final was general HR
This was for an intern offer and the interview took place completely online via Microsoft Teams.
Preguntas de entrevista [1]
Pregunta 1
Explain your projects and the technologies you used
Me postulé a través de una facultad o universidad. Acudí a una entrevista en OneDirect (India)
Entrevista
Round 1: Shortlisting based on forms provided by the college
Form had links to all online profiles and some hr like questions
Out of 800 applications, 50 were shortlisted (Most probably randomly)
Round 2: Coding Test on hackerearth (Duration 2hrs)
Round 3: PI
Round 4: PI
Preguntas de entrevista [1]
Pregunta 1
1. Print the prime number just greater than given prime number
2. Find the largest substring of given string which is present in it at the start and at the end
3. A question that required a binary search
4. A question that required unordered_map
