🚀 15-Aug-2020

Author: sureshmangs

array/floor_of_num_in_sorted_array_binary_search.cpp

@@ -49,7 +49,6 @@ int getFloor(long long a[], int n, int x){
         mid=l+(h-l)/2;
         if(a[mid]==x){
             return mid;
-            h=mid-1;
         }
        else  if(a[mid]<x){
            res=mid;  // possible result

array/kth_smallest_num_max_heap.cpp

@@ -1,4 +1,4 @@
-/8
+/*
 Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that all array elements are distinct.
 
 Example:

stack/min_stack_O(1).cpp

@@ -1,3 +1,38 @@
+/*
+Design a data-structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. Your task is to complete all the functions, using stack data-Structure.
+
+Input Format:
+The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two lines. The first line of input contains an integer n denoting the number of integers in a sequence. In the second line are n space separated integers of the stack.
+
+Output Format:
+For each testcase, in a new line, print the minimum integer from the stack.
+
+Your Task:
+Since this is a function problem, you don't need to take inputs. You just have to complete 5 functions, push() which takes an integer x as input and pushes it into the stack; pop() which pops out the topmost element from the stack; isEmpty() which returns true/false depending upon whether the stack is empty or not; isFull() which takes the size of the stack as input and returns true/false depending upon whether the stack is full or not (depending upon the given size); getMin() which returns the minimum element of the stack.
+
+Expected Time Complexity: O(1) for all the 5 functions.
+Expected Auxiliary Space: O(1) for all the 5 functions.
+
+Constraints:
+1 <= T <= 100
+1 <= N <= 100
+
+Example:
+Input:
+1
+5
+18 19 29 15 16
+Output:
+15
+*/
+
+
+
+
+
+
+
+
 #include<iostream>
 #include<stack>
 using namespace std;

stack/min_stack_extra_space.cpp

@@ -1,3 +1,43 @@
+/*
+Design a data-structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. Your task is to complete all the functions, using stack data-Structure.
+
+Input Format:
+The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two lines. The first line of input contains an integer n denoting the number of integers in a sequence. In the second line are n space separated integers of the stack.
+
+Output Format:
+For each testcase, in a new line, print the minimum integer from the stack.
+
+Your Task:
+Since this is a function problem, you don't need to take inputs. You just have to complete 5 functions, push() which takes an integer x as input and pushes it into the stack; pop() which pops out the topmost element from the stack; isEmpty() which returns true/false depending upon whether the stack is empty or not; isFull() which takes the size of the stack as input and returns true/false depending upon whether the stack is full or not (depending upon the given size); getMin() which returns the minimum element of the stack.
+
+Expected Time Complexity: O(1) for all the 5 functions.
+Expected Auxiliary Space: O(1) for all the 5 functions.
+
+Constraints:
+1 <= T <= 100
+1 <= N <= 100
+
+Example:
+Input:
+1
+5
+18 19 29 15 16
+Output:
+15
+*/
+
+
+
+
+
+
+
+
+
+
+
+
+
 #include<iostream>
 #include<stack>
 using namespace std;

stack/next_larger_element_in_array.cpp

@@ -1,3 +1,38 @@
+/*
+Given an array A of size N having distinct elements, the task is to find the next greater element for each element of the array in order of their appearance in the array. If no such element exists, output -1
+
+Input:
+The first line of input contains a single integer T denoting the number of test cases.Then T test cases follow. Each test case consists of two lines. The first line contains an integer N denoting the size of the array. The Second line of each test case contains N space separated positive integers denoting the values/elements in the array A.
+
+Output:
+For each test case, print in a new line, the next greater element for each array element separated by space in order.
+
+Constraints:
+1 <= T <= 100
+1 <= N <= 107
+1 <= Ai <= 1018
+Example:
+Input
+2
+4
+1 3 2 4
+4
+4 3 2 1
+Output
+3 4 4 -1
+-1 -1 -1 -1
+
+Explanation:
+Testcase1: In the array, the next larger element to 1 is 3 , 3 is 4 , 2 is 4 and for 4 ? since it doesn't exist hence -1.
+*/
+
+
+
+
+
+
+
+
 #include<bits/stdc++.h>
 using namespace std;