Filter interviews by
I appeared for an interview in May 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was 4 PM. Platform was good. Overall a good experience.
Ninja is trapped in a prison and plans to escape through its gate. The gate consists of horizontal and vertical bars spaced one unit apart, creating holes of area 1 * 1 between th...
Find the area of the largest hole in a gate after removing certain bars.
Iterate through all possible combinations of removed bars to find the largest hole area.
Calculate the area of each hole after removing bars and keep track of the maximum area.
Consider both horizontal and vertical bars when calculating the area of the hole.
Given an array of integers arr
and an integer limit
, your task is to find the smallest integer divisor such that dividing all elements of the array by this divisor and ro...
The task is to find the smallest integer divisor such that dividing all elements of the array by this divisor and rounding up to the nearest integer yields a sum less than or equal to a given limit.
Iterate through possible divisors starting from 1 up to the maximum element in the array.
For each divisor, calculate the sum of rounded up divisions of array elements and check if it is less than or equal to the limit.
Return...
Tip 1 : Practice DS algo questions.
Tip 2 : Have some projects.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
I appeared for an interview in May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 4 pm. Platform was really great .
Ninja is trapped in a prison and plans to escape through its gate. The gate consists of horizontal and vertical bars spaced one unit apart, creating holes of area 1 * 1 between th...
Find the area of the largest hole in a gate after removing certain bars.
Iterate through the removable horizontal and vertical bars to find the largest hole area.
Keep track of the maximum hole area as bars are removed.
Consider all possible combinations of removed bars to find the largest hole area.
Use dynamic programming or backtracking to efficiently find the solution.
Given an array of integers arr
and an integer limit
, your task is to find the smallest integer divisor such that dividing all elements of the array by this divisor and ro...
The task is to find the smallest integer divisor such that dividing all elements of the array by this divisor and rounding up to the nearest integer yields a sum less than or equal to the given limit.
Iterate through possible divisors starting from 1 up to the maximum element in the array.
For each divisor, calculate the sum of rounded up divisions of array elements.
Return the smallest divisor that satisfies the conditio...
Tip 1 : Practice data structure
Tip 2 : Atleast have one hands on project
Tip 1 : Be honest while adding things in assume
Tip 2 : Add only if you have good skills in particular subject
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 7 days
Round difficulty - Easy
Web Development, Databases
Round duration - 60 minutes
Round difficulty - Medium
This was the final round and was a telephonic interview.
Design a data structure that effectively stores a key-value mapping and performs specific operations in constant time.
Your data stru...
Design a data structure implementing HashMap with constant time operations like INSERT, DELETE, SEARCH, GET, GET_SIZE, IS_EMPTY.
Use a combination of hash table and linked list to achieve constant time operations.
For INSERT and UPDATE, hash the key to get the index and store the (key, value) pair in the linked list at that index.
For DELETE, SEARCH, and GET, hash the key to find the index, then traverse the linked list a...
You are provided with two arbitrary binary trees. Determine if both trees are isomorphic.
Two binary trees are considered isomorphic if one tree can be tr...
Determine if two binary trees are isomorphic by swapping left and right subtrees.
Check if both trees are empty, return 'yes' if they are
Perform the swap operation on any node at any level
Compare the structures of both trees after swapping to determine isomorphism
Tip 1 : Practice Data Structures and Algorithms from websites like leetcode,geeksforgeeks etc.
Tip 2 : Learn one skill — be it web development, android development, or Machine Learning, make some projects on it. Don’t try to learn everything, pick 1 thing, and master it.
Tip 3 : Study computer fundamentals — DBMS, Operating Systems, OOPs, Computer Networks before your interviews.
Tip 1 : Keep it simple and concise.
Tip 2 : Include some personal projects
posted on 17 Jun 2024
Appending an element to an array involves adding a new item to the end of the existing array.
Use the push() method in JavaScript: let arr = ['a', 'b']; arr.push('c'); // arr is now ['a', 'b', 'c']
In Python, use the append() method: arr = ['a', 'b']; arr.append('c'); # arr is now ['a', 'b', 'c']
In Java, use ArrayList: ArrayList<String> arr = new ArrayList<>(Arrays.asList('a', 'b')); arr.add('c'); // arr is n...
posted on 3 Aug 2024
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
A complex SQL query can involve multiple joins, subqueries, and aggregations to extract meaningful data from relational databases.
Use JOINs to combine data from multiple tables, e.g., SELECT * FROM Orders JOIN Customers ON Orders.CustomerID = Customers.CustomerID.
Incorporate GROUP BY to aggregate data, e.g., SELECT COUNT(*), ProductID FROM Orders GROUP BY ProductID.
Utilize subqueries for filtering, e.g., SELECT * FROM ...
I appeared for an interview in Dec 2016.
LRU (Least Recently Used) is a caching algorithm that removes the least recently used item when the cache is full.
LRU uses a combination of a doubly linked list and a hash map.
The doubly linked list keeps track of the order of recently used items.
The hash map allows for efficient lookup of items in the cache.
When a new item is accessed, it is moved to the front of the list.
If the cache is full, the item at the end of t...
Pressing 'k' on Notepad triggers a series of events including key press event, character insertion, and potential text manipulation.
When 'k' is pressed, a key press event is triggered
The key press event is captured by the Notepad application
The character 'k' is inserted at the current cursor position
If any text is selected, it may be replaced by the character 'k'
The cursor position is updated to the next position
If aut...
I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.
Programming assessment tools used to objectively evaluate a candidates programing skills across parameters such as problem solving, coding aptitude and debugging
I value both independent work and teamwork, as each has unique benefits that contribute to successful software development.
Independence: Working independently allows for deep focus and personal accountability, which can lead to innovative solutions. For example, I once developed a feature on my own that improved application performance by 30%.
Team Collaboration: Collaborating with a team fosters diverse ideas and persp...
I applied via Campus Placement
Three question on coding medium to hard level
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
Test - one coding question 1 sql query 20 mcq on cs fundamental
Member Technical Staff
71
salaries
| ₹11.1 L/yr - ₹20.5 L/yr |
Senior Member of Technical Staff
49
salaries
| ₹15.7 L/yr - ₹29 L/yr |
Product Manager
24
salaries
| ₹22 L/yr - ₹38.5 L/yr |
Customer Success Manager
22
salaries
| ₹19 L/yr - ₹28.5 L/yr |
Software Developer
19
salaries
| ₹10.5 L/yr - ₹18.6 L/yr |
Cohesity
Celebal Technologies
NoBrokerHood
Innovaccer