## Iterative Tower of Hanoi

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

Skip to content
## 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

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

## Delete a node in Doubly Linked List

## Binary search on Linked List

Introduction 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...
## Multiplication of two polynomials using Linked List

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 Linked Lists might...
## Recursive selection sort for singly linked list | Swapping node links

Introduction 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...
## Merge Sort for Doubly Linked List

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

Arithmetic Expression An Arithmetic expression is a finite combination of arithmetic operands, operators and brackets. The common way of representing an arithmetic expression is by using infix notation. In infix...

Arithmetic Expression An Arithmetic expression is a finite combination of arithmetic operands, operators and brackets. The common way of representing an arithmetic expression is by using infix notation. In infix...

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

https://www.prepbytes.com/data-structures-in-java Problem statement Given an expression containing only ‘(‘, ’)’, ’{‘, ‘}’, ‘[‘, ‘]’ , check whether the expression is balanced or not. An expression is balanced if each opening...

Problem statement Given the daily price of a stock for n days, find the stock’s span of the n days. Stock span of the stock’s price of the current day...

Introduction 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...

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 Linked Lists might...

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

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 Linked Lists might...

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 Linked Lists might...

Introduction 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...

Introduction 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...

Problem statement In this problem, we are given a Doubly Linked List (root node) and are asked to sort it using the merge sort algorithm. For example Input: Output: Problem...