โ† Tekion questions
CodingReported in a candidate post, Jul 2021

Maximum Sum Subarray and Kth Smallest Element in BST

Filed under Tekion

The question

Given an array, find the maximum sum subarray. Given a BST, find the kth smallest element in O(log n) time.

No write-up yet. Related questions below have one.

Related Tekion questions

Collected from public candidate posts and coding forums. Updated Nov 2026.