1p3a Question · Oct 2025

BitGo Software Engineer Onsite Interview Experience

SWE Onsite

Question Details

Online Assessment 1. Shortest Path: Algorithm to find the shortest path between a specific source and target. 2. Anagrams: Solve a problem involving anagram detection or manipulation. **Ro

Full Details

Online Assessment 1. Shortest Path: Algorithm to find the shortest path between a specific source and target. 2. Anagrams: Solve a problem involving anagram detection or manipulation. Round 1: Data Structures & Algorithms 1. Top K Talkative Persons: Parse a meeting transcript to identify the top K most talkative participants. * Constraint: The candidate must define the input format. * Solution: Utilize a heap data structure. 2. Min Stack: Implement the standard "Min Stack" problem (designing a stack that supports push, pop, top, and retrieving the minimum element in constant time). Round 2: Low-Level Design (LLD) * Problem: Design a notification service backend. * Tech Stack: Node.js (Express) with JavaScript or TypeScript is required. * API Requirements: Implement endpoints to create a notification (POST), retrieve a single notification, and retrieve all notifications with filtering capabilities. * Solution Approach: Implement Factory and Strategy design patterns. Store data in-memory rather than persisting to a database. Round 3: High-Level Design (HLD) * Problem: Design a system to manage multiple cryptocurrency wallets. * Requirements: * User authentication. * Wallet creation supporting specific crypto assets (e.g., Bitcoin, ETH, SOL). * Functionality to deposit funds into a wallet. * Functionality to withdraw funds from a wallet. Round 4: Hiring Manager * Focus: Behavioral assessment covering current work responsibilities and reasons for seeking a new position. Verdict: Hired

Free preview. Unlock all questions →

Topics

Strings Graphs Heap Stack Queue Networking Oop Bit Manipulation