Given a binary tree, Print All the Nodes that don’t have Siblings.
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...
Tagged: Beginner
Check if Two BST’s are Identical
Objective: Given Two binary Search Trees, Check if both are identical. Input: Two binary Search Trees Approach:
Find all common numbers in given three sorted arrays.
Objective: Given three sorted(ascending order) arrays of integers, find out all the common elements in them. Input: Three sorted arrays. Output: All the common elements. Examples : Array A = {1,2,3,4,5,6,7,8,9,10}; Array B =...
Minimum number that cannot be formed by any subset of an array
Objective: Given a sorted array of positive integers, find out the smallest integer which cannot be represented as the sum of any subset of the array Input: A Sorted Array Output: The smallest number...
Find the Size of the Binary Tree
Objective: Given a Binary tree, Find the size of the tree. Note : Size of the tree is number of nodes in the tree Input: A Binary Tree. Output: Size of the tree. Example...
Find the Maximum Depth OR Height of a Binary Tree
Objective: Given a binary tree, find the height of it Input: A Binary Tree Output: Height of a binary tree Example: Approach:
Binary Search Tree Complete Implementation.
Binary Tree : A data structure in which we have nodes containing data and two references to other nodes, one on the left and one on the right. Binary Tree consist of Nodes Nodes...
Reverse a Linked List – Part 2
This post is the extension of our earlier post Reverse a linked list. Here We have provided the better recursive solution in which we start reversing the list from the end. Objective: Reverse the...
Delete a Node in the Middle of a linked list, Given only access to that Node
Objective: Write a program to Delete a Node in the Middle of a linked list, Given only access to that Node Example: Original List : ->1->2->8->3->7->0->4 After Deleting the mid node (say 7) :...
Find the n’th Node from the end of a given Linked List
Objective: Given a linked list and integer ‘n’, write an algorithm to find the nth node from the end in the Linked List. Example: Original List : ->1->2->8->3->7->0->4 Output : 3rd Element from the...
Remove Duplicates from an Unsorted Linked list
Objective: Write a program to remove the duplicates from an unsorted linked list Example: Input Linked List : 1->2->2->4->3->3->2 Output : 1->2->4->3 Input: An unsorted linked list Output: Linked list with no duplicates. Approach:...
Check if one string is Rotation of another string
Objective: Write an algorithm to check if one string is Rotation of another string. This question has been asked in the Amazon interview. Example: Input Strings : ‘sumitjain’ and ‘tjainsumi’ Output : true Input...
String Compression using count of repeated characters – Run Length Encoding
Objective: Write an algorithm to compress the given string by using the count of repeated characters and if new compressed string length is not smaller than the original string then return the original string....
Find Whether Two Strings are Permutation of each other
Objective: Given Two Strings, check whether one string is permutation of other Input: Two Strings Output: True or false based on whether strings are permutation of other or not. Example: “sumit” and “tiums” are...
Reverse a Linked List
Objective: Reverse the given linked list. Input: A Linked List Output: Reversed Linked List Example: Input : ->30->25->20->15->10->5 Reversed : ->5->10->15->20->25->30 NOTE : Click Reverse a Linked List – Part 2 to see the...