Filter interviews by
I appeared for an interview in May 2025, where I was asked the following questions.
I appeared for an interview in Apr 2025, where I was asked the following questions.
I don’t remember the question
I appeared for an interview in May 2025, where I was asked the following questions.
Question on Linked List
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
Currently, I am working on a cloud-based inventory management system to streamline operations for small businesses.
Developed a user-friendly interface using React for better user experience.
Implemented real-time data synchronization with Firebase to ensure accurate inventory tracking.
Integrated a reporting feature that generates sales and stock reports, helping businesses make informed decisions.
Collaborated with a tea...
From an array of numbers, find the highest sum of non-adjacent numbers. Eg: [4, 1, 1, 5] = 9
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
QUestion to basic coding based on arrays and string
ANother coding question for graph using BFS
I applied via LinkedIn and was interviewed in Jul 2024. There were 2 interview rounds.
Coding question on graph. Given each bus routes, source and destination, find the least number of buses to each from source to target.
Implement a Snake and Ladder game simulation using a board and player movement logic.
Define a board of size 100 with snakes and ladders mapped to specific positions.
Use a random number generator to simulate dice rolls (1-6).
Implement player movement logic based on dice rolls and handle snakes/ladders.
Check for win condition when a player reaches or exceeds position 100.
Consider edge cases like overshooting the final po...
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
Use Depth First Search (DFS) to traverse an undirected graph for various applications like pathfinding and connectivity.
DFS explores as far as possible along each branch before backtracking.
It can be implemented using recursion or a stack.
Example: Finding connected components in a graph.
DFS can be used to detect cycles in an undirected graph.
It is useful for topological sorting in directed graphs.
Top trending discussions
The duration of BitGo interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 22 interview experiences
Difficulty level
Duration
Lead
15
salaries
| ₹50 L/yr - ₹75 L/yr |
Senior Software Engineer
12
salaries
| ₹32 L/yr - ₹58 L/yr |
Data Analyst
9
salaries
| ₹10 L/yr - ₹23 L/yr |
Sdet 2
8
salaries
| ₹40 L/yr - ₹55 L/yr |
Data Scientist
6
salaries
| ₹17 L/yr - ₹28 L/yr |
TCS
Accenture
Wipro
Cognizant