Loading the journal
Loading the journal
Index-based Conditional TraversalSolved Oct 30, 2025
Problem
Given a string S, separate the characters into two new strings: one containing characters from even indices (0, 2, 4, dots) and one containing characters from odd indices (1, 3, 5, dots).
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code