LeetCode
Question
·
Feb 2024
TikTok OA Very Hard SDE Longest Concave Subsequence
8 upvotes
1,218 views
3 replies
Question Details
Longest Concave Subsequence: A concave subsequence is a subsequence where the first and last elements are greater than all other elements in between. For example, [100, 0, 25, 11, 200] is...
Full Details
🔒
Unlock all ByteDance questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a bytedance interview for a swe role during the oa round reported in 2024.
It covers the following topics: Arrays, Backtracking, Dynamic Programming .
Difficulty rating: Hard
More ByteDance Interview Questions
1p3a
bytedance tiktok software engineer tech phone screens: two attempts and feedback
1p3a
bytedance onsite interview experience for software engineer
1p3a
TikTok CodeSignal OA March High-Frequency Questions Summary
1p3a
ByteDance USDS SRE Full Interview Process and Experience
Reddit
How to prepare for ByteDance frontend interview (HTML, CSS, JavaScript, React.js)?