Pinned Repositories
18CSC305J-AI
All Lab experiments of 18CSC305J Artificial Intelligence.
1D-array-in-c
array-reversal
backreference
calculator
camel-and-banana
company-logo
DBMS-COURSE-REGISTRTION-SYSTEM
delta
Deterministic-Url-and-HashTag-Segmentation
kasimpeera786's Repositories
kasimpeera786/1D-array-in-c
kasimpeera786/array-reversal
kasimpeera786/backreference
kasimpeera786/calculator
kasimpeera786/camel-and-banana
kasimpeera786/company-logo
kasimpeera786/DBMS-COURSE-REGISTRTION-SYSTEM
kasimpeera786/distinct-pattern
kasimpeera786/DOCTOR-CONSULTANCY
kasimpeera786/dynamic-array
kasimpeera786/generate-parentheses
kasimpeera786/grop-grouos-
kasimpeera786/idea
kasimpeera786/java-if-else
kasimpeera786/java-stdin-and-stdout
kasimpeera786/larrya-array
kasimpeera786/matching-again-and-again
kasimpeera786/maximize-it
kasimpeera786/merge-k-sorted-lists
kasimpeera786/music
kasimpeera786/notepad
kasimpeera786/queen-attack-2
kasimpeera786/re-start
kasimpeera786/re.findall
kasimpeera786/regec-to-epsilon-nfa
kasimpeera786/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
kasimpeera786/student-survey
kasimpeera786/The-Bag-of-Gold-Again
kasimpeera786/VACCUM
kasimpeera786/wheather-report