i
Filter interviews by
I applied via Campus Placement and was interviewed before Jul 2023. There was 1 interview round.
Dutch National Flag algorithm can be used to sort an array of 0,1,2 in O(n) time complexity.
Initialize three pointers - low, mid, high at the start, end, and end of the array respectively.
Iterate through the array and swap elements based on their values with the pointers.
Example: Input array: ['1', '0', '2', '1', '0'], Output array: ['0', '0', '1', '1', '2']
ATM program to retrieve money based on user input using if else statements
Create a function to handle the ATM money retrieval process
Use if else statements to check user input and dispense money accordingly
Handle different scenarios like insufficient funds or invalid input
Example: if(amount <= balance) { dispenseMoney(amount); } else { displayMessage('Insufficient funds'); }
I was interviewed before Jan 2024.
Even odd, prime no. ,greatest all, skip no
Easy aptitude
percentage
family question
Basic java question like prime no ,factorial
I applied via Recruitment Consulltant and was interviewed before May 2022. There were 3 interview rounds.
EPS is earnings per share, income statement shows revenue and expenses, balance sheet shows assets and liabilities, CFS shows cash flow.
EPS is a financial metric that shows how much profit a company has earned per share of its stock
Income statement shows a company's revenue and expenses over a specific period of time
Balance sheet shows a company's assets, liabilities, and equity at a specific point in time
CFS shows how...
Top trending discussions
I applied via Campus Placement
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
Find the K-th largest element in a BST.
Perform reverse in-order traversal of the BST to find the K-th largest element.
Keep track of the count of visited nodes to determine the K-th largest element.
Return -1 if there is no K-th largest element in the BST.
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
Check if the left subtree is balanced
Check if the right subtree is balanced
Calculate the height difference between the left and right subtrees
Return 'True' if all conditions are met, otherwise return 'False'
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.
Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.
Orphan p...
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the window as you iterate through the string.
Return the maximum le
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
Search for integers in a rotated sorted array efficiently.
Use binary search to efficiently search for integers in the rotated sorted array.
Handle the rotation of the array while performing binary search.
Return the index of the integer if found, else return -1.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
Count subarrays with sum divisible by K in an array.
Iterate through the array and keep track of the prefix sum modulo K.
Use a hashmap to store the frequency of each prefix sum modulo K.
For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.
Handle the case when prefix sum itself is divisible by K.
Return the total count of subarrays with sum divisible by K.
Round duration - 50 Minutes
Round difficulty - Medium
In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
Traverse the BST to find the closest value greater than or equal to the key.
Compare the key with the current node value and update the ceil value accordingly.
Recursively move to the left or right subtree based on the comparison.
Return the ceil value once the traversal is complete.
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...
Design a constant time data structure to maintain mappings between keys and values with various operations.
Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.
Keep track of the number of key-value pairs for GET_SIZE operation.
Check if the hash table is empty for IS_EMPTY operation.
Return true or false for SEARCH operation based on key existence.
Return the value associated...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Jan 2021.
Round duration - 90 Minutes
Round difficulty - Hard
I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.
Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).
The first line contains ...
The task is to find the Kth digit from the right in the number obtained from N raised to the power M.
Iterate through the digits of N^M from right to left
Keep track of the position of the current digit
Return the digit at position K from the right
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindrome with the smallest start index
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
I was interviewed before Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.
Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.
Keep track of the visited shops to avoid revisiting them.
If a shop has an Arr value of 0, it is impossible to reach the final shop.
Return -1 if the final shop cannot be reached.
Given two strings, S
and X
, your task is to find the smallest substring in S
that contains all the characters present in X
.
S = "abdd", X = "bd"
Find the smallest substring in S that contains all characters in X.
Use a sliding window approach to find the smallest window in S containing all characters of X.
Maintain a hashmap to keep track of characters in X and their frequencies in the current window.
Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.
Return the smallest window found.
Example: S = 'abd
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Return paths in alphabetical order as a list of strings.
Round duration - 60 minutes
Round difficulty - Easy
Questions based on OOPS were asked in this round.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in C++
They are used in inheritance to achieve runtime polymorphism
Virtual functions are declared in a base class and can be overridden in derived classes
They are called based on the type of object bei...
Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.
Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.
Polymor...
Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I got to participate in a robotics competition at IIT
Designed and built a robot from scratch
Programmed the robot to complete tasks autonomously
Competed against other teams from different colleges
Learned valuable skills in engineering and teamwork
I chose IIT for its reputation and opportunities. No regrets. The environment is competitive and challenging.
IIT has a strong reputation for producing successful graduates
I was attracted to the opportunities for research and innovation
The academic environment is highly competitive and challenging
I have no regrets about my decision to attend IIT
A portfolio is a collection of investments. Risk can be measured through standard deviation, beta, or value at risk.
A portfolio is a combination of different investments such as stocks, bonds, and mutual funds.
The purpose of a portfolio is to diversify investments and reduce risk.
Risk can be measured through standard deviation, which measures the volatility of returns.
Beta measures the sensitivity of a portfolio to mar...
Beta is a measure of a stock's volatility. Value at risk is a statistical measure of potential losses. Formula for beta is Covariance(Stock, Market) / Variance(Market).
Beta measures a stock's sensitivity to market movements.
Value at risk is the maximum potential loss that an investment portfolio may suffer within a given time frame.
Beta formula is calculated by dividing the covariance of the stock and market returns by...
Covariance measures the relationship between two variables. It measures sensitivity by indicating the direction of the relationship.
Covariance is a statistical measure that shows how two variables are related to each other.
It measures the direction of the relationship between two variables.
A positive covariance indicates that the two variables move in the same direction.
A negative covariance indicates that the two vari...
WACC is the weighted average cost of capital. To value a company, one can use various methods such as DCF, comparables, or precedent transactions. A method to decide on project undertaking is NPV analysis.
WACC is the average cost of all the capital a company has raised
To value a company, one can use DCF, comparables, or precedent transactions
DCF involves projecting future cash flows and discounting them back to present...
I am impressed with the company's reputation and growth potential, and I believe my skills and experience align well with the job requirements.
I have researched the company and am impressed with its reputation and growth potential
I believe my skills and experience align well with the job requirements
I am excited about the opportunity to work with a talented team and contribute to the company's success
I have the necessary skills, experience, and passion to excel in this role.
I have a proven track record of success in similar roles.
I am a quick learner and adaptable to new situations.
I am passionate about this industry and eager to contribute to its growth.
I have excellent communication and teamwork skills.
I am committed to delivering high-quality work and exceeding expectations.
I would prioritize completing my current assignment and then discuss the transfer with my supervisor to ensure a smooth transition.
I would communicate with my supervisor to understand the urgency of the transfer
I would prioritize completing my current assignment to the best of my ability
I would discuss the transfer with my supervisor to ensure a smooth transition
I would try to complete as much work as possible before l...
A batsman can score a maximum of 264 runs in an ODI.
The maximum number of runs a batsman can score in an ODI is limited by the number of balls bowled and the number of boundaries hit.
The maximum number of balls bowled in an ODI is 300, assuming no extras are bowled.
If a batsman hits a boundary off every ball they face, they can score a maximum of 240 runs.
If a batsman hits sixes off every ball they face, they can score...
Solving two jug problems to obtain a specified amount of water using differently sized jugs.
Understand the capacity of each jug
Determine the amount of water needed
Fill one jug with water and pour it into the other jug
Repeat until the desired amount is reached
Use the remaining water in the larger jug to measure the remaining amount needed
Consider the possibility of multiple solutions
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
Software Developer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Financial Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Urban Company
Swiggy
Zomato
Ola Cabs