CodingReported in a candidate post, Jul 2021
Search in Sorted Rotated Array and Convert BST to Doubly Linked List
Filed under Tekion
The question
Given a sorted rotated array and a target, find if the target is present in O(log N) time. Given a BST, convert it into a sorted doubly linked list and return the head pointer.
No write-up yet. Related questions below have one.
Related Tekion questions
Collected from public candidate posts and coding forums. Updated Nov 2026.