Filter interviews by
I applied via LinkedIn and was interviewed in Oct 2021. There were 5 interview rounds.
Binary tree fin the no of leaf node
System design for Netflix
Use microservices architecture
Implement a distributed caching system
Utilize content delivery networks (CDNs)
Implement recommendation algorithms
Ensure high availability and fault tolerance
Implement user authentication and authorization
Handle large-scale data storage and processing
Implement efficient search functionality
HLD design refers to high-level design, which involves creating an architectural blueprint for a software system.
HLD design focuses on the overall structure and components of a system.
It includes defining the system's modules, interfaces, and interactions.
HLD design helps in understanding the system's functionality and how different components work together.
It provides a roadmap for the development process and helps in...
I applied via Company Website and was interviewed in Dec 2021. There were 4 interview rounds.
LinkedList is a linear data structure where each element is a separate object with a pointer to the next element.
LinkedList is a collection of nodes that contain data and a reference to the next node.
It allows dynamic memory allocation and efficient insertion/deletion of elements.
Traversal in LinkedList is slower than arrays as it requires sequential access.
Examples include Singly LinkedList, Doubly LinkedList, and Cir
Stack is a data structure that follows LIFO (Last In First Out) principle. Queue is a data structure that follows FIFO (First In First Out) principle.
Stack is like a stack of plates where the last plate added is the first one to be removed
Push and pop operations are used to add and remove elements from the stack
Examples of stack include browser history, undo-redo operations
Queue is like a queue of people waiting in lin...
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.
Use dynamic programming to keep track of the longest increasing subsequence length for each element.
Return the maximum length found as the result.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Various SQL queries related to data manipulation and retrieval were asked during the interview.
Basic SELECT queries to retrieve data from a single table
JOIN queries to retrieve data from multiple tables based on a common column
Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data
Subqueries to retrieve data based on the result of another query
UPDATE queries to modify existing data in a table
DELE...
Round duration - 60 Minutes
Round difficulty - Medium
Given a string STR
of size N
and an integer M
representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...
Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.
Iterate through the string and distribute characters to rows based on zig-zag pattern
Concatenate the characters in each row to get the final result
Handle edge cases like when number of rows is 1 or equal to the length of the string
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if the string is empty or has only one character, return the string
Example: Input: 'aaabcc', Output: 'abc'
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
The first and only line of input ...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters in the input string by using a set to store unique permutations.
Round duration - 60 Minutes
Round difficulty - Medium
Design an e-commerce website similar to Flipkart or Amazon.
Implement user-friendly interface for easy navigation
Include search functionality with filters for products
Incorporate secure payment gateway for transactions
Provide personalized recommendations based on user behavior
Include customer reviews and ratings for products
Implement order tracking and delivery status updates
Offer various payment options like credit/deb
Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.
Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy
I appeared for an interview before Sep 2020.
Round duration - 120 Minutes
Round difficulty - Easy
The round was conducted in day around 3PM.
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the results of subproblems.
Check if the sum of the array is even before attempting to partition it.
Iterate through the array and update the 2D array based on the sum of subsets.
Return true if a subset with half the sum is found, false ot
Round duration - 30 Minutes
Round difficulty - Easy
The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.
Given a string STR
, your task is to remove spaces from STR
and convert it to Pascal case format. The function should return the modified STR
.
In Pascal case, words are con...
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
Iterate through each character in the string
If the character is a space, skip it
If the character is not a space and the previous character is a space or it is the first character, capitalize it
SQL query to retrieve the Nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the Nth highest salary
Consider handling cases where there might be ties for the Nth highest salary
Round duration - 30 Minutes
Round difficulty - Easy
This round was conducted 15mins after 1st round.
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N'.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Remove the node at the calculated position.
Handle edge cases like removing the head or tail of the list.
Update the pointers accordingly after removal.
Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers
Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)
I appeared for an interview before Jan 2021.
Round duration - 50 Minutes
Round difficulty - Medium
It was the screening round he asked me 2 questions
First one is easy and other one is medium type
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Find all pairs of elements in an array that add up to a given target.
Iterate through the array and store each element in a hashmap along with its index.
For each element, check if the target minus the element exists in the hashmap.
If found, print the pair of elements. If not found, print (-1, -1).
Given a binary tree with 'N' nodes numbered from 1 to 'N', your task is to print all the root-to-leaf paths of the binary tree.
The first line of the input con...
Given a binary tree, print all root-to-leaf paths in order.
Traverse the binary tree from root to leaf nodes, keeping track of the path nodes.
Use depth-first search (DFS) to explore all possible paths.
Return each path as a string of nodes separated by spaces.
Handle cases where nodes have NULL values by skipping them in the path.
Ensure the order of nodes in each path is maintained.
Round duration - 45 Minutes
Round difficulty - Easy
This is the first round in the loop interviews. Are you familiar with Javascript. Why do we use js. How do you use js to change the value of a textbox.
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
Validate if a binary tree is a Binary Search Tree (BST) based on given properties.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Verify if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Iterate through the tree in level order form to validate the BST properties.
Given a list of integers pre[]
of size n
, representing the preorder traversal of a special binary tree where each node has 0 or 2 children, and a boolean array isLea...
Construct a binary tree from preorder traversal and leaf node information.
Create a binary tree using preorder traversal and leaf node information
Use recursion to build the tree
Handle both leaf and non-leaf nodes appropriately
Round duration - 45 minutes
Round difficulty - Easy
It was the team fit round
Round duration - 45 Minutes
Round difficulty - Medium
4tn round in the loop, he asked me to design a game. He focused both on backend and frontend.
..
Given an array ARR
of size N
, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...
Find the minimum number of arrows needed to burst all balloons by shooting arrows from left to right.
Sort the array in ascending order to make it easier to determine the minimum number of arrows needed.
Iterate through the sorted array and count the number of times the height decreases.
The count of height decreases plus 1 gives the minimum number of arrows needed to burst all balloons.
Round duration - 45 Minutes
Round difficulty - Medium
Another problem solving round
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
Identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Check if the sum of the triplet equals the specified number.
Print the valid triplets or return -1 if no triplet exists.
Tip 1 : clear your basics in ds algo
Tip 2 : problem solving is must to Crack coding interview
Tip 3 : solve leetcode problem as much as you can
Tip 1 : it should be short as possible
Tip 2 : you must have mentioned your past experience in chronological order with descriptions
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
Program to reverse a string in minimum iteration
Use two pointers, one at the start and one at the end of the string
Swap the characters at the two pointers and move the pointers towards each other
Repeat until the pointers meet in the middle of the string
I applied via Naukri.com and was interviewed in Apr 2021. There were 4 interview rounds.
Calculate the number of children and grandchildren
Count the number of direct children of a person
Count the number of grandchildren of a person
Use recursion to count all descendants
Consider only living descendants
Exclude step-children and adopted children
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
Partition even and odd numbers in an array
Iterate through the array and check if each number is even or odd
Create two separate arrays for even and odd numbers
Combine the two arrays to get the final partitioned array
Find leaders in an array of strings
Leaders are elements that are greater than all elements to their right
Traverse array from right to left and keep track of maximum element
Add maximum element to result if it is a leader
based on 1 review
Rating in categories
Member Technical Staff
529
salaries
| ₹12 L/yr - ₹44.8 L/yr |
Senior Member of Technical Staff
513
salaries
| ₹24 L/yr - ₹76.2 L/yr |
Technical Support Engineer
389
salaries
| ₹6.3 L/yr - ₹21 L/yr |
Technical Staff Member 3
254
salaries
| ₹18 L/yr - ₹60 L/yr |
Business Analyst
232
salaries
| ₹4.8 L/yr - ₹19 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer