Filter interviews by
Clear (1)
Hacker Rank, 5 questions in total. Topics include operating system, dynamic programming, sql, and so on.
The underlying database of MySQL is InnoDB.
InnoDB is the default storage engine for MySQL.
It provides ACID-compliant transactions.
Supports foreign keys for referential integrity.
InnoDB is designed for high performance and scalability.
Computers connect with each other using IP/TCP through a series of protocols and addressing schemes.
IP (Internet Protocol) assigns a unique address to each device on a network.
TCP (Transmission Control Protocol) manages the transmission of data between devices.
Devices communicate by sending packets of data over the network using IP addresses and port numbers.
Routers and switches help route the packets to their destinat...
Design a search algorithm to find the top k elements in a dataset.
Use a priority queue to efficiently retrieve the top k elements.
Implement a max heap to keep track of the top k elements.
Consider using quickselect algorithm for optimal performance.
Optimize the search algorithm for time complexity O(n log k).
Tiny URL design involves creating a shorter version of a long URL for easier sharing and tracking.
Use a hashing algorithm to generate a unique short code for each long URL
Store the mapping of short code to long URL in a database
Redirect users from short URL to original URL when accessed
I applied via Company Website and was interviewed before Oct 2021. There were 2 interview rounds.
A coding test in hackrank, 120 min, 5 programming puzzles.
Top trending discussions
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I applied via Company Website and was interviewed in Nov 2022. There were 3 interview rounds.
Standard Leetcode Medium question.
I applied via Job Portal and was interviewed in Sep 2024. There was 1 interview round.
Leetcode style, course scheduler
based on 3 interviews
Interview experience
Data Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
SME
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Moderator
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Payroll Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Snapchat
YouTube