Level: Junior-Level
Round: Virtual Onsite · Type: Take-home · Difficulty: 6/10 · Duration: 45 min · Interviewer: Very Friendly
Topics: Leadership, Conflict Resolution, Communication, Technical Decisions, Failure & Learning, Arrays, Strings, Linked Lists, Stacks, Queues, Hash Maps, Hash Sets, Trees, Binary Trees, Binary Search Trees, Graphs, Heaps, Priority Queues, Trie, Union Find, Segment Trees, Two Pointers, Sliding Window, Prefix Sum, Binary Search, DFS, BFS, BFS/DFS, Backtracking, Dynamic Programming, Greedy, Divide and Conquer, Bit Manipulation, Topological Sort, Dijkstra, Sorting, Recursion, Matrix
Location: San Francisco Bay Area
Interview date: 2025-12-22
Got offer: False
Usually a take home assessment to build a small scale project in 3-5 days.
The process is handled by a third party. R1: Online Assessment with mcq, leetcode style questions and bash question R2: With HR, basic behavior questions like "How did you handle this conflict", "If in an internship, how did you know when to prioritize studying for a final tomorrow and a deadline for some prod work". Mostly depends on your resume. R3: Take Home Assessment where you have to build a library management system using your preferred language