K nearest places
You have tens of thousands of places with an id and coordinates (latitude, longitude). Given the user's current location, design a function that finds the 10 nearest places and returns their center coordinate. Which algorithm and data structure do you use, and what's the complexity?
CS fundamentals and algorithmsShort answerBasics
You have a list of posts for a feed and need to reorder them so that no two posts by the …
#heap
Memory and ARCMultiple choiceIntro
Which statement about the stack and the heap is correct?
#heap
Memory and ARCShort answerAdvanced
What actually happens in memory when a closure captures an outside variable? Using the ou…
#heap
SwiftMultiple choiceBasics
What does this code print? …
#map