TitleDifficultyCompaniesVideos
Count Pairs with Given Sum and XOREasyjane-street
Generate a finite, but an arbitrarily large binary tree in O(1) timeMediumjane-street
Walking Robot SimulationMediumjane-street
Efficient Conversion Between Imperial Distance UnitsEasyjane-street
Implementing car and cdr Functions for Pair ConstructionMediumjane-street
Evaluate Reverse Polish NotationMediumamazon atlassian facebook google jane-street linkedin microsoft opendoor oracle uber vmware yandex zillow
Squares of a Sorted arrayEasyadobe amazon apple bloomberg bytedance ebay electronic-arts facebook google jane-street microsoft nutanix oracle paypal splunk twitch uber vmware
Currency Exchange Problem as Shortest PathMediumjane-street