## Construct a Special Triangle from a Given Array

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

Skip to content# Tagged: Beginner

## Construct a Special Triangle from a Given Array

## Goldbach’s Conjecture

## Convert Decimal into Irreducible Fraction

## Clock Angle Problem

## Graph Representation – Adjacency Matrix and Adjacency List

## Towers Of Hanoi

## Find The Missing Duplicate in a Given Array.

## Sort 3 Integers without using if condition OR use only Max() function.

## Euclidean algorithm – Greatest Common Divisor(GCD)

## Delete X Nodes After Y Nodes In a Linked List

## Depth First Search/Traversal in Binary Tree

## Check if Array is Consecutive Integers

## Find intersection between Two Sorted Arrays.

## Given a binary tree, Convert it into its Mirror Tree

## Given a binary tree, Print All the Nodes that don’t have Siblings.

@tutorialhorizon

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

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

What is Graph: G = (V,E) Graph is a collection of nodes or vertices (V) and edges(E) between them. We can traverse these nodes using the edges. These edges might be weighted or non-weighted....

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: – Given an Integer array. Array contains duplicates of all the numbers in array except one number . Find that number. Example : int [] A = { 2,1,3,5,5,3,2,1,6,7,7,8,8}; Output : Missing duplicate...

ObjecÂtive: – Given three integers, sort them without using if condition. Appraoch: Say 3 integers are, a, b, c. Find the maximum of a, b, c using Max() function. multiply all integers by -1....

The greatest common divisor (GCD) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. For example, the...

Objective: Given a Linked List and x and y. Delete x number of nodes after y nodes from the start. Example: ->10->20->30->40->50->60->70->80->90->100->110->120 Deleted 4 Nodes after 5 Nodes ->10->20->30->40->50->100->110->120 Approach: We need two pointers....

Objective: – Given a Binary Search Tree, Do the Depth First Search/Traversal . Appraoch: Approach is quite simple, use Stack. First add the add root to the Stack. Pop out an element from Stack...

Objective: Given a array of unsorted numbers, check if all the numbers in the array are consecutive numbers. Examples: int [] arrA = {21,24,22,26,23,25}; – True (All the integers are consecutive from 21 to...

Objective: Given two sorted arrays, Find intersection point between them. Examples: int[] a = { 1, 2, 3, 6, 8, 10 }; int[] b = { 4, 5, 6, 11, 15, 20 }; Output:...

Objective: Given a binary tree, Convert it into its Mirror Tree Mirror Tree: Mirror Tree of a binary tree is where left and right child of every node of given binary tree is interexchanged....

Objective: Given a binary tree, Print All the Nodes that don’t have siblings. Note: sibling node is the node which has the same parent, so you need to print the nodes who is a...

%d bloggers like this: