JobsJob TrackerJob alerts

Housing.com ยท 12 questions

All 12Coding 11System Design 1
  • Determine repetition element with least space complexityCoding
  • Root to node path sum equals given numberCoding
  • Count buildings that can see the beachCoding
  • Contiguous subsequences with equal 0s and 1s in bit streamCoding
  • Find all valid words from input string using dictionary functionCoding
  • Longest Palindromic substringCoding
  • Longest substring with no repeating charactersCoding
  • Minimum number of jumps to reach the endCoding
  • All root to leaf paths with sum kCoding
  • Apple tree selection problemCoding
  • LCA of n-ary treeCoding
  • Web crawler storage and searchSystem Design
โ† Housing.com questions
  1. Interview questions
  2. Housing.com
  3. Contiguous subsequences with equal 0s and 1s in bit stream
Coding

Contiguous subsequences with equal 0s and 1s in bit stream

Filed under Housing.com

The question

Given a stream of bits consisting of 1s and 0s, find the contiguous subsequences where the number of 0s equals the number of 1s.

No write-up yet. Related questions below have one.

Related Housing.com questions

  • Determine repetition element with least space complexity
  • Root to node path sum equals given number
  • Count buildings that can see the beach
  • Find all valid words from input string using dictionary function
  • Longest substring with no repeating characters
โ† Count buildings that can see the beachFind all valid words from input string using dictionary function โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.