Dell Technologies On-Campus OA Questions | HackerRank | Software Engineer Intern | 2026

Question · Posted Jun 2026

Problem 1 - Count Binary Substrings Problem Statement Given a binary string s, count the number of substrings that contain equal consecutive groups of 0s and 1s, where all 0s and all 1s appear in contiguous blocks (no alternation inside the same block structure). A valid substring must consist of exactly two consecutive groups such that: the first group contains only one character and the second group contains the opposite character, and both groups have equal length. Constraints Constraint Value ...

The full answer & interview discussion are available to premium members.

Log in Create a free account