Software Engineer

Ans: 77000

Ans:- Stack

Answer: c) Palm DS

Initialize Variables:
max_length to store the length of the longest natural sorted subsequence (initialize to 0).
current_length to store the current length of the subsequence being checked (initialize to 1).
prev_char to store the previous character in the subsequence (initialize to the first character of the string).
Iterate Through the String:
Start iterating from the second character of the string.
For each character char in the string:
If char is greater than prev_char, increment current_length by 1.
If char is not greater than prev_char, reset current_length to 1.
Update max_length if current_length is greater than max_length.
Update prev_char to char.
Return max_length.

Initialize an array ans[] to store the maximum height of bars to the right of each bar.
Traverse the elevation map from right to left and update ans[] with the maximum height encountered so far.
Initialize a variable max to track the maximum height encountered while traversing from left to right.
Traverse the elevation map from left to right.
For each bar, calculate the amount of water that can be trapped above it by taking the minimum of the maximum height of bars to its left and right (stored in ans[] and max, respectively), and subtracting the height of the current bar.
Add up the amount of water trapped above each bar to get the total amount of trapped rainwater.
Return the total amount of trapped rainwater.

class Solution {
public int trap(int[] height) {
int n = height.length;
int ans[] = new int[n];
int max = 0;
for(int i=n-1;i>=0;i--)
{
if(max ans[i] = max;
}
max = 0;
int sol = 0;
for(int i=0;i { if(max sol+= Math.min(max,ans[i])-height[i];
}

return sol
;
}
}

1) Count the number of 0s. So let’s understand with an example we have an array arr = [0, 1, 0, 1, 0, 0, 1] the size of the array is 7 now we will traverse the entire array and find out the number of zeros in the array, In this case the number of zeros is 4 so now we can easily get the number of Ones in the array by Array Length – Number Of Zeros.

2) Once we have counted, we can fill the array first we will put the zeros and then ones (we can get number of ones by using above formula).

1. Divide: Divide the list or array recursively into two halves until it can no more be divided.
2. Conquer: Each subarray is sorted individually using the merge sort algorithm.
3. Merge: The sorted subarrays are merged back together in sorted order. The process continues until all elements from both subarrays have been merged.