java gitignore

Author: Dhananjay Nagargoje

Diff for: .gitignore

@@ -0,0 +1,23 @@
+# Compiled class file
+*.class
+
+# Log file
+*.log
+
+# BlueJ files
+*.ctxt
+
+# Mobile Tools for Java (J2ME)
+.mtj.tmp/
+
+# Package Files #
+*.jar
+*.war
+*.nar
+*.ear
+*.zip
+*.tar.gz
+*.rar
+
+# virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
+hs_err_pid*

Diff for: src/main/java/oopadesign/airlinemgmt

@@ -0,0 +1,31 @@
+public enum ReservationStatus {
+  REQUESTED, PENDING, CONFIRMED, CHECKED_IN, CANCELED, ABANDONED
+}
+
+public enum SeatType {
+  REGULAR, KID, ACCESSIBLE, OTHER
+}
+
+public enum OrderStatus {
+  RECEIVED, PREPARING, COMPLETED, CANCELED, NONE
+}
+
+public enum TableStatus {
+  FREE, RESERVED, OCCUPIED, OTHER
+}
+
+public enum AccountStatus {
+  ACTIVE, CLOSED, CANCELED, BLACKLISTED, BLOCKED
+}
+
+public enum PaymentStatus {
+  UNPAID, PENDING, COMPLETED, FILLED, DECLINED, CANCELLED, ABANDONED, SETTLING, SETTLED, REFUNDED
+}
+
+public class Address {
+  private String streetAddress;
+  private String city;
+  private String state;
+  private String zipCode;
+  private String country;
+}

Diff for: src/main/java/oopadesign/amazon.md

@@ -0,0 +1,4 @@
+package problems.onRecursionAndDp;
+
+public class DistinctPermu {
+}

Diff for: src/main/java/oopadesign/atm.md

@@ -0,0 +1,4 @@
+package problems.onRecursionAndDp;
+
+public class SubsetsWithTargetSum {
+}

Diff for: src/main/java/oopadesign/blackjack.md

@@ -0,0 +1,52 @@
+package problems.onarray;
+
+public class MaxDistance {
+
+
+    /**
+     * Given an array A of integers, find the maximum of j - i subjected to the constraint of A[i] <= A[j].
+     *
+     * If there is no solution possible, return -1.
+     *
+     * Example :
+     *
+     * A : [3 5 4 2]
+     *
+     * Output : 2
+     * for the pair (3, 4)
+     */
+    public class Solution {
+        // DO NOT MODIFY THE LIST. IT IS READ ONLY
+        public int maximumGap(final List<Integer> A) {
+            if(A.size() == 0) return -1;
+
+
+            int lmin[] = new int[A.size()];
+            int rmax[] = new int[A.size()];
+
+            lmin[0] = A.get(0);
+            rmax[A.size()-1] = A.get(A.size()-1);
+            for(int i=1,j=A.size()-2;i < A.size();i++,j--) {
+                lmin[i] = Math.min(A.get(i), lmin[i-1]);
+                rmax[j] = Math.max(A.get(j), rmax[j+1]);
+            }
+
+            int i=0, j=0,  max = Integer.MIN_VALUE;
+
+            while(i<=j && j < rmax.length) {
+
+                if(lmin[i] <= rmax[j]) {
+                    max = Math.max(j-i, max);
+                    j++;
+                } else {
+                    i++;
+                }
+
+            }
+
+
+            return max;
+        }
+    }
+
+}

Diff for: src/main/java/oopadesign/brokeragesystem.md

@@ -0,0 +1,4 @@
+package problems.onmath.gfg;
+
+public class DistinctPermutations {
+}

Diff for: src/main/java/oopadesign/carrentel.md

@@ -0,0 +1,4 @@
+package problems.onsearching;
+
+public class RoatetedArray {
+}

Diff for: src/main/java/oopadesign/chess.md

@@ -0,0 +1,4 @@
+package problems.onsearching;
+
+public class SmallestBaseAllOne {
+}

Diff for: src/main/java/oopadesign/cricinfo.md

@@ -0,0 +1,4 @@
+package problems.patterns.cyclicsort;
+
+public class AllMissingNumbers {
+}

Diff for: src/main/java/oopadesign/facebook.md

@@ -0,0 +1,4 @@
+package problems.patterns.slidingwindows.cyclicsort;
+
+public class CyclicSortBasic {
+}

Diff for: src/main/java/oopadesign/hotelmgmt.md

@@ -0,0 +1,4 @@
+package problems.patterns.cyclicsort;
+
+public class FindDuplicate {
+}

Diff for: src/main/java/oopadesign/librarymgmt.md

@@ -0,0 +1,4 @@
+package problems.patterns.cyclicsort;
+
+public class MissingNumber {
+}

Diff for: src/main/java/oopadesign/linkedin.md

@@ -0,0 +1,4 @@
+package problems.patterns.onlinkedlistreversal;
+
+public class ReverseLinkedList {
+}

Diff for: src/main/java/oopadesign/moviebookingticket.md

@@ -0,0 +1,20 @@
+package problems.patterns.slidingwindows;
+
+public class LongestRepeatingCharacterReplacement {
+    public int characterReplacement(String s, int k) {
+        public int characterReplacement(String s, int k) {
+            int len = s.length();
+            int[] count = new int[26];
+            int start = 0, maxCount = 0, maxLength = 0;
+            for (int end = 0; end < len; end++) {
+                maxCount = Math.max(maxCount, ++count[s.charAt(end) - 'A']);
+                while (end - start + 1 - maxCount > k) {
+                    count[s.charAt(start) - 'A']--;
+                    start++;
+                }
+                maxLength = Math.max(maxLength, end - start + 1);
+            }
+            return maxLength;
+        }
+    }
+}

Diff for: src/main/java/oopadesign/parkinglot.md

@@ -0,0 +1,4 @@
+package problems.patterns.slidingwindows;
+
+public class MaxInEachWIndow {
+}