Filter interviews by
I appeared for an interview before Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
Its an fairly tough apti-code test , the only way to crack it is you practise and crack it , 5 programming languages are allowed for the coding test (c, c++, c#, java , python) , and you get sufficient time to solve and crack the exam , only if you are prepared well !
Given an array arr
of 'N' integer elements, your goal is to remove 'K' elements from either the beginning or the end of the array. The task is to return the ma...
Given an array of integers, remove K elements from either end to maximize sum of remaining elements.
Iterate through all possible combinations of removing K elements from start and end
Calculate sum of remaining elements for each combination
Return the maximum sum obtained
Round duration - 40 minutes
Round difficulty - Medium
This was Technical Round purely to test your knowledge in programming and computer fundamental basics along with what all technical skills you are/you've been working on !
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
The first line cont...
Check if a given matrix is idempotent by verifying if M * M equals M.
Calculate the product of the matrix with itself and compare it with the original matrix.
If the product equals the original matrix, then it is idempotent.
Iterate through the matrix elements to perform the necessary calculations.
Round duration - 50 minutes
Round difficulty - Easy
This was also a Technical round but was mostly focused on your projects and how well you were familiar with its core concepts , comparatively easy if you have done your project with full concentration
Determine if a given array contains a valid triplet of integers where two elements sum up to the third. Specifically, find indices i, j, and k such that i != j
, j != k
...
Check if a given array contains a valid triplet where two elements sum up to the third.
Iterate through all possible triplets in the array and check if any of the conditions are satisfied.
Use nested loops to compare each element with every other element in the array.
Handle cases where the elements are not distinct by ensuring i != j, j != k, and i != k.
Tip 1 : Be very very specific about your project details
Tip 2 : Work more on coding (Dynamic)
Tip 3 : Match the job requirement vision
Tip 1 : Keep it Short but Impresssive
Tip 2 : Include Co-curricular activites
Top trending discussions
I applied via Campus Placement and was interviewed before Sep 2020. There were 4 interview rounds.
Find the second largest element from an integer array in a single traversal
Initialize two variables to store the largest and second largest elements
Traverse the array and update the variables accordingly
Return the second largest element
I applied via Company Website and was interviewed before Jan 2021. There were 4 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.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
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
I applied via Campus Placement and was interviewed in May 2020. There were 6 interview rounds.
Design patterns are reusable solutions to common software problems. Android system uses various design patterns.
MVC (Model-View-Controller) pattern is used in Android to separate UI logic from business logic.
Singleton pattern is used to ensure only one instance of a class is created.
Observer pattern is used to notify changes in data to multiple components.
Builder pattern is used to simplify complex object creation.
Adap...
based on 44 reviews
Rating in categories
Software Developer
624
salaries
| ₹4.2 L/yr - ₹15.3 L/yr |
Software Development Engineer
575
salaries
| ₹4.5 L/yr - ₹13 L/yr |
Assistant Manager
480
salaries
| ₹3 L/yr - ₹12 L/yr |
Product Manager
446
salaries
| ₹10.4 L/yr - ₹42 L/yr |
Deputy Manager
411
salaries
| ₹4.8 L/yr - ₹20.3 L/yr |
Jio
DXC Technology
Mphasis
Sutherland Global Services