EdgeVerve Systems Software Developer Intern Interview Questions and Answers

Written test coding and with aptitude questions are asked

Q1. Asking about OOPS and C++ basics concepts
Add your answer

Here , you need to type the code and there won’t be any compiling . So you just need to type what you know

Q1. Oops , programming language ,
Add your answer
Q2. SQL, sdlc . These are required
Add your answer

Q1. Same as anywhere to have
Add your answer

Round duration - 90 mins
Round difficulty - Medium

- timing was 5:00 AM in the morning
- 2 coding questions and 10 MCQ
- MCQ tested variety of concepts like Database management, OOPS, pointers and C

Q1. 
Car Pooling Capacity Problem
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...read more
Ans. 
Build an array add the number at entry index and subtract the number at exit index. after constructing the array, make 2 variables max and cur. cur stores the maximum sum of currently and max stores the maximum sum encountered till now.
Answered Anonymously
Add your answer
Q2. 
Distance To Nearest 1 in a Binary Matrix Problem
Given a binary matrix MAT containing only 0s and 1s of size N x M, find the distance of the nearest cell containing 1 for each cell in the matrix.
The dis...read more
Ans. 
This is solved by an algorithm called multisource bfs, add all the land cells in a queue then apply bfs to find shortest distance of all water cells.
Answered Anonymously
Add your answer

Round duration - 30 mins
Round difficulty - Easy

Round was technical + HR round

Q1. Tell me about your project, its utility, the problems you faced, and any general HR questions you encountered.
Ans. 
Tip 1 : be confident while speaking
Tip 2 : Don't take it as an interview take it as a conversation
Tip 3 : When the interviewer asks if you have any questions, never say no always ask something
Answered Anonymously
Add your answer

Was conducted on hackerrank
3 questions
2 lc hard
1 lc medium

Q1. Asked 1DSA coding problem and 3 follow ups for same
Add your answer
Q2. Longest increasing subsequence
Ans. 
Find the longest increasing subsequence in an array
• Use dynamic programming to solve this problem

• Iterate through the array and keep track of the longest increasing subsequence ending at each index

• Time complexity can be optimized to O(n log n) using binary search
Answered by AI
Add your answer

Q1. Simple Question on my project
Add your answer