Filter interviews by
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 ...
I applied via Recruitment Consulltant and was interviewed before Aug 2023. There were 2 interview rounds.
The current project follows a microservices architecture with Docker containers for scalability and flexibility.
Microservices architecture is used to break down the application into smaller, independent services that can be developed, deployed, and scaled independently.
Docker containers are utilized for packaging the application and its dependencies into a standardized unit for easy deployment and management.
Service di...
Basic coding questions
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 27 Sep 2024
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
To find the next highest number, sort the numbers in ascending order and find the number immediately greater than the given number.
Sort the numbers in ascending order
Find the number immediately greater than the given number
Return the next highest number
posted on 9 Oct 2024
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
posted on 30 Jul 2024
var is function scoped, let is block scoped, const is block scoped and cannot be reassigned.
var is function scoped, let is block scoped, const is block scoped and cannot be reassigned
var can be redeclared and updated, let can be updated but not redeclared, const cannot be redeclared or updated
Example: var x = 10; let y = 20; const z = 30;
Closure is a function that captures the variables from its surrounding scope, even after the surrounding function has finished executing.
Closure allows a function to access and manipulate variables from its outer scope.
It maintains a reference to its outer scope, even after the outer function has returned.
Closure is commonly used in event handlers and callbacks.
Rxjs operators are used for handling asynchronous operations in reactive programming.
Map operator: transforms the items emitted by an Observable
Filter operator: emits only those items from an Observable that pass a specified condition
Merge operator: combines multiple Observables into one by merging their emissions
SwitchMap operator: switches to a new Observable each time it is emitted
DebounceTime operator: emits a valu...
Change detection strategy in Angular is a mechanism used to detect changes in the application state and update the view accordingly.
Angular uses Zone.js for change detection by default
Change detection can be triggered manually using ChangeDetectorRef
Optimizing change detection using OnPush strategy
Promise in Node.js is an object representing the eventual completion or failure of an asynchronous operation.
Used to handle asynchronous operations in a more readable and manageable way
Can be in one of three states: pending, fulfilled, or rejected
Can be chained together to handle multiple asynchronous operations sequentially
Example: fetching data from a database using a promise-based API
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