Practice Bloomberg Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Group array elements into disjoint subarrays based on a dynamic equivalence predicate.
Preserve the original relative order of elements within each discovered group.
Manage equivalence classes incrementally without prior knowledge of the underlying rule.

What This Tests

Dynamic partitioning with opaque predicates
Representative tracking for equivalence classes
Incremental data structure management
Time-space tradeoffs in grouping algorithms

Common Patterns

Union Find

Hashing

Greedy

Stdout

-