## Delete consecutive same words in a sequence

Problem statement Given an array of strings, if two consecutive strings are the same they will destroy each other. Your task is to find the number of remaining strings from...

Skip to content
## Delete consecutive same words in a sequence

## Delete consecutive same words in a sequence

## Delete consecutive same words in a sequence

Problem statement Given an array of strings, if two consecutive strings are the same they will destroy each other. Your task is to find the number of remaining strings from...
## Data Structures in Java | Array | Linked List | Stack

## Data Structures in C++ | Array | Linked List | Stack

## Check if an Array is Stack Sortable

## Count Subarrays where Second Highest lies before Highest

## Sort an array using stacks

## Delete Array Elements Which Are Smaller Than Next Or Become Smaller

## Building Heap from Array

## Number of NGEs to the Right

## Array implementation of queue simple

## Kth Smallest Element In An Unsorted Array Using Priority Queue

## Circular Queue Set 1 Introduction Array Implementation

## Difference Between Array, Queue and Stack

## How to check if a given array represents a Binary Heap?

## Array Representation of a Binary Heap

## Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?

## Find Maximum

## Find the Missing

## Unique Array

## Array Max

Problem statement Given an array of strings, if two consecutive strings are the same they will destroy each other. Your task is to find the number of remaining strings from...

Problem statement Given an array of strings, if two consecutive strings are the same they will destroy each other. Your task is to find the number of remaining strings from...

Introduction: Data structures in Java are an essential aspect of Computer Science. There are different types of data structures that help us store the data in different ways in the...

What are Data structures? Data structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it...

Problem Statement You will be given an array A of integers containing N elements. All the elements inside the array are unique and in the range of 1 to N,...

Problem Statement You will be given an array of N distinct elements. The minimum value of N is 2. In every subarray of the given array, you have to find...

Problem statement Given an array of integers of size N , sort it in increasing order using a stack. Example : Sample input : 4 2 3 1 5 Sample...

Problem statement Given an array of integers of size n . You have to delete every element which is smaller than the next element or become smaller than the next...

Problem Statement: You are given an array of N elements. The task is to build a Binary Heap from the given array, either Max Heap or Min Heap. Quick Facts:...

Problem Statement You will be given an array of N integers. You will also be given an Integer Q denoting the number of queries. Then, you will have Q queries...

Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be...

Problem Statement: The problem statement is straightforward as we have an array of size n and we have to find the kth smallest element in an unsorted array using priority...

Circular queue: Circular queue is a linear data structure which follows the FIFO(First in first out) property. In this, the last element is connected to the first element to make...

Array: An Array is a collection of elements which are stored in a contiguous memory. The idea is simple i.e. to store the multiple elements together. Due to which we...

Problem Statement: Given an array of integers, how We have to check if the given array represents a binary max-heap or not. First, we’ll see what is Binary heaps and...

What is Binary Heap? A Binary Heap is a complete binary tree that follows a heap ordering property. The representation is done as: Parent Node: (i-1)/2 Left Child: (2i) +...

Why is Quick Sort preferred for Arrays? One of the main reasons for efficiency in quick sort is locality of reference, which makes it easy for the computer system to...

CONCEPTS USED: Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A of N positive integers. The task is to find the maximum of j - i such that A[j]...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N-1 elements, with elements from 1 to N present into it. Find a single missing element....

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements containing all elements from 0 to N-1, your task is to find the maximum length...

CONCEPTS USED: Suffix Sum Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers and an integer K, the task is to find the maximum sum taking every...