Filter interviews by
Clear (1)
Live coding on any platform - DSA round
Top trending discussions
A graph traversal algorithm like Depth First Search (DFS) can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically.
Implement a graph where each person is a node and friendships are edges between nodes
Use Depth First Search (DFS) to traverse the graph and check for connections between A and B, and B and C
If both connections exist, then A and C
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
50 questions in 12mins
I was interviewed before Jul 2023.
45 min round. Similar to Leetcode medium level question.
45 min coding round, 2 question asked
Design a system for proximity service
Utilize geolocation data to track user locations
Implement algorithms to calculate proximity between users
Use real-time updates to notify users of nearby contacts
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
Word search II is a problem where you have to find all words from a given list in a 2D board of characters.
Use a trie data structure to efficiently search for words in the board.
Implement a backtracking algorithm to explore all possible paths in the board.
Optimize the search by pruning branches that cannot lead to a valid word.
Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary
Implement a key value store for storing and retrieving data efficiently.
Use a hash table or a balanced tree data structure to store key-value pairs.
Implement functions for inserting, updating, deleting, and retrieving key-value pairs.
Consider implementing features like transactions, concurrency control, and data persistence.
Example: Implement a simple key value store using a hash table in Python.
I applied via Company Website and was interviewed in Dec 2021. There were 4 interview rounds.
Code to find frequency of characters in a given string
Use a hash table to store character frequencies
Iterate through the string and update the hash table accordingly
Print the hash table to display the character frequencies
Code to reverse a linked list
Create three pointers: prev, curr, and next
Initialize prev to null and curr to head
Loop through the list and set next to curr's next node
Set curr's next node to prev
Move prev and curr one node ahead
Return prev as the new head
Code to reverse linked list in size of K
Create a function that takes head of linked list and size K as input
Traverse the linked list in groups of K nodes
Reverse each group of K nodes using iterative or recursive approach
Connect the reversed groups to form the final linked list
Return the new head of the reversed linked list
posted on 24 Jun 2023
Given an simple gaming questions to be developed in JS
Given another UI design in image to be developed
based on 1 interview
Interview experience
Etsy