Filter interviews by
Leetcode medium problem.
Leetcode medium and test cases.
Design a distributed key-value store system
Use consistent hashing to distribute data across nodes
Implement replication for fault tolerance
Use a gossip protocol for node communication
Consider data partitioning and sharding for scalability
Implement a distributed consensus algorithm like Raft or Paxos for consistency
I applied via Company Website and was interviewed in Aug 2022. There were 4 interview rounds.
Three easy level leetcode questions
Top trending discussions
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
I appeared for an interview in Jun 2017.
HTML, PHP, and CSS are programming languages used for creating and designing websites.
HTML (Hypertext Markup Language) is used for creating the structure and content of web pages.
PHP (Hypertext Preprocessor) is a server-side scripting language used for creating dynamic web pages.
CSS (Cascading Style Sheets) is used for styling and formatting the layout of web pages.
Example: HTML is used to create headings, paragraphs, ...
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
Worst organization
Lack of communication and transparency
Inefficient management and decision-making
Toxic work culture and lack of employee support
Poorly defined goals and objectives
Lack of career growth opportunities
posted on 13 Feb 2024
posted on 8 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.
Program to sort a linked list
Traverse the linked list and compare adjacent nodes
Use a temporary node to swap nodes
Repeat until the list is sorted
posted on 25 Jun 2024
I applied via Instahyre and was interviewed before Jun 2023. There were 3 interview rounds.
Two problem solving questions from leetcode. It was basically easy to medium.
A movie booking system allows users to browse movies, select showtimes, choose seats, and make payments online.
Users can search for movies by title, genre, or location.
Show available showtimes and theaters for selected movie.
Select seats and view seating layout for chosen showtime.
Provide payment options and confirm booking with email or SMS notification.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
38
salaries
| ₹12 L/yr - ₹48.4 L/yr |
Software Developer
8
salaries
| ₹20 L/yr - ₹28 L/yr |
Senior Software Engineer
7
salaries
| ₹23 L/yr - ₹42 L/yr |
Software Engineer2
5
salaries
| ₹20 L/yr - ₹34 L/yr |
SDE-2
4
salaries
| ₹20.1 L/yr - ₹32 L/yr |
Duck Creek Technologies
FinThrive
Mobileum
AgreeYa Solutions