LeetCode
Question
·
Jan 2022
TikTok OA 2022.1.22
11 upvotes
2,825 views
4 replies
Question Details
Q1: Is possible. Give 2 nodes (a,b), (c,d). Judge whether it\'s possible to reach(c,d) from (a,b). There are only 4 ways to move(a,b)->(a+b,b), (a+a,b),(a,b+a),(a,b+b) Q2: K smallest substring Q3: Tiling with Dominoes Q4\uFF1A Preprocess Date Q5: Shared Interest
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 2022.
It covers the following topics: Strings .
Topics
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)?