Filter interviews by
Program to find the angle between the hands of a clock given the time.
Calculate the angle of the hour hand from 12 o'clock position
Calculate the angle of the minute hand from 12 o'clock position
Calculate the absolute difference between the two angles
If the difference is greater than 180 degrees, subtract it from 360 degrees
Return the absolute value of the difference as the angle between the hands
To find if two linked lists intersect, traverse both lists and compare their tail nodes.
Traverse both linked lists and find their lengths
If the lengths are different, move the longer list's head pointer to the difference in length
Now traverse both lists and compare their nodes until a common node is found
If no common node is found, the lists do not intersect
JOINS are used to combine rows from two or more tables based on a related column between them.
JOINS are used to retrieve data from multiple tables in a single query
There are different types of JOINS - INNER, LEFT, RIGHT, FULL OUTER
JOINS are based on a related column between the tables
Syntax: SELECT * FROM table1 JOIN table2 ON table1.column = table2.column
Combine 4 elements of a sorted array of size 7 and a sorted array of 3 elements to make a sorted array.
Insert the 3 elements of the smaller array into the larger array
Sort the larger array using any sorting algorithm
To check if a string is a palindrome, compare the first and last characters, then move towards the center.
Remove all non-alphanumeric characters and convert to lowercase
Use two pointers, one starting from the beginning and the other from the end
Compare the characters at both pointers, move towards the center until they meet
If all characters match, the string is a palindrome
Strings, Arrays , Hashmaps were asked
Our product follows a microservices architecture, utilizing Docker containers and Kubernetes for scalability and reliability.
Microservices architecture
Utilization of Docker containers
Scalability and reliability through Kubernetes
SQL is a language used to query databases, while DBMS is a software system that manages databases.
SQL is a language used to interact with databases, allowing users to retrieve, update, and manipulate data.
DBMS is a software system that manages databases, providing functionalities like data storage, retrieval, and security.
Examples of SQL include SELECT, INSERT, UPDATE, DELETE statements, while examples of DBMS include
There were 2 questions in coding one with array and in string releated
I applied via Recruitment Consultant and was interviewed before Sep 2020. There was 1 interview round.
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.
I applied via Campus Placement
I applied via Campus Placement
I applied via Campus Placement
Efficient solution to find k closest stars to earth from a list of stars and their distances.
Use a priority queue to store the distances of stars from earth.
Iterate through the list of stars and add their distances to the priority queue.
Pop k elements from the priority queue to get the k closest stars to earth.
based on 1 interview
Interview experience
Freelancer
168
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Freelance Graphic Designer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Writer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Entry Operator
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Upwork
PeoplePerHour
Urban Company
Truelancer