Implement the following functions of stack data structure using standard operations of queue, push(x) –> Push an element x to the stack pop() –> Removes the element on top of stack top() –> Return the element on top of stack empty() –> Return whether the stack is empty Examples Input: …
In reversing a queue using recursion problem we have given a queue, write a recursive algorithm to reverse the queue using recursion. Examples Input 10 -> 9 -> 3 -> 11 -> 5 Output 5 -> 11 -> 3 -> 9 -> 10 Input 1 -> 2 -> 3 -> …
In averages of levels in binary tree problem we have given a binary tree, print the averages of all the nodes of every level in the tree. Example Input: Output: {10.0, 25.0, 45.0, 70.0} Explanation: First Level : Average = (10) / 1 = 10.0 Second Level : Average = …
In queue using a stack problem, we have to implement the following functions of a queue using the standard functions of stack data structure, Enqueue: Add an element to the end of the queue Dequeue: Remove an element from the start of the queue Example Input: Enqueue(5) Enqueue(11) Enqueue(39) Dequeue() …
Ankur and Rishabh are two friends and want to buy some fruits from the market. They both have a list of their favourite fruit represented by strings. Your task is to help them find out their common favourite fruit with the minimum index sum. If there is a tie in …
In Reversing a Queue problem we have given a queue, write an algorithm to reverse the queue. Examples Input queue = 10 -> 8 -> 4 -> 23 Output queue = 23->4->8->10 Input queue = 11 -> 98 -> 31 -> 42 -> 73 -> 6 Output queue = 6 …
Given the root of a binary search tree and two nodes n1 and n2, find the LCA(Lowest Common Ancestor) of the nodes in a given binary search tree. Example Naive Approach for Lowest Common Ancestor in Binary Search Tree Find the LCA(n1, n2) using the optimal approach to find LCA …
You are given an array of integers. The problem statement says that you have to find out the most frequent element present in an array. If there are multiple values that occurs the maximum number of times, then we have to print any of them. Example Input [1, 4,5,3,1,4,16] Output …
Given an array A of N elements. The task is to find the greatest number S which is present in the array such that it is the product of two elements of a given array (S cannot be included in pair. Also, pair must be from different indices). If there …