BitGo Interview Questions — 10 DSA Problems

9 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked BitGo LeetCode questions for software engineering interviews.

• Check if an Original String Exists Given Two Encoded Strings (HARD) — String, Dynamic Programming
• Gas Station (MEDIUM) — Array, Greedy
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Zigzag Conversion (MEDIUM) — String
• Longest Substring with At Most K Distinct Characters (MEDIUM) — Hash Table, String, Sliding Window
• Bus Routes (HARD) — Array, Hash Table, Breadth-First Search
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Game of Life (MEDIUM) — Array, Matrix, Simulation
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree