Filter interviews by
I appeared for an interview in Jan 2021.
Round duration - 60 minutes
Round difficulty - Medium
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
This is a problem of counting the number of distinct ways to climb a staircase with 1 or 2 steps at a time.
Use dynamic programming to solve this problem
Create an array to store the number of ways to reach each stair
Initialize the base cases for 0th and 1st stair
Iterate from 2nd stair to Nth stair and calculate the number of ways using the previous two stairs
Return the number of ways to reach the Nth stair modulo 10^9+7
Round duration - 45 Minutes
Round difficulty - Medium
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
The equilibrium index of an array is the index where the sum of elements to the left is equal to the sum of elements to the right.
Iterate through the array and calculate the total sum of all elements
Initialize a variable to keep track of the left sum, initially set to 0
Iterate through the array again and at each index, check if the left sum is equal to the total sum minus the left sum and the current element
If the cond...
Round duration - 15 Minutes
Round difficulty - Medium
Tip 1 : practice 250 questions atleast
Tip 2 : become comfortable in hands on coding
Tip 3 : work on aptitude
Tip 1 : Neat and Clean
Tip 2 : Single page
Tip 3 : Do not lie in resume as they will cross check.
Top trending discussions
I applied via LinkedIn and was interviewed in Nov 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via LinkedIn and was interviewed in May 2021. There were 3 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Timing was in the morning around 10 am. This round was conducted on Hackerrank and contained 2 coding questions of easy to medium level which varied for all the students taking the test. There were 20 MCQs from topics like Java, Operating Systems, Data structures, and SQL.
I also gave a test for this company last year during internships. At that time MCQs were based on aptitude and reasoning. Also at that time, there were 2 coding questions and timing was dividing according to sections.
Given two integers X
and Y
as the first two numbers of a series, and an integer N
, determine the Nth element of the series following the Fibonacci rule: f(x) = f(x...
Calculate the Nth element of a modified Fibonacci series given the first two numbers and N, with the result modulo 10^9 + 7.
Implement a function to calculate the Nth element of the series using the Fibonacci rule f(x) = f(x - 1) + f(x - 2)
Return the answer modulo 10^9 + 7 due to the possibility of a very large result
The series starts with the first two numbers X and Y, and the position N in the series
Given a string STR
comprising uppercase and lowercase characters and spaces, your task is to count the number of consonants in the string.
A consonant is defined as a...
Count the number of consonants in a given string containing uppercase and lowercase characters and spaces.
Iterate through each character in the string and check if it is a consonant (not a vowel).
Keep a count of the consonants encountered while iterating through the string.
Return the total count of consonants at the end.
Round duration - 45 Minutes
Round difficulty - Medium
This round was conducted on Cisco WebEx and the interviewer was very friendly. Firstly, we were asked briefly to introduce ourselves. Then he moved on to the CV and asked various questions about the projects, certifications, and internships mentioned. He asked about the implementation of a few features in some of the projects and also about the challenges I faced while doing the project and how I finally overcome the challenge. He also asked about various skills mentioned in the resume.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list with constant space complexity and linear time complexity.
Create a dummy node to start the merged list
Compare the values of the two linked lists and append the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value's linked list
Continue this process until one of the linked lists is fully traversed
Append the ...
Round duration - 30 Minutes
Round difficulty - Easy
This round started with my Introduction. Then he moved on to behavioral questions just to get an understanding of how we deal with situations and our thinking process.
Tip 1 : Do at least 2 good projects and make an attractive resume mentioning all your skills in the best possible way(Don't include any False commitments)
Tip 2 : Practice easy to medium level coding questions from geeks for geeks or Leetcode.
Tip 3 : Prepare everything mentioned in your resume properly including Java, SQL.
Tip 1 : Include projects and experiences in detail.
Tip 2 : Make an eye-catching resume clearly mentioning all your skills including subjects like data structures, JAVA, SQL, etc. The database is a very important skill if you have its knowledge.
posted on 12 Jun 2021
posted on 2 Oct 2022
I applied via Campus Placement and was interviewed before Oct 2021. There were 4 interview rounds.
All aptitude topic is tested if practiced well will be able to crack it
Software Developer
87
salaries
| ₹2.4 L/yr - ₹10.6 L/yr |
Junior Software Developer
49
salaries
| ₹2 L/yr - ₹6 L/yr |
Business Analyst
43
salaries
| ₹5.7 L/yr - ₹13 L/yr |
Software Tester
33
salaries
| ₹2.4 L/yr - ₹5 L/yr |
Senior Software Developer
30
salaries
| ₹7.5 L/yr - ₹16 L/yr |
Cognizant
Sutherland Global Services
Optum Global Solutions
Hexaware Technologies