kasimpeera786

DBMS-COURSE-REGISTRTION-SYSTEM

notepad

student-survey

DOCTOR-CONSULTANCY

calculator

camel-and-banana

java-stdin-and-stdout

java-if-else

merge-k-sorted-lists

generate-parentheses

queen-attack-2

larrya-array

backreference

matching-again-and-again

dynamic-array

VACCUM

array-reversal

1D-array-in-c

regec-to-epsilon-nfa

re-start

re.findall

music

grop-grouos-

distinct-pattern

maximize-it

The-Bag-of-Gold-Again

Replace-The-Array

Given an array of integers, replace every element with the greatest element on the right side in the array. Replace last element with 0 as there no element on the right side of it. Input Format First line contains N , the number of Numbers. Next line contains N integers a[1]..a[n] the numbers Constraints 1<= N <= 10^5 1<= ai <= 10^5 Output Format Print the array required Sample Input 0 6 6 7 4 3 5 2 Sample Output 0 7 5 5 5 2 0

wheather-report

idea

company-logo