Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2024. There were 3 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed before May 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before May 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before May 2021. There were 4 interview rounds.
VERBAL QUANT DI/LR and Picture based test
Fibonacci series can be easily implemented using loops in C++ or C.
Declare variables for first two numbers of the series
Use a loop to calculate and print the next number in the series
Repeat the loop until desired number of terms are printed
I applied via Walk-in and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via Company Website and was interviewed before May 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.
I was interviewed before Sep 2020.
Round duration - 30 Minutes
Round difficulty - Easy
The questions ranged from prime number concepts to one question on linked list.
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Given DAY_HOURS and PARTS, find total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and check for prime groups at the same position in different parts.
Each prime group consists of prime numbers occurring at the same position in different parts.
Return the total number of equivalent prime groups found.
Ensure DAY_HOURS is divisible by PARTS and each hour in a prime
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...
Add two numbers represented as linked lists in reverse order and return the sum as a linked list.
Traverse both linked lists simultaneously, adding corresponding digits and carrying over if necessary.
Handle cases where one list is longer than the other by considering carry over.
Create a new linked list to store the sum digits in reverse order.
Return the head of the new linked list as the result.
Tip 1 : Do practice aptitude faithfully because it will help you in cracking the first round.
Tip 2 : Study concepts from different sites like Coding Ninjas, Geeks for Geeks for better understanding.
Tip 1 : Resume should be one pager.
Tip 2 : Mention your job specific projects on the resume.
based on 1 interview
Interview experience
Java Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Mern Stack Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech