J'ai postulé en ligne. J'ai passé un entretien chez Aniket Jain (Noida) en sept. 2024
Entretien
basic to medium questions. Starting with portfolio and then knowing about technical skills and then working projects. Prepare for the basic to medium DSA questions like String, linked list, array and basic binary tree questions. Prepare to explain your working on the projects you have shared and then your understanding about the company. Overall good experience.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Aniket Jain (Pune) en août 2024
Entretien
Application & Resume Screening
Your resume and cover letter are reviewed by recruiters or hiring managers.
Automated systems (ATS) may scan for relevant keywords, skills, and experience.
2. Initial HR/Recruiter Call
A 15–30 minute conversation.
Focuses on your background, availability, salary expectations, and general fit.
May include brief questions about your resume or experience.
3. Technical Assessment
This stage varies by company and can include:
Online coding tests (via HackerRank, Codility, etc.)
Take-home assignments (build a feature, fix a bug, or design a system)
Algorithm and data structure problems (usually time-bound)
4. Technical Interviews (1–3 Rounds)
These are typically conducted via video calls or onsite:
Coding Interview: Solve DSA problems in real-time using a whiteboard or code editor.
System Design Interview (for experienced roles): Design scalable systems like a URL shortener or chat app.
Code Review or Pair Programming: Collaborate with an engineer on a task to assess your coding style and collaboration.
Questions d'entretien [1]
Question 1
Question: Two Sum
Problem Statement:
Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
text
Copy
Edit
Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]
Explanation: nums[0] + nums[1] == 2 + 7 == 9