Filter interviews by
I applied via Approached by Company and was interviewed in Oct 2023. There were 4 interview rounds.
Top trending discussions
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 Referral and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jul 2021. There were 3 interview rounds.
Cocubes Test Task 1 is of Aptitude questions needs to be completed in Specific time interval and Task 2 is Essay Writing to be finished in Given interval
L1 Exam should be cleared L 1 exam is of multiple choice questions and completely related to Java J2Ee Spring
I applied via Recruitment Consultant and was interviewed in Jan 2021. There were 3 interview rounds.
let vs var in JavaScript and hosting
let has block scope while var has function scope
let cannot be redeclared in the same scope while var can
Hosting is the process of moving a website or application to a server
JavaScript can be hosted on various platforms such as AWS, Heroku, and Firebase
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the next element is smaller, swap them
Repeat this process for all elements in the array
Continue this process until no more swaps are needed
A program to print all prime numbers
Take input from user for range of numbers
Loop through the range and check if each number is prime
Print the prime numbers
Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Examples of hashmap implementations include Java's HashMap class and Python's dict type.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class and can also add new properties and methods.
For...
based on 1 interview
Interview experience
Data Scientist
5
salaries
| ₹7.2 L/yr - ₹11.5 L/yr |
Software Engineer
4
salaries
| ₹8 L/yr - ₹11 L/yr |
Software Developer
4
salaries
| ₹10 L/yr - ₹15 L/yr |
Senior Leader Engineer
3
salaries
| ₹32 L/yr - ₹36 L/yr |
Applied Data Scientist
3
salaries
| ₹8.5 L/yr - ₹16 L/yr |
TCS
Accenture
Wipro
Cognizant