Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
On Platform called EDUTRILL . Two easy coding questions where asked to solve in an hour .
Both were based on arrays and not of difficult level.
basic understanding of if else statements , loops was enough.
I was interviewed in Dec 2020.
Round duration - 50 minutes
Round difficulty - Easy
Had to give at least 10 MCQ tests with 5 questions each with 60% accuracy .(each round takes 3 min approx)
Then an easy coding question was asked.
It was an online test.
The webcam was on.
EduThrill would have the candidates go through filtering rounds consisting of questions around data structures, algorithms, problem-solving, etc.
And instant % was visible after each round
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces in user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Tip 1 : Code Daily
Tip 2 : Be Confident
Tip 3 : Study the fundamental Subjects and Concepts Deeply
Tip 4 : Add Skills to Resume
Tip 5 : Participate in Co-Curricular Activities too
Tip 1 : Mention your non-technical skills as well. eg: a member of college club.
Tip 2 : One good project is enough
Tip 3 : Mention the tools and technologies of tools as well
Tip 4 : Use more technical terms
Tip 5 : Give details of important things. i.e. "What was your project about? What tools & technologies you used? What was the impact of the project?
Top trending discussions
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
posted on 2 Jan 2021
I applied via Naukri.com and was interviewed in Dec 2020. There was 1 interview round.
posted on 25 Jul 2024
My name is John Smith.
Full name is John Smith
Common first and last name
No middle name
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience in developing web applications
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
posted on 6 Jun 2024
I applied via Campus Placement and was interviewed in Nov 2021. There were 3 interview rounds.
Reversing a string involves flipping the order of characters in a given string.
Create an empty string to store the reversed string
Iterate through the original string from the end to the beginning
Append each character to the empty string
Return the reversed string
posted on 1 Mar 2023
I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2020. There was 1 interview round.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Associate
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Randstad
Team Lease
Quess
ManpowerGroup