Filter interviews by
Be the first one to contribute and help others!
I applied via Walk-in and was interviewed in Sep 2024. There were 3 interview rounds.
I applied via Walk-in and was interviewed in Dec 2024. There was 1 interview round.
They will provide you with a topic randomly, and you will need to write something about it. They aim to assess your grammar and spelling.
posted on 19 Jul 2024
Program to reverse an array of strings
Iterate through each string in the array and reverse it
Use a temporary variable to swap characters at each end of the string
Return the reversed array of strings
Program to extract digits from a string and add them together
Iterate through each character in the string
Check if the character is a digit using isdigit() function
Convert the digit character to integer and add it to a running total
Return the total sum of digits
I applied via Approached by Company and was interviewed before Dec 2023. There was 1 interview round.
posted on 2 May 2024
posted on 15 Jun 2023
Front end technologies deal with the user interface and user experience of a website or application, while backend technologies handle the server-side logic and database management.
Front end technologies include HTML, CSS, and JavaScript.
Backend technologies include languages like Python, Java, and Ruby, as well as databases like MySQL and MongoDB.
Front end focuses on the visual aspects and interactivity of a website, ...
Expected CTC is the salary package a candidate is looking for in their next role.
Expected CTC is the salary package a candidate is looking to receive in their new job.
It helps the employer understand the candidate's salary expectations.
Candidates usually base their expected CTC on their current CTC and market standards.
It is important for both parties to discuss and agree upon the expected CTC before moving forward wit
posted on 30 Sep 2024
Typing speed test in English language
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
posted on 12 Nov 2022
I applied via Referral and was interviewed in May 2022. There were 2 interview rounds.
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.
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 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...
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.
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
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
What is seamaphores?
Types of seamaphores?
What is virtual memory?
Semaphores are synchronization tools used in operating systems to control access to shared resources.
Semaphores are integer variables used to solve the critical section problem.
They can be used to control access to shared resources in a multi-threaded or multi-process environment.
There are two types of semaphores: binary semaphores and counting semaphores.
Binary semaphores can have only two values: 0 and 1, and are use...
What is Normalisation?
Types of normal forms and condtion for BCNF.
What are ACID Properties.
Normalization is the process of organizing data in a database to eliminate redundancy and improve data integrity.
Normalization is used to minimize data redundancy and dependency.
It involves dividing a database into two or more tables and defining relationships between them.
The goal is to eliminate data anomalies and ensure data consistency.
There are different normal forms, such as 1NF, 2NF, 3NF, and BCNF.
BCNF (Boyce-Co...
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.
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
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.
based on 4 reviews
Rating in categories
e-Solutions
Anri Solutions HR Services
Covenant Consultants
Ethos HR Management & Projects