i
Zeta
Filter interviews by
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Find the longest substring without repeating characters in an array of strings.
Iterate through each string in the array
Use a sliding window approach to track the longest substring without repeating characters
Update the longest substring as you iterate through each character in the string
Design a board game with different cell types and roll the dice to move on from cell to cell
Create a board with various types of cells such as start, finish, bonus, penalty, teleport, etc.
Players roll a dice to determine how many cells they move forward
Each cell type has a different effect on the player's progress or score
Top trending discussions
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed before May 2021. There were 4 interview rounds.
posted on 19 Oct 2021
I applied via Naukri.com and was interviewed before Oct 2020. There were 3 interview rounds.
I will use a combination of messaging systems, data replication, and versioning to ensure consistency and availability.
Use messaging systems like Kafka or RabbitMQ to ensure reliable communication between systems
Implement data replication to ensure that data is available on multiple nodes
Use versioning to ensure that all nodes are working with the same data
Implement conflict resolution strategies to handle conflicts th...
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Flip-flops and latches are sequential logic circuits used to store and manipulate binary data.
Flip-flops are edge-triggered devices, while latches are level-sensitive devices.
Flip-flops have separate clock and data inputs, while latches have a single input for both clock and data.
Flip-flops are used in synchronous circuits, while latches are used in asynchronous circuits.
Flip-flops are more complex and require more cir...
posted on 8 Dec 2022
Core Java , DS and Algo
Shortest path algorithm finds the shortest path between two nodes in a graph.
Dijkstra's algorithm is a popular shortest path algorithm that uses a priority queue to find the shortest path in a weighted graph.
A* algorithm is another popular shortest path algorithm that uses heuristics to guide the search towards the goal node.
Bellman-Ford algorithm is used for finding the shortest path in a graph with negative edge weig
posted on 17 Jun 2024
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
posted on 19 Jun 2024
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Start of The Loop in LinkedList.
Length of Loop in LinkedList
API Contract for Notification sending via SMS and Email
posted on 21 Jun 2024
I applied via Recruitment Consulltant
Find the minimum element in an array of strings
Iterate through the array and compare each element to find the minimum
Use built-in functions like Math.min() or sort() to find the minimum
Handle edge cases like empty array or array with only one element
Reverse a linked list by changing the next pointers of each node
Iterate through the linked list and change the next pointers to reverse the list
Use three pointers - prev, current, and next to keep track of nodes
Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
posted on 26 Aug 2024
I appeared for an interview before Aug 2023.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer II
86
salaries
| ₹18 L/yr - ₹50 L/yr |
Senior Software Engineer
50
salaries
| ₹30 L/yr - ₹64 L/yr |
Program Manager
46
salaries
| ₹19.2 L/yr - ₹53.8 L/yr |
Product Manager
42
salaries
| ₹21.5 L/yr - ₹45 L/yr |
Project Manager
40
salaries
| ₹9 L/yr - ₹26.1 L/yr |
Paytm
Fractal Analytics
Subex
Kiya.ai