Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Evervent Team. If you also belong to the team, you can get access from here

Evervent Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Evervent Software Developer Intern Interview Questions and Answers

Updated 27 Feb 2024

Evervent Software Developer Intern Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Easy test was there with dsa qs

Round 2 - HR 

(1 Question)

  • Q1. Simple question related to hr were asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Company is lazy

Interview questions from similar companies

I applied via Company Website and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Coding questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with the concepts of coding, data structures and algorithms. Focus on topics like trees, linked list, arrays.

I was interviewed in Dec 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

Very friendly interviewer. Although waiting time was very high

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - CV points, Leadership principles, ecommerce basics, problem solving, case studiesTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions

Application resume tips for other job seekers

Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered. 

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.

    • Iterate through the array and keep track of the maximum sum subarray encountered so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Consider the sum of an empty subarray as 0.

    • Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.

  • Answered by AI
  • Q2. 

    Connecting Ropes with Minimum Cost

    You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...

  • Ans. 

    Connect ropes with minimum cost by merging two smallest ropes at a time.

    • Sort the array of rope lengths in ascending order.

    • Merge the two smallest ropes at a time and update the cost.

    • Repeat the process until all ropes are merged.

    • Return the total cost as the minimum cost to connect all ropes.

  • Answered by AI
  • Q3. 

    Left View of a Binary Tree Problem Statement

    Given a binary tree, your task is to print the left view of the tree.

    Example:

    Input:
    The input will be in level order form, with node values separated by a...
  • Ans. 

    Print the left view of a binary tree given in level order form.

    • Traverse the tree level by level and print the first node encountered at each level

    • Use a queue to perform level order traversal

    • Keep track of the level while traversing the tree

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets with the required relationship.

    • Keep track of the sum of each triplet and compare it with the given integer X.

    • Return the triplets that satisfy the condition in any order.

    • Ensure each triplet follows the format (grand-parent, parent, child).

  • Answered by AI
  • Q2. 

    Loot Houses Problem Statement

    A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...

  • Ans. 

    Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.

    • Use dynamic programming to keep track of the maximum amount of money that can be stolen up to each house.

    • At each house, the thief can either choose to steal from the current house or skip it and steal from the previous house.

    • The maximum amount of money that can be stolen at the current house is the maximum of the ...

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces, etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Only write those things in the resume which you are confident of and keep practicing.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 180 minutes
Round difficulty - Easy

The online round consisted of 2 coding questions based on data structures and algorithms, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section was timed.

  • Q1. 

    Palindrome Linked List Problem Statement

    You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true if it is a pali...

  • Ans. 

    Check if a given singly linked list is a palindrome or not.

    • Use two pointers approach to find the middle of the linked list

    • Reverse the second half of the linked list

    • Compare the first half with the reversed second half to determine if it's a palindrome

  • Answered by AI
  • Q2. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    Calculate total unique paths from top-left to bottom-right corner of a matrix by moving only right or down.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of unique paths for each cell.

    • Initialize the first row and first column with 1 as there is only one way to reach them.

    • For each cell, the number of unique paths is the sum of the paths from the cell above and the cell to...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

The interview was early in the morning at 9 am. We turned on our videos and the interviewer asked for my introduction. She was helpful and provided me with hints whenever I needed. The interview was taken on Amazon chime and she also shared a link where I can write the code. It could be editable by both of us.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteriaCandidate must be femaleAmazon interview preparation:Topics to prepare for the interview - C++, Data Structures(Focus more on trees and graphs), Dynamic Programming, Algorithms, Operating Systems, Object Oriented Programming, Database Management System, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : You must confidence over Data Structures and its concepts. Pick one coding platform and try to practice at least 5-6 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks.
Tip 2 : Not attempting the question is enough. try to analyze its time and space complexity. See, if you can further optimize your solution. Sometimes the interviewer asks only one question and keep on increasing its difficulty by asking for its optmization.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.

Application resume tips for other job seekers

Tip 1 : Do not mention any skills, projects or achievements which you haven't completed yourselves. If you are not able to answer the basic questions it leaves a bad impact.
Tip 2 : You do need to have a lot of projects. Only one good project with proper knowledge is also fine. The same goes for the skills as well.
Tip 3 : Try to write achievements which shows your technical skills, communication skills, leadership quality or teamwork.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    Find the maximum sum of a contiguous subarray in an array of integers.

    • Use Kadane's algorithm to find the maximum subarray sum in linear time.

    • Initialize two variables: maxSum and currentSum.

    • Iterate through the array and update currentSum by adding the current element or starting a new subarray.

    • Update maxSum if currentSum becomes greater than maxSum.

    • Return maxSum as the maximum subarray sum.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets.

    • Check if the sum of each triplet is greater than X.

    • Ensure the relationship of grandparent-parent-child in each triplet.

    • Return the valid triplets in any order.

    • Handle constraints and edge cases appropriately.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

FACE TO FACE ROUND INTERVIEW

  • Q1. Can you tell me about yourself?
  • Q2. What is the difference between Mutex and Semaphores? Please provide a real-life example.
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.

    • Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.

    • Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.

    • Exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaabove 7 cgpaAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces

Application resume tips for other job seekers

Tip 1 : Only write the things on which you are the most confident about

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Who is the CEO of amazon?
  • Q2. Andy Jassy

Interview Questionnaire 

1 Question

  • Q1. Data structures, thoroughly

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Evervent Interview FAQs

How many rounds are there in Evervent Software Developer Intern interview?
Evervent interview process usually has 2 rounds. The most common rounds in the Evervent interview process are Coding Test and HR.

Recently Viewed

INTERVIEWS

Publicis Sapient

No Interviews

INTERVIEWS

Aadhar Housing Finance

No Interviews

INTERVIEWS

Ashok Leyland

No Interviews

INTERVIEWS

Bajaj Auto

No Interviews

INTERVIEWS

Shree V.J. Modi School

No Interviews

INTERVIEWS

GE Vernova

No Interviews

INTERVIEWS

Ameriprise Financial

No Interviews

INTERVIEWS

KreditBee

No Interviews

DESIGNATION

INTERVIEWS

KrazyBee

No Interviews

Tell us how to improve this page.

Evervent Software Developer Intern Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more
Project Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Application Support Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Evervent with

BookMyShow

4.0
Compare

Cleartrip

3.4
Compare

MakeMyTrip

3.7
Compare

Paytm

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent