## Binary Min-Max Heap Implementation

A binary heap is a heap data structure created using a binary tree. binary tree has two rules – Binary Heap has to be a complete binary tree at all levels except the last...

Skip to content# Category: Position

## Binary Min-Max Heap Implementation

## Find numbers which are palindrome in both their decimal and octal Representations

## Find All the Well Ordered Permutations of a Given String.

## Find Increasing Triplet Sub-sequence

## Construct a Special Triangle from a Given Array

## Colorful Numbers

## Print All the Subsets of a Given Set (Power Set)

## Goldbach’s Conjecture

## Convert Decimal into Irreducible Fraction

## Clock Angle Problem

## Print All Combinations of subset of size K from Given Array

## Track the Maximum Element in a Stack.

## Print All Possible Valid Combinations Of Parenthesis of Given ‘N’

## Towers Of Hanoi

## Generate All Strings of n bits.

@tutorialhorizon

A binary heap is a heap data structure created using a binary tree. binary tree has two rules – Binary Heap has to be a complete binary tree at all levels except the last...

Objective: Given a range of integers, find all the numbers which are palindrome when they are represented in Decimal Value( base 10) and in Octal value(base 8). Example : Number : 373 (Decimal) and...

Objective: Write an algorithm to Print All the Well Ordered Permutations of a Given String. What is Well Ordered String: When all the alphabets in a string occur in the increasing order irrespective of...

Objective: Given an integer array A[1..n], find an instance of i,j,k where 0 < i < j < k <= n and A[i] < A[j] < A[k]. Example : int arrA[] = { 10,...

Objective: Given an array of integers such that first level will print all the elements in the array and from then at each level number of elements will be one less than the previous...

Objective: Given a number, find out whether its colorful or not. Colorful Number: When in a given number, product of every digit of a sub-sequence are different. That number is called Colorful Number. See...

Objective: Given a set of numbers, print all the posssible subsets of it including empty set. Power Set: In mathematics, PowerSet of any given set S, PS(S) is set of all subsets of S...

Goldbach’s conjecture – Every even integer greater than 2 can be represented as the sum of two primes numbers. Example: Given Number : 200 Prime Numbers are 3 197 Prime Numbers are 7 193...

Objective: Given a decimal number, convert it into irreducible fraction. Irreducible Fraction : An irreducible fraction is a fraction in which the numerator and denominator are integers that have no other common divisors than...

Objective: Find the Angle between hour hand and minute hand at the given time. Example: Time : 12:45 Input : hour = 12, Minute = 45 Output : 112.5 Time : 3:30 Input :...

Objective: Given an array of integers of size N, print all the subsets of size k. (k<=N) Example: Generate all subsets of a fixed size k of a given set [1,2,3…n]. e.g, if n=5...

Objective: In a Stack, keep track of maximum value in it. It might be the top element in the stack but once it is poped out, the maximum value should be from the rest...

ObjecÂtive: – Given “n”, generate all valid parenthesis strings of length “2n”. Example: Given n=2 Output: (()) ()() Approach:

The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The objective of the puzzle...

ObjecÂtive: – Generate All Strings of n bits, consider A[0..n-1] is an array of size n. Example : n = 3 Output: [0, 0, 0] [1, 0, 0] [0, 1, 0] [1, 1, 0]...

%d bloggers like this: