Uploaded Java Solution

Author: FarheenB

Java/soln-array-problems/majority-element.java

@@ -2,6 +2,7 @@
  @author Farheen Bano
   
  Reference-
+ https://www.interviewbit.com/problems/majority-element/
  https://leetcode.com/problems/majority-element/
 */
 

Java/soln-backtracking-problems/combination-sum-ii.java

@@ -15,17 +15,18 @@ public List<List<Integer>> combinationSum2(int[] candidates, int target) {
     }
 
     public void generateSubsets(int index, int[] candidates, List<Integer> cur, List<List<Integer>> subsets, int target){
-        if(target==0){
+        if(target==0) {
             subsets.add(new ArrayList<>(cur));
             return;
         }
 
         if(target<0)
             return;
 
-        for(int i=index;i<candidates.length;i++){
+        for(int i=index;i<candidates.length;i++) {
             if(i>index && candidates[i]==candidates[i-1])
                 continue;
+            
             cur.add(candidates[i]);
             generateSubsets(i+1,candidates,cur,subsets,target-candidates[i]);
             cur.remove(cur.size()-1);

Java/soln-dynamic-programming-problems/longest-increasing-subsequence.java

@@ -2,6 +2,7 @@
  @author Farheen Bano
   
  References-
+ https://www.interviewbit.com/problems/longest-increasing-subsequence
  https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/
  https://leetcode.com/problems/longest-increasing-subsequence/
 */

Java/soln-dynamic-programming-problems/longest-palindromic-subsequence.java

@@ -33,9 +33,9 @@ public int longestCommonSubsequence(String text1, String text2) {
             for(int j=0;j<=m;j++){
                 if(i==0 || j==0)
                     dp[i][j]=0;
-                else if(str1[i-1]==str2[j-1]){
+                else if(str1[i-1]==str2[j-1])
                     dp[i][j]=1+dp[i-1][j-1];
-                }
+                
                 else 
                     dp[i][j]=Math.max(dp[i][j-1],dp[i-1][j]);
             }

Java/soln-grid-problems/DP-unique-paths-with-obstacle-grid.java

@@ -2,6 +2,7 @@
  @author Farheen Bano
   
  Reference-
+ https://www.interviewbit.com/problems/unique-paths-in-a-grid
  https://leetcode.com/problems/unique-paths-ii/
 */
 

Java/soln-string-problems/palindrome-longest-build.java

@@ -22,6 +22,7 @@ public int longestPalindrome(String s) {
             if(map.get(key)%2!=0)
                 flag++;
         }
+        
         return flag>0?s.length()-flag+1:s.length();
     }
 }