Home
SELF STUDY
BrowsePracticeTestsPlaylistDoubts & solutionsFree live classesOther courses

Basic Data Structures

Quick practice

Question 1 of 5

Consider a program that merges two sorted sequences, in linear time (time proportional to the sum of lengths of the two sequences). Which of the following data structures helps to implement the above procedure without allocating extra space?

A

Queue

B

Arrays

C

Linked List

D

Stack

Concepts

Get unlimited practice with Competitive Programming subscription

pick

Boost your performance with adaptive practice tests

pick

Practice every concept in the syllabus

pick

Compare your speed and accuracy with your peers

pick

Download the app and practice on the go