Merge pull request codemistic#582 from abhishekdey4444/main

1614. Maximum Nesting Depth of the Parentheses

Author: gantavyamalviya

Java/Leetcode/1614. Maximum Nesting Depth of the Parentheses

@@ -0,0 +1,22 @@
+class Solution {
+ public int maxDepth(String s) {
+ Stack<Character> st=new Stack<>();
+ int count=0;
+ for(int i=0;i<s.length();i++){
+ if(s.charAt(i)=='('){
+ st.push(s.charAt(i));
+ }
+ else{
+ if(count<st.size())
+ count=st.size();
+ 
+ else if(s.charAt(i)==')'){
+ st.pop();
+ }
+ 
+ }
+ 
+ }
+ return count;
+ }
+}

Java/Leetcode/198. House Robber

@@ -0,0 +1,21 @@
+class Solution {
+ public static int max(int []arr,int idx,int []dp){
+ if(idx>=arr.length){
+ return 0;
+ }
+ if(dp[idx]!=-1){
+ return dp[idx];
+ }
+ int a=arr[idx]+max(arr,idx+2,dp);
+ int b=max(arr,idx+1,dp);
+ 
+ return dp[idx]=Math.max(a,b);
+ }
+ public int rob(int[] nums) {
+ int []dp=new int[nums.length];
+ for(int i=0;i<nums.length;i++){
+ dp[i]=-1;
+ }
+ return max(nums,0,dp);
+ }
+}