## 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

## Count natural numbers whose all permutation are greater than that number

## Find Maximum Sum Possible Equal Sum of Three Stacks

## Program for Tower of Hanoi

## Reverse a String using a Stack

## Print Ancestors of a Given Binary Tree Node without Recursion

## DBMS Interview Questions | Set 2 | Top 10 Theory Questions

## How To Delete In Doubly Linked List In C

## DBMS Interview Questions

## Top 10 Most Frequent DBMS Interview Questions

## Iterative Tower of Hanoi

## Print Next Greater number of Q queries

## Next Greater Frequency Element

## Evaluation of Postfix Expression

## Arithmetic Expression Evaluation

## Next Greater Element

## Check for Balanced Parentheses in an Expression

## How to Solve Stock Span Problem?

## C program to Reverse a Linked List

## LinkedList remove() Method in Java

## ConcurrentLinkedQueue in Java With Examples

## How To Iterate LinkedList in Java

## Convert a given Binary Tree To Doubly Linked List | Set 3

## Deletion in Circular Linked List

## C program for performing Bubble sort on Linked List

## How to Delete a Node in Doubly Linked List

## Binary search on Linked List

## Multiplication of Two Polynomials using Linked List

## Recursive selection sort for singly linked list | Swapping node links

## Merge Sort for Doubly Linked List

Get free ebooK with 50 must do coding Question for Product Based Companies solved

Fill the details & get ebook over email

Thank You!

We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

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 a number n, you have to find the count of all such numbers that satisfies the following condition: For any number x, all the permutations of x...

Problem Statement You are given three stacks, you need to find the maximum sum possible of the three stacks. You are only allowed to remove the top of the stack....

Problem statement In the Tower of Hanoi problem you are given three rods (“Source”, “Destination”, “Auxiliary”) and n disks. Initially, all the disks are stacked on the source rod in...

Problem Statement You are given a string, and your task is to reverse the string using a stack data structure. Input: String. Output: Reversed string. Test cases: Input: “Prepbytes” Output:...

Problem statement You are given a binary tree and a key node. Your task is to print all the ancestors of the given key node. Input: Root of the binary...

DBMS stands for Database management System. DBMS is a software which is used to manage databases. It is used to insert, delete, update and retrieve data from the database by...

In this article, we will discuss the deletion in a doubly linked list in c. If you would like to ace the data structures and algorithms easily, then you are...

A database is an organized and systematic collection of data, which is stored electronically on a computer. We can add, update, delete or retrieve data from the database. A database...

DBMS is a database management software that provides an interface to perform various operations like creating new databases, adding data, updating data, deleting data, retrieving data, etc. DBMS also provides...

The Tower of Hanoi puzzle has fascinated mathematicians and puzzle enthusiasts alike for centuries with its elegant simplicity and complex nature. Originally formulated by the French mathematician Édouard Lucas in...

Problem statement You are given an integer array of size n and q queries. Your task is to find the next greater element for each query. Each query consists of...

Problem statement Given an array, consisting of n elements, find the next greater frequency element of each element. The next greater frequency element of any element is the first element...

Evaluating postfix expressions, also known as Reverse Polish Notation (RPN), is a fundamental concept in computer science and mathematics. Unlike the more familiar infix notation, where operators are placed between...

Arithmetic expression evaluation is the process of computing the value of a mathematical expression containing arithmetic operators, such as addition, subtraction, multiplication, and division, along with parentheses and operands. Before...

Problem statement Given an array, consisting of n elements, find the next greater element of each element. The next greater element of any element is the first larger element to...

In computer science, balanced parentheses are a common requirement for many programming languages and applications. Balanced parentheses refer to an expression in which all opening and closing parentheses are properly...

What is Stock Span Problem: Stock span problem is a commercial problem where we have a series of N prices on the daily basis. And you need to calculate the...

The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a huge...

Basically in this article we will see how the remove method works in linked list. Remove method returns true if an object passed as a parameter is removed from the...

Class Declaration [TABS_R id=5250] Here, E is the data type of the elements which will be stored in the queue. ConcurrentLinkedQueue class in java extends AbstractQueue interface and implements Queue...

Introduction One of the most crucial data structures to learn while preparing for interviews is the linked list. In a coding interview, having a thorough understanding of LinkedList might be...

Converting a binary tree to a doubly linked list is a common problem in data structures, often asked in coding interviews and competitive programming. The goal is to transform the...

A circular linked list is a variation of the traditional linked list where the last node points back to the first node, creating a circular structure. Deletion in a circular...

A linked list has been provided, and bubble sort must be used to order it. When using the bubble sorting method, neighboring components that are in the wrong order are...

In this article, we will explore the process of deleting a node in a doubly linked list. We will delve into the fundamentals of doubly linked lists, understanding the structure...

Introduction This article aims to explore an efficient method of performing binary search on linked list. Binary search is a searching algorithm specifically designed for sorted data, where the target...

To perform polynomial multiplication in C, we can represent each polynomial as a linked list of nodes, each with a coefficient and an exponent. The exponent represents the degree. The...

This blog consists of what is selection sort, dry run for performing selection sort, algorithm and implementation of recursive selection sort in linked list. Let’s discuss recursive selection sort in...

Merge sort is a popular and efficient sorting algorithm known for its divide-and-conquer approach. It divides the input array into smaller subarrays, sorts them individually, and then merges the sorted...