Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2689. Extract Kth Character From The Rope Tree
Given a rope implemented as a binary tree where leaves hold characters/strings and internal nodes store the length (weight) of their left subtree, return the k-th character of the full concatenated string by traversing the tree using those weights to decide left vs right. Aim for O(height) time by comparing k to left-subtree weights and adjusting k as you descend.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.