Palindrome Ancestor Path Queries
Uber question: Given a tree of up to 10^5 lowercase letters and node queries, count ancestors where the sequence has at most one odd frequency.
Check more interview questions and experiences about Uber
Uber question: Given a tree of up to 10^5 lowercase letters and node queries, count ancestors where the sequence has at most one odd frequency.
Check more interview questions and experiences about Uber
Please log in to view interview question details