practice a little every day, paws crossed ♡
Member of Technical Staff Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 1–5 of 5 results
- SalesforceMediumMember of Technical StaffConvert a Sorted Doubly Linked List to a Balanced BST In Place
Tests in-place pointer manipulation and bottom-up tree construction by converting a sorted doubly linked list into a height-balanced binary search tree in linear time.
Software Engineering FundamentalsOnsitelinked-listbinary-search-treerecursion - SalesforceMediumMember of Technical StaffDesign an Idempotent Payment Processing Platform
Design a resilient payment platform that guarantees zero duplicate charges and safely resolves ambiguous downstream gateway timeouts.
System DesignOnsiteDistributed SystemsPaymentsIdempotency - SalesforceMediumMember of Technical StaffExplain the Recursion Tree of Merge Sort
Explain the merge sort recursion tree from a five-element example through the general recurrence. Derive per-level work, uneven split height, Theta(n log n) time, merge-buffer space, call-stack depth, stability, and empty-input handling.
Software Engineering FundamentalsOnsite - SalesforceMediumMember of Technical StaffImplement Merge Sort and Return a Sorted Array
Tests your ability to implement a classic divide-and-conquer merge sort algorithm from scratch, maintaining stability and achieving O(n log n) time complexity without relying on built-in sorting utilities.
Coding & AlgorithmsOnsitesortingdivide-and-conquerrecursion - SalesforceMediumMember of Technical StaffTrack Top-K Frequent Elements from an Unbounded Stream
Tests the ability to architect a distributed streaming system for continuous top-k frequent element tracking over unbounded data streams, evaluating trade-offs between exact counts and probabilistic heavy-hitter algorithms under scale, state management, and fault-tolerance constraints.
System DesignOnsitesystem-designstreamingtop-k