Filter interviews by
I appeared for an interview in Jun 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Explain Higher Order Functions in javascript.
What is the difference between tag and tag?
Given an array of strings ARRSTR[]
of size N
, and a character C
, your task is to sort the ARRSTR[]
array according to a new alphabetical order that starts with the ...
Sort an array of strings based on a new alphabetical order starting with a given character.
Iterate through the array of strings and compare each string based on the new alphabetical order starting with the given character.
Implement a custom sorting function that considers the new alphabetical order.
Return the sorted array of strings.
Round duration - 60 minutes
Round difficulty - Medium
List the different types of relationships in SQL.
What is an Alias in SQL?
You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any e...
Sort elements of ARR to match relative order in BRR, append missing elements at the end in sorted order.
Create a hashmap to store the index of elements in BRR for quick lookup.
Sort elements in ARR based on their index in BRR, append missing elements at the end.
Handle edge cases like empty arrays or duplicate elements in ARR and BRR.
Round duration - 60 Minutes
Round difficulty - Easy
You are provided with a string STR
representing a column title in an Excel Sheet. Your task is to determine the corresponding column number.
A typica...
Convert Excel sheet column title to corresponding column number.
Iterate through the characters in the string from right to left, starting with a result of 0.
For each character, calculate its value by subtracting 'A' and adding 1, then multiply by 26 raised to the power of its position from the right.
Add up all the calculated values to get the final column number.
Example: For input 'AB', A=1, B=2, so result = (1 * 26^1)
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : Consistent
Tip 2 : Keep practicing
Tip 3 : Keep on giving interview
Tip 1 : Mention All Skills
Tip 2 : One page resume enough
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
Use dynamic programming to keep track of maximum stolen money at each house.
Consider two cases: either rob the current house and skip the next, or skip the current house.
Handle circular arrangement by considering the first and last houses separately.
Example: For arr[] = {2, 3, 2}, the output is 3. Rob...
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .
You are provided with two linked lists, L1
and L2
, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
Traverse both linked lists simultaneously to find common elements
Create a new linked list to store the intersecting elements
Ensure the final linked list is sorted in ascending order
Handle cases where there are no common elements between the lists
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
Find the Kth largest element in a given list of numbers.
Sort the array in descending order.
Return the Kth element from the sorted array.
Handle multiple test cases efficiently.
Round duration - 50 Minutes
Round difficulty - Easy
This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
Use a combination of HashMap and ArrayList to achieve constant time operations.
For insert operation, add the element to the ArrayList and store its index in the HashMap.
For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accesse
Round duration - 45 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Design a Railway Reservation System
Create a database to store train schedules, seat availability, and passenger information
Implement a user interface for users to search for trains, book tickets, and view their reservations
Include features like seat selection, payment processing, and ticket confirmation
Handle scenarios like waitlisting, cancellations, and refunds
Ensure data security and privacy of passenger information
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
Java code is compiled into bytecode, which can run on any platform with a JVM.
JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.
The JVM ...
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 appeared for an interview before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
Find the minimum cost to buy a specific weight of oranges using given cost list.
Iterate through the cost list and find the minimum cost to achieve the desired weight
Keep track of the minimum cost while considering available packet weights
Return -1 if it is not possible to buy exactly W kg of oranges
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result if true.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will burn faster than the other.
Measure the time it takes for the faster burning wire to completely burn.
Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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 appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .
Given an array 'ARR'
consisting of N
integers, along with two integers, 'SUM'
and 'MAXVAL'
, you need to determine the minimum number of integers to be added to t...
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
Iterate through the array and calculate the current sum.
Determine the difference between the target sum and the current sum.
Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
Given an array of integers NUMS
consisting of N
integers and an integer K
, determine the maximum sum of an increasing subsequence with exactly K
elements.
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.
For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.
Update the dynamic programming table with the maximum sum found...
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
Traverse the binary tree level by level and check if all levels are completely filled except the last one.
Ensure all nodes at the last level are positioned at the leftmost side.
Use level order traversal to check for completeness of the binary tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
Given an array arr
of N
non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
The first line of inp...
Check if an array of integers consists of consecutive numbers.
Iterate through the array and check if the absolute difference between consecutive elements is 1.
Sort the array and check if the elements are consecutive.
Use a set to store the elements and check if the size of the set is equal to the length of the array.
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
Divide the range of numbers (1-100) among the threads to avoid duplication.
Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.
Consider using a shared data structure like a queue to coordinate the threads.
Implement a mechanism to signal the threads when to start and stop printing.
Views in a database management system provide data security, simplify complex queries, and improve performance.
Enhanced security by restricting access to certain columns or rows
Simplify complex queries by pre-defining joins and filters
Reduce redundancy by storing commonly used queries as views
Improve performance by storing pre-processed data in views
Allow for data abstraction, making it easier to work with complex data
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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 appeared for an interview before Apr 2022.
System design on the frontned application
I applied via Campus Placement and was interviewed in Oct 2023. There were 2 interview rounds.
2 coding questions from dsa. one quest was from trees ds
60m, Data structure and algo
Find the smallest palindrome and lowest common ancestor in a given tree
To find the smallest palindrome, iterate through the string and check if it is a palindrome. Return the smallest one found.
To find the lowest common ancestor in a tree, use a recursive approach to traverse the tree and find the common ancestor of two nodes.
I appeared for an interview in Mar 2021.
Round duration - 120 minutes
Round difficulty - Medium
This was the online round held at Hackerearth. All students who met the eligibility criteria were shared link for the online test on hackerearth.
Given a string str
of size N
, your task is to recursively remove consecutive duplicates from this string.
T (number of test cases)
N (length of the ...
Recursively remove consecutive duplicates from a given string.
Use recursion to check for consecutive duplicates in the string.
If current character is same as next character, skip the next character.
Repeat the process until no consecutive duplicates are found.
Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes present at the deepest level of this binary tree. If there are no such nodes, ...
Calculate the sum of leaf nodes at the deepest level of a binary tree.
Traverse the binary tree to find the deepest level of leaf nodes.
Sum the leaf nodes at the deepest level.
Handle null nodes represented by -1.
Ensure the sum fits within a 32-bit integer.
Round duration - 60 minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems.There were 2 interviewers. We first dicussed the approach the time complexity and proper code covering all cases.
Determine if a permutation of a given string S
can form a palindrome.
string S = "aab"
"True"
The permutation "aba" o...
Check if a permutation of a string can form a palindrome.
Create a frequency map of characters in the string.
Count the number of characters with odd frequencies.
If there is at most one character with odd frequency, return true.
Otherwise, return false.
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
The first line contains an in...
Check if a given word is present in a sentence as a complete word.
Split the sentence into words using spaces as delimiter.
Check if the given word matches any of the words in the sentence.
Ensure that the word is not just a substring of another word in the sentence.
Round duration - 30 mintues
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
Tip 1 : Have atleast one internship/project in your domain...Will help you to gain exposure
Tip 2 : Do good practice of advanced data structures like Tries,graphs etc.
Tip 3 : Be good in your communication
Tip 1 : Keep your resume up to date and mention three or four good level projects which will give a good impression to the interviewer
Tip 2 : You should be well aware and knowledgeable about all the things that are mentioned in your resume.
I appeared for an interview in Aug 2021.
Round duration - 90 minutes
Round difficulty - Medium
This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Implement a function to encode a text message using run-length encoding.
Iterate through the message and count consecutive characters
Append the character and its count to the encoded message
Handle edge cases like single characters or empty message
Given an array/list ARR
of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...
Find the minimum number of increments needed to make all elements of the array distinct by increasing any element by 1 in each operation.
Iterate through the array and keep track of the frequency of each element.
For each element with frequency greater than 1, increment it until it becomes distinct.
Return the total number of operations needed to make all elements distinct.
Round duration - 50 Minutes
Round difficulty - Easy
This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .
Given a string STR
, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
STR = ...
Return all possible non-empty subsequences with distinct characters from a given string.
Use a recursive approach to generate all possible subsequences with distinct characters.
Keep track of the characters used in each subsequence to ensure uniqueness.
Return the generated subsequences as an array of strings.
In this intellectual game, Ninja is provided with a string of balanced parentheses called STR
. The aim is to calculate the score based on specific game rules. If Nin...
Calculate the score of a string of balanced parentheses based on specific game rules.
Iterate through the string and keep track of the score based on the rules provided
Use a stack to keep track of the scores of valid parentheses expressions
For each '()', increment the score by 1; for '(x)', double the score of x
Return the final computed score for the string
Demand paging is a memory management technique where pages are loaded into memory only when they are needed.
Pages are loaded into memory on demand, rather than all at once.
Helps in reducing the amount of physical memory needed.
Improves overall system performance by allowing more processes to run simultaneously.
Commonly used in modern operating systems like Linux and Windows.
Example: When a program is executed, only the...
Round duration - 40 Minutes
Round difficulty - Medium
I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .
Given the POSTORDER
and PREORDER
traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...
Construct a binary tree from given POSTORDER and PREORDER traversals.
Use the first element in PREORDER as the root node
Find the root node in POSTORDER to divide the tree into left and right subtrees
Recursively construct left and right subtrees using the divided traversals
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
Find the minimum cost to buy a specific weight of oranges given the cost of different weight packets.
Iterate through the list of costs and find the minimum cost to achieve the desired weight.
Keep track of the minimum cost for each weight up to the desired weight.
Handle cases where a specific weight packet is unavailable by setting the cost to infinity.
Return the minimum cost for the desired weight, or -1 if it is not p
Static polymorphism is achieved at compile time through method overloading and overriding. Dynamic polymorphism is achieved at runtime through method overriding.
Static polymorphism is also known as compile-time polymorphism.
Dynamic polymorphism is also known as runtime polymorphism.
Static polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Dynamic poly...
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
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.
Senior Software Engineer
1.1k
salaries
| ₹11.9 L/yr - ₹39 L/yr |
Software Engineer
1.1k
salaries
| ₹7.8 L/yr - ₹30.4 L/yr |
Senior Analyst
262
salaries
| ₹7 L/yr - ₹25 L/yr |
Analyst
217
salaries
| ₹4 L/yr - ₹17 L/yr |
Lead Software Engineer
170
salaries
| ₹18 L/yr - ₹60 L/yr |
Reliance Retail
Walmart
Landmark Group
Reliance Trends