Filter interviews by
Clear (1)
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2020. There were 3 interview rounds.
I have knowledge in multiple programming languages.
Java
Python
C++
JavaScript
I was interviewed in Apr 2021.
posted on 17 May 2022
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Easy
Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored
Given three integers X
, Y
, and Z
, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X
, Y
, and Z
...
Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.
Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.
Calculate the sum of each combination and add them up.
Return the final sum modulo 10^9 + 7.
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....
The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.
Implement a function that takes the number of nodes, edges, source node, and edge weights as input.
Use a topological sorting algorithm to traverse the graph and calculate the longest distances.
Return an array of integers where each element represents the longest distance from the source node to the correspondi
Round duration - 40 minutes
Round difficulty - Easy
Timing - 9:00 AM - 9:40 AM
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
N = 1
Find the smallest number whose factorial has at least N trailing zeros.
Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.
Use binary search to find the smallest number with at least N trailing zeros.
Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
The given linked list is 1 -> 2 -> 3 -&g...
To reverse a singly linked list of integers, return the head of the reversed linked list.
Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.
Keep track of the previous, current, and next nodes while traversing the list.
Update the head of the reversed linked list to be the last element of the original list.
Round duration - 40 minutes
Round difficulty - Easy
Timing - 12:00 Pm to 12:40 PM
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().
Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.
Implement a heap data structure to maintain the priority queue.
Handle different types of queries based on the inp...
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
The first line contains an integer 'T', represen...
The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.
Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve the problem efficiently.
Consider edge cases like empty tree or single node tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1
Round duration - 40 minutes
Round difficulty - Medium
Timing - 6:00 PM - 6:30 PM
Design a system similar to Splitwise and suggest three features for improvement.
Implement a real-time notification system for updates on shared expenses
Integrate a feature for automatic currency conversion for international transactions
Enhance the user interface with data visualization tools for better expense tracking
Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
Conducted on their platform for 120 minutes
To find the diameter of a binary tree, we need to find the longest path between any two nodes in the tree.
Traverse the tree recursively and calculate the height of the left and right subtrees.
Calculate the diameter of the left and right subtrees recursively.
The diameter of the tree is the maximum of the following three values: 1. Diameter of the left subtree 2. Diameter of the right subtree 3. Height of the left sub...
I applied via LinkedIn and was interviewed in Apr 2022. There were 5 interview rounds.
String manipulation problems from geeks for geeks with some medium and hard problems in DSA from leetcode
Graph implementation involves creating nodes and edges to represent data and relationships.
Nodes represent data points and edges represent relationships between them
Graphs can be directed or undirected
Common graph algorithms include BFS, DFS, and Dijkstra's algorithm
String pool is a cache of string literals stored in memory for efficient reuse.
String pool is a part of Java's memory management system.
It stores a collection of unique string literals to save memory.
When a new string is created, it is first checked in the pool and reused if already present.
String pool can be accessed using the intern() method.
Example: String s1 = "Hello"; String s2 = "Hello"; s1 and s2 will point to t
Strings are immutable in Java to ensure thread safety and prevent unintended changes.
Immutable objects are safer to use in multi-threaded environments
String pool optimization is possible because of immutability
StringBuffer and StringBuilder classes are available for mutable string operations
I applied via Campus Placement and was interviewed in Mar 2022. There were 4 interview rounds.
Finding common elements in two sorted linked lists.
Traverse both lists simultaneously using two pointers.
Compare the values of the nodes pointed by the two pointers.
If they are equal, add the value to the result list and move both pointers.
If not, move the pointer pointing to the smaller value.
Repeat until one of the lists is fully traversed.
Finding the Kth element after merging two sorted arrays.
Merge the two sorted arrays into a single array.
Sort the merged array.
Return the Kth element from the merged and sorted array.
OOPS is a programming paradigm based on objects while DBMS is a software system for managing databases.
OOPS focuses on encapsulation, inheritance, and polymorphism
DBMS manages data through CRUD operations and supports ACID properties
Examples of OOPS languages include Java, C++, and Python
Examples of DBMS include MySQL, Oracle, and SQL Server
based on 2 interviews
Interview experience
based on 8 reviews
Rating in categories
Software Engineer
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Development Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
IBM
Microsoft Corporation
Oracle
SAP