Filter interviews by
Clear (1)
Standard dsa questions, easy to medium
I applied via Company Website and was interviewed in Dec 2021. There were 3 interview rounds.
LRU caching is a technique to store frequently used data in cache memory to improve performance.
LRU stands for Least Recently Used.
It removes the least recently used item from the cache when the cache is full.
It uses a doubly linked list and a hash map to implement the cache.
When an item is accessed, it is moved to the front of the list.
When the cache is full, the item at the end of the list is removed.
Example: Java Li...
Producer-consumer problem involves synchronization between threads to avoid race conditions.
Producer produces data and adds it to a shared buffer
Consumer consumes data from the shared buffer
Synchronization is required to avoid race conditions
Code example: https://www.geeksforgeeks.org/producer-consumer-solution-using-threads-in-java/
To check if a tree is a BST or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Recursively check if the left and right subtrees are also BSTs.
Reverse a single linked list.
Iterate through the list and change the direction of the pointers
Keep track of the previous, current and next nodes
Set the head of the list to the last node after reversing
Print all anagrams of same type in same line from array of Strings
Create a HashMap with sorted string as key and list of anagrams as value
Iterate through array and add each string to corresponding list in HashMap
Print all values in HashMap
Java 8 introduced lambda expressions, functional interfaces, streams, and default methods.
Lambda expressions allow functional programming in Java.
Functional interfaces are interfaces with a single abstract method.
Streams provide a way to process collections of data in a functional way.
Default methods allow interfaces to have implementation.
Date and Time API improvements.
Nashorn JavaScript engine added.
Top trending discussions
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
posted on 24 Oct 2024
Count the number of islands in a given grid of '1's and '0's.
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.
Increment the island count for each new island encountered.
Consider edge cases like grid boundaries and handling visited cells.
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
Hard test dsa question practice more leetcode
I applied via Naukri.com and was interviewed in Jan 2023. There were 3 interview rounds.
Aptitude test was first round. it was hard level
Program on string, oops , exception handling
posted on 13 Mar 2024
I was interviewed before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf
based on 1 interview
Interview experience
based on 7 reviews
Rating in categories
Solution Engineer
109
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
LogiNext Solutions
Shiprocket Private Limited
Shadowfax Technologies
Delhivery