We are given a Binary Tree, Print the Right view of Binary tree,
Right view of binary tree is : List of all nodes which are visible If you look at Binary tree from right … Read More
problem
Find Nearest Minimum number in left side in O(n)
Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.
Examples:
Input: arr[] = {1, 6, 4, 10, 2, 5}
Output: {-1, 1, … Read More Find position of the only set bit
Calculate price of parking from parking start end time prices
Given a price rules of parking and start time and end time of parking. Calculate the price
(Below is the table of price rule) Come up with data structure you can store these price rules
Apriori algorithm C Code Data Mining
Apriori Algorithm is an algorithm for data mining of frequent data set and association rule learning over transactional databases. It identifies the frequent individual items in the database for example, collections of items bought by … Read More
Client Server C program
Today we are going to show you to write simple C level Client – Server Networking & Communication program. This Program and methods are base to create any communication software like whatsapp, fb chat or … Read More
Convert number to words java
Write a code to Convert number to words . example ip 15 op : fifteen
ip : 1234 op : one thousand and thirty four
Algorithm : When we detect a number at any place … Read More
FizzBuzz Solution C C++
Write a program that prints the numbers from 1 to 100. But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples … Read More
Maximum path sum between two leaves
If a binary tree is given, how to find Maximum path sum between two leaves of binary tree.
| All should be numbers The maximum sum path may or may not go through root. For example, |
Convert Decimal to Roman numbers / Romanizer HackerEarth Code
Set of Numbers are given to you.
convert them to Roman numbers.
Solution is in Hacker Earth style… Read More