leetcode 2689. Extract Kth Character From The Rope Tree - recursion and comments on problem

Показать описание

Follow up at my channel @Code-Yao and corresponding playlists.

Code-Yao

Рекомендации по теме

Комментарии

This code is based on the assumption that:
for a node node.len := len(S[node])
it seems that we could not interpret the above assumption
from the problem statement

class Solution:
def getKthCharacter(self, root: Optional[object], k: int) -> str:
while root.len:
length = max(root.left.len, len(root.left.val)) if root.left else 0
if length >= k:
root = root.left
else:
root = root.right
k -= length
return root.val[k - 1]

codeyao

leetcode 2689. Extract Kth Character From The Rope Tree - recursion and comments on problem

leetcode 2689. Extract Kth Character From The Rope Tree - recursion and comments on problem

Extract Kth Character From The Rope Tree

703. Kth Largest Element in a Stream - Day 23/31 Leetcode May Challenge

2742. Painting the Walls (LeetCode Hard)

Microsoft Interview Question - Find All The Lonely Nodes - Leetcode 1469 - Python

leetcode 2682. Find the Losers of the Circular Game - mod operation and info retrieval using dict

Minimize the Total Price of the Trips - Leetcode 2646 - Python

Binary Tree Tilt | LEETCODE - 563 | Easy solution

2742. Painting the Walls(Weekly Contest 350 )

MLV Prasad - LeetCode SQL [ EASY ] | 2687 | 'BIKES LAST TIME USED' |