Prefix sum binary search
You're writing a custom vertical layout (a UICollectionViewLayout subclass) where every cell has a different height. layoutAttributesForElements(in rect:) gets called on every scroll, and iterating 20,000 cells each time stutters. Which data structure and algorithm find the visible cell range in O(log n)?
CS fundamentals and algorithmsShort answerExpert
When you apply a new snapshot to UICollectionViewDiffableDataSource, how does it compute …
#collectionview
CS fundamentals and algorithmsShort answerBasics
You're building name search over a list of 10,000 contacts. How do linear search and sort…
#binary-search
CS fundamentals and algorithmsShort answerBasics
Chat messages sit in an array sorted by id ascending. When the user taps a push notificat…
#binary-search
CS fundamentals and algorithmsMultiple choiceBasics
You solved "longest contiguous run of transaction amounts whose sum stays at or under a l…
#prefix-sum