Filter interviews by
Print prime numbers between 1 to 10
A prime number is a number that is only divisible by 1 and itself
The prime numbers between 1 to 10 are: 2, 3, 5, 7
Top trending discussions
Data types are classifications that specify which type of value a variable can hold.
Primitive data types: int, float, char, boolean
Non-primitive data types: arrays, classes, interfaces
Derived data types: pointers, arrays, functions
I applied via Referral and was interviewed in Nov 2023. There was 1 interview round.
I applied via LinkedIn and was interviewed in Oct 2023. There were 3 interview rounds.
Good and competitive
Challenging taks and should have very good knowledge in DSA
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
Truncate is faster but cannot be rolled back, while Delete is slower but can be rolled back.
Truncate removes all rows from a table quickly, but cannot be rolled back.
Delete removes rows one by one, slower than Truncate, but can be rolled back using a transaction.
Truncate resets the identity seed of the table, while Delete does not.
Connect nodes to their right in a binary tree using an extra pointer.
Traverse the tree using level order traversal
For each node, connect its right child to the next node in the level
If there is no next node, set the right child to null
Design considerations for an elevator system with 5 elevators and 50 floors.
Traffic patterns and peak hours should be analyzed to determine the optimal number of elevators to be in operation at any given time.
Elevators should be programmed to prioritize stops based on the direction of travel and the proximity of the requested floor to the elevator's current location.
The system should be designed to minimize wait times ...
Given two linked lists, check if they have a common node.
Traverse both lists and compare each node's memory address
Use a hash table to store memory addresses of nodes in one list and check for matches in the other list
If one list is shorter, traverse it first and then start traversing the longer list from the difference in length
Find if an array has a majority element in O(n)
Iterate through the array and keep track of the count of each element
If the count of any element is greater than half the length of the array, return true
Otherwise, return false
Find element in 2D array which is max in column and min in row with minimum comparisons
Iterate over rows and columns to find max and min elements respectively
Compare the max element of a column with the min element of its row
Return the element if it satisfies the condition
Consider edge cases like multiple elements satisfying the condition
Return an array with only unique elements
Use a Set to store unique elements
Loop through the array and add each element to the Set
Convert the Set back to an array and return it
I applied via Naukri.com and was interviewed in Jan 2024. There were 4 interview rounds.
Reasoning english aptitude
Topic about business
Java coding about files
Data Analyst
18
salaries
| ₹3 L/yr - ₹5.5 L/yr |
Solution Developer
18
salaries
| ₹2.6 L/yr - ₹6.8 L/yr |
Software Developer
14
salaries
| ₹2.6 L/yr - ₹6.6 L/yr |
UI Developer
9
salaries
| ₹3.3 L/yr - ₹6.6 L/yr |
Team Lead
5
salaries
| ₹9 L/yr - ₹17.5 L/yr |
Digital Green
Gram Vaani
The Akshaya Patra Foundation
eClerx