class Solution{ // arr: input array // n: size of array // Function to find the trapped water between the blocks. static long trappingWater(int arr[], int n) { int rmax=arr[arr.length-1]; long ans=0; Stack st=new Stack(); for(int i=arr.length-2; i>=1; i--){ rmax=Math.max(rmax,arr[i]); st.push(rmax); } int leftmax=arr[0]; for(int i=1; i
Mass bro. We are expecting this kind of hard questions from code io ❤️❤️ Keep going bro❤️
😊😊😊😊😊😊👍
Completely Understandable when it’s in my own mother tongue
Thank you so much 😇😇
class Solution{
// arr: input array
// n: size of array
// Function to find the trapped water between the blocks.
static long trappingWater(int arr[], int n) {
int rmax=arr[arr.length-1];
long ans=0;
Stack st=new Stack();
for(int i=arr.length-2; i>=1; i--){
rmax=Math.max(rmax,arr[i]);
st.push(rmax);
}
int leftmax=arr[0];
for(int i=1; i
Nice question da
😅
bro i want a video of how to find the longest palidnrome in a string ? can u make a video of it bro please
You can use DP to solve this... I'll try to make a video on it
Bro chinna request..coding apo explain pandringalla atha...athuum sketch pannni kamicha ennum easya understaand agum
Ok brother ... Thanks for your suggestion 👍👍
Last week Zoho la entha question tha ketanga 3 round la
Hope you cleared that round 🤩
@@codeio yes but 4 th technical round la vetuten
Unga videos 2 and 3 Rd ku romba useful bro technical kum podunga