JobsJob TrackerJob alerts

Visible Alpha ยท 15 questions

All 15Coding 14Low-Level Design 1
  • Detect and Remove Loop in a Linked ListCoding
  • Sort an array of 0s, 1s and 2sCoding
  • Three way partitioningCoding
  • Maximum stolen value from housesCoding
  • Bottom View of a Binary TreeCoding
  • Sorted Level Order TraversalCoding
  • Sum of Series N TermsCoding
  • Sliding Window MaximumCoding
  • Merge Sorted Arrays with Vacant SpacesCoding
  • Minimum Insertions for PalindromeCoding
  • Maximum Value Path in MatrixCoding
  • Find Extra String in ArraysCoding
  • Implement Queue OperationsCoding
  • Optimal Airport LocationLow-Level Design
  • Implement XOR GateCoding
โ† Visible Alpha questions
  1. Interview questions
  2. Visible Alpha
  3. Merge Sorted Arrays with Vacant Spaces
Coding

Merge Sorted Arrays with Vacant Spaces

Filed under Visible Alpha

The question

Given two sorted arrays of size N and M (where N > M) and the first array has exactly M vacant spaces, fill the elements of the second array into the first array in O(N) time.

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

Related Visible Alpha questions

  • Three way partitioning
  • Sorted Level Order Traversal
  • Sum of Series N Terms
  • Minimum Insertions for Palindrome
  • Maximum Value Path in Matrix
โ† Sliding Window MaximumMinimum Insertions for Palindrome โ†’

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