Generate a finite, but an arbitrarily large binary tree in O(1) time | Medium | jane-street | |
Walking Robot Simulation Problem | Medium | jane-street | |
Efficient Conversion Between Imperial Distance Units Problem | Easy | jane-street | |
Implementing car and cdr Functions for Pair Construction | Medium | jane-street | |
Evaluate Reverse Polish Notation | Medium | amazon
atlassian
facebook
google
linkedin
microsoft
opendoor
oracle
uber
vmware
yandex
zillow
jane-street | |
Squares of a Sorted array Problem | Easy | adobe
amazon
apple
bloomberg
bytedance
ebay
electronic-arts
facebook
google
jane-street
microsoft
nutanix
oracle
paypal
splunk
twitch
uber
vmware | |
Check Currency Arbitrage with Bellman Ford | | jane-street | |