Find Kth Bracket in Nth Term Sequence
Filed under Knowlarity
The question
Given a bracket sequence defined recursively as An = An-1 + An-2 with base cases A1=(), A2=(), find the k-th bracket in the n-th term in optimal time complexity (O(k)), and code it.
No write-up yet. Related questions below have one.
Related Knowlarity questions
Collected from public candidate posts and coding forums. Updated Nov 2026.