Problem Statement Sort an unsorted array arr of length n in a waveform. An array is said to be in wave form if it satisfies the following conditions: Example Example Explanation Input: arr = [7, 7, 11, 3, 4, 5, 15] Output: [4, 3, 7, 5, 11, 7, 15] or any other array in wave form. Explanation: In the ...
Problem Statement You are given a string as an input. The task is to print all the possible subsequence of a string in any order. Note: A subsequence is a string derived from the input string by deleting zero or more elements from the input string without changing the order of the remaining characters. Example: str=”abcd” Example Let us ...
Searching in data structures involves finding the location of a specific element or value within a collection. It is a fundamental operation that can greatly influence data handling efficiency in applications like databases and search engines. There are various types of searching in data structure, the most common being Linear Search and Binary Search. Types of ...
Problem Statement Given an integer n, our task is to write a function that returns the count of trailing zeros in n!. Here n! is the factorial of a number n which is the product of all numbers in the range $[1, n]$. Example : Explanation Example – 1 :When $n = 3$, Factorial of ...
Problem Statement Given a 2D matrix having $n$ rows and $m$ number of columns. Print a transpose of the given matrix. The transpose of a matrix is a new matrix that is obtained by exchanging the rows and columns. Example Let us have a look at some examples on how to transpose a matrix. Example1 ...
Problem Statement You have a collection of non-negative values, representing available options, and a non-negative target value. Your task is to determine whether there exists a subset within the collection whose sum equals the given target value. Example Example1: Example2: Approach 1: Using Recursion We can approach the Subset Sum Problem recursively by considering ...
In this article, we are going to learn about the static data structure. Before getting started with the static data structure let us get a short overview of what is a data structure and which data structure is of type static. Data Structure: A computer can contain an abundant amount of data, so a Data Structures. helps in organizing those ...
Problem Statement We are given an array consisting of only 0s, 1s, and 2s. Our task is to write a program to sort the given array without using inbuilt functions. Example Example Explanation Since we already know that an array is a linear data structure that contains data elements of the same data type at ...
Given a sorted rotated array arr[] having N number of elements and a target element K. We are supposed to find the 0 (zero) based index (indexing starts from 0 rather than 1) of the target element if it exists and return -1 if it doesn’t. Let us assume for now that duplicates don’t exist, ...
A linked list is a sequential collection of data elements connected via links. The data element of a linked list is known as a node which contains two parts namely- the data part and the pointer. For sorting a linked list, we can use the insertion sort-based algorithm as well as the merge sort algorithm. The insertion sort-based algorithm uses ...