BITGO online assesment - SDE3
Summary
I participated in an online assessment for an SDE3 role at BITGO, which involved solving two distinct coding challenges.
Full Experience
-
Count Anagram You’re given a single string of space‑separated words. Some words may be exact duplicates, and others may be anagrams of each other. After removing exact duplicates, count how many words are “extra” members of any anagram group.
Input: "aa aa odg dog gdo" Dedup’d words: ["aa", "odg", "dog", "gdo"] Anagram groups: "aa" → group size 1 → contributes 0 "odg"/"dog"/"gdo" → group size 3 → contributes 2 Output: 2
-
Rotate & Concatenate Array Problem: Given an array of non‑negative integers arr of length 𝑛 the first element k = arr[0] tells you how many positions to left‑rotate the entire array. After rotating, write out each element in order and parse the concatenated string as one integer. Input arr = [2, 3, 4, 1, 6, 10] k = 2 → rotated = [4,1,6,10,2,3] → "4161023" → 4161023
arr = [3,2,1,6] k = 3 → rotated = [6,3,2,1] → "6321" → 6321
Interview Questions (2)
You’re given a single string of space‑separated words. Some words may be exact duplicates, and others may be anagrams of each other. After removing exact duplicates, count how many words are “extra” members of any anagram group.
Input: "aa aa odg dog gdo"
Dedup’d words: ["aa", "odg", "dog", "gdo"]
Anagram groups:
"aa" → group size 1 → contributes 0
"odg"/"dog"/"gdo" → group size 3 → contributes 2
Output: 2
Given an array of non‑negative integers arr of length 𝑛 the first element k = arr[0] tells you how many positions to left‑rotate the entire array. After rotating, write out each element in order and parse the concatenated string as one integer. Input arr = [2, 3, 4, 1, 6, 10] k = 2 → rotated = [4,1,6,10,2,3] → "4161023" → 4161023
arr = [3,2,1,6]
k = 3 → rotated = [6,3,2,1] → "6321" → 6321