Filter interviews by
I applied via Walk-in and was interviewed before Jan 2021. There were 3 interview rounds.
0 factorial is defined as 1 because it represents the number of ways to arrange 0 objects.
0! is the product of all positive integers less than or equal to 0, which is 1.
It is a convention in mathematics to define 0! as 1.
0! is used in various mathematical formulas and calculations.
For example, in combinatorics, 0! represents the number of ways to arrange 0 objects.
Permutations and combinations are different mathematical concepts used to count and arrange objects.
Permutations involve arranging objects in a specific order.
Combinations involve selecting objects without considering the order.
Permutations use factorial notation, while combinations use binomial coefficients.
Permutations have a larger number of possibilities compared to combinations.
Example of permutation: arranging le...
Teachers are preferable than online teaching because they provide personalized guidance, interactive learning experiences, and social interaction.
Teachers provide personalized guidance and support to students, addressing their individual learning needs.
Teachers create interactive learning experiences through hands-on activities, discussions, and group work.
Teachers facilitate social interaction among students, promotin...
Top trending discussions
I applied via Walk-in and was interviewed in Apr 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Oct 2020. There were 4 interview rounds.
I appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
2 coding questions and 20 mcq
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all oranges and return -1 if any fresh oranges remain.
Handle edge cases like no fresh oranges or all oranges already rotten.
Consider using a queue to efficiently process adjacent oranges.
Ensure to update the grid with the new state of oranges after each second.
Given a natural number N
, return the sum of all its proper divisors.
A proper divisor of Y
is defined as a number X
such that X < Y
and Y % X = 0
.
T...
Calculate the sum of proper divisors of a given natural number.
Iterate from 1 to sqrt(N) and check for divisors
If a divisor is found, add it to the sum and also add N/divisor if it is not the same as divisor
Return the sum as the result
Round duration - 45 Minutes
Round difficulty - Medium
Technical interview
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.
Rearrange the array elements to form the largest possible number by concatenating them.
Sort the array elements in a custom comparator function to get the largest number.
Convert the sorted array elements to strings and concatenate them to form the final number.
Handle cases where the numbers have the same prefix by comparing the concatenated forms.
Tip 1 : Be clear about whatever you have mentioned in resume, don't mention buzz words, because interviewer can go in depth
Tip 2 : Along with DS and Algo, if you have 3-4 months experience or internship experience, then be ready to answer scenario based technical questions like scaling the application that you developed and design concepts that can be used for improving
Tip 3 : Last but most important tip is to be calm through out the whole process ,don't loose hope if any round didn't go well ,if you have explained your thought process there is still chance to procees to next round so keep preparating for next rounds.
Tip 1 : Keep it one page resume and mention keywords which align with your technical and personal competencies.
Tip 2 : Mention 3-4 projects in the order that , project which you can explain best should be at top,then the next, and so on.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
Round 1 is quit easy , only verbal ability is little bit difficult. So anyone can easy to qualify round.
I applied via Referral and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Mar 2021. There was 1 interview round.
based on 2 reviews
Rating in categories
PGT Maths
3
salaries
| ₹4 L/yr - ₹4 L/yr |
TCS
Accenture
Wipro
Cognizant