Four HackerRank OA Questions, Cleared in One Pass

TikTok (ByteDance) 2026 new-grad OA on HackerRank, four questions, cleared all of them in one pass. Q1: Given a string, ignoring case, count how many positions have s[i] != s[i+1]. Just walk through it once. Q2: Simulate addition — for each digit, add the digit's contribution directly into the answer. Straightforward simulation, that's all it takes. Q3: Given a 0/1 array, you need to support two…

Shared by a candidate · reported Mar 2026. Interview formats change; use it as a guide, not a script.