Acudí a una entrevista en EdgeVerve Systems (Bengaluru)
Entrevista
DSA questions were asked. This was through college placements. The interviewer didn't want a explanation. If you know how to code you can get in. If you have all the knowledge and if you not able to code on the spot then this is not the interview or the job you should apply
Me postulé a través de una facultad o universidad. El proceso tomó 1 semana. Acudí a una entrevista en EdgeVerve Systems (Bengaluru) en nov 2023
Entrevista
1. Initial Screening:
The process began with a phone screening conducted by a recruiter. We discussed my background, previous work experience, and the role I was applying for. The recruiter provided a detailed overview of EdgeVerve's culture, values, and the specific team I was interviewing for. This initial conversation set the tone for the subsequent rounds.
2. Technical Interview - Round 1:
The first technical interview delved into my expertise in programming languages and problem-solving. I was given a coding challenge related to optimizing a given algorithm. The interviewer was supportive and encouraged me to explain my thought process, fostering a collaborative atmosphere.
3. Technical Interview - Round 2:
This round focused on system design and architecture. I was asked to design a scalable system for a real-world scenario, considering factors such as load balancing, data storage, and API design. The interviewer was keen on understanding not just the solution but also the reasoning behind each design decision.
Preguntas de entrevista [1]
Pregunta 1
JavaScript:
Explain the concept of closures in JavaScript.
What is the difference between let, const, and var in JavaScript?
Describe the event delegation pattern in JavaScript.
Web Development:
Describe the differences between HTTP and HTTPS.
Explain the concept of AJAX and how it's used in web development.
What is responsive web design, and how is it achieved?
Given an array of integers, write a function to find the two numbers that add up to a specific target.
Implement a function to check if a string is a palindrome.
Given a binary tree, write a function to check if it is a binary search tree.
Implement an algorithm to reverse a linked list.