Onsite

Three Rounds from Streaming Top K to Payment Design

SalesforceMember of Technical Staff · Onsite · Aug 2026

Round 1 Find the top K most frequent elements in an infinite data stream. Convert a sorted doubly linked list in place into a balanced binary search tree without creating any new nodes. Round 2 I had to implement merge sort by hand: Implement merge sort from scratch. Explain its recursion tree in detail. I also had to implement operations involving set bits and find all anagrams. Round 3: System…

Shared by a candidate · reported Aug 2026. Interview formats change; use it as a guide, not a script.