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
Interview Questions asked in Google, Microsoft, Amazon
by Dhaval Dave
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
by Dhaval Dave
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
by Dhaval Dave
Set of Numbers are given to you.
convert them to Roman numbers.
Solution is in Hacker Earth style… Read More
by Dhaval Dave
Here We have implemented a Generic Stack Example with Templates in C++ where we can Push any element into stack.
#include <iostream>
#include <vector>
#include <cstdlib>
#include <string>
#include <stdexcept>
using namespace std;… Read More
by Dhaval Dave
Couple of years ago when me and my friends appeared for campus interviews in IITs, NITs and BITs we faced many challenging interview questions like N petrol bunks arranged in a city, Sort Stack … Read More
by Dhaval Dave
Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.
by Dhaval Dave
by Dhaval Dave
by Dhaval Dave
by Dhaval Dave