## Nth positive number whose absolute difference of adjacent digits is at most 1

Given a number N, the task is to find the Nth number which has an absolute difference of 1 between every pair of its adjacent… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Real-time application of Data Structures
- Priority Queue of Vectors in C++ STL with Examples
- Priority queue of pairs in C++ with ordering by first and second element
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Design a Queue data structure to get minimum or maximum in O(1) time
- Important functions of STL Components in C++
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Longest subarray whose elements can be made equal by maximum K increments
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Print all Exponential Levels of a Binary Tree
- Static and Dynamic data structures in Java with Examples
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Append the elements of queue in mirror-inverse order
- Maximum absolute difference between any two level sum in a Binary Tree
- Minimum difference between maximum and minimum value of Array with given Operations
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Minimum possible modifications in the matrix to reach destination
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Different Types of Queues and its Applications
- Print Nth Stepping or Autobiographical number

Given a number N, the task is to find the Nth number which has an absolute difference of 1 between every pair of its adjacent… Read More »

Data structure is a way of storing and organising data efficiently such that the required operations on them can be performed efficiently with respect to… Read More »

Given N cities which are connected using N-1 roads. Between Cities [i, i+1], there exists an edge for all i from 1 to N-1. The… Read More »

Given a number K, the task is to create the Diamond-like structure of Tree which follows these two conditions: First K levels of the tree… Read More »

Given a Binary Tree, the task is to print all the Exponential Levels in the given Binary Tree. An Exponential Level is a level whose… Read More »

Given a Binary Tree and an integer K where the tree has positive and negative nodes, the task is to print the elements of the… Read More »

Given a Complete Binary Tree, the task is to print the elements in the Clockwise traversal order. Clockwise Traversal of a tree is defined as:… Read More »

Given a natural number N, the task is to print the Nth Stepping or Autobiographical number. A number is called stepping number if all adjacent… Read More »

Given a Binary Tree, the task is to print all levels of this tree in Boundary Level order traversal. Boundary Level order traversal: In this… Read More »

Prerequisite: CPU Scheduling in Operating Systems Different Scheduling Algorithms: First Come First Serve CPU Scheduling: Simplest scheduling algorithm that schedules according to arrival times of… Read More »

Given a grid A of size N*M consisting of K cells denoted by values in range [1, K], some blocked cells denoted by -1 and… Read More »

Given an array arr[] and an integer K. The following operations can be performed on any array element: Multiply the array element with K. If… Read More »

Given an integer K and an array arr[] containing N integers, the task is to find the sum and product of K smallest and K… Read More »

Given a non-decreasing array arr[] and an integer K, the task is to remove K elements from the array such that maximum difference between adjacent… Read More »

Given a Binary Tree, the task is to print all prime levels of this tree. Any level of a Binary tree is said to be… Read More »