0xdarkcap
/ gist:a8cf76675c5043a80e53843bfabc61fd
Created
May 7, 2018 04:49
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ### Keybase proof | |
| I hereby claim: | |
| * I am varunsangwan on github. | |
| * I am mrdarkcrypto (https://keybase.io/mrdarkcrypto) on keybase. | |
| * I have a public key ASAcpVetKDy7MTgSE7tuC53O_E1YjO1BpPQcM4rzFv8-Gwo | |
| To claim this, I am signing this object: |
0xdarkcap
/ smallest greatest element.c
Last active
March 28, 2018 00:18
An array is given of n length, and we need to calculate the next greater element for each element in given array. If next greater element is not available in given array then we need to fill ‘_’ at that index place.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| int main() | |
| { | |
| int i,j,c,n,min,flag=0,d=0; | |
| scanf("%d",&n); //scanning the number of element in array. | |
| int a[n],b[n]; | |
| for(i=0;i<n;i++) | |
| { |