Main.java

import Array101.MaxConsecutiveOnes;
import Array101.NumbersWithEvenNumberOfDigits;
import Array101.SquaresofSortedArray;
import Array101.DuplicateZeros;
import Array101.MaxConsecutiveOnes;
import Array101.MergeSortedArray;
import Array101.RemoveElement;
import Array101.RemoveDuplicatesfromSortedArray;

import java.util.ArrayList;
import java.util.List;

import ATOZ.ArrayProblems;
import Array101.CheckIfNandItsDoubleExist;
import Array101.ValidMountainArray;
import Array101.GreatestElementonRightSide;
import Array101.MoveZeroes;
import Array101.SortArrayByParity;
import Array101.HeightChecker;
import Array101.ThirdMaximumNumber;
import Array101.FindAllNumbersDisappearedinArray;
import ArrayAndString.FindPivotIndex;
import ArrayAndString.LargestNumberTwiceofOthers;
import ArrayAndString.PlusOne;
import ArrayAndString.DiagonalTraverse;
import ArrayAndString.SpiralMatrix;
import ArrayAndString.PascalTriangle;
import ArrayAndString.AddBinary;
import ArrayAndString.ImplementstrStr;
import ArrayAndString.LongestCommonPrefix;
import ArrayAndString.ReverseString;
import ArrayAndString.ArrayPartitionI;
import ArrayAndString.TwoSumIIInputarraysorted;
import BasicHash.BasicHash;
import ArrayAndString.MinimumSizeSubarraySum;
import ArrayAndString.RotateArray;
import ArrayAndString.PascalsTriangleII;
import ArrayAndString.ReverseWordsinString;
import ArrayAndString.ReverseWordsInStringII;

import LinkedList.MyLinkedList;
import LinkedList.LinkedListCycle;
import LinkedList.LinkedListCycleII;
import LinkedList.IntersectionofTwoLinkedLists;
import LinkedList.RemoveNthNodeFromEndofList;
import LinkedList.ReverseLinkedList;
import LinkedList.RemoveLinkedListElements;
import LinkedList.OddEvenLinkedList;
import LinkedList.PalindromeLinkedList;
import LinkedList.MyDoublyLinkedList;
import LinkedList.MergeTwoSortedLists;
import LinkedList.AddTwoNumbers;
import LinkedList.FlattenMultilevelDoublyLinkedList;
import LinkedList.CopyListWithRandomPointer;
import LinkedList.RotateList;

import MyHashTable.MyHashSet;
import MyHashTable.MyHashMap;
import MyHashTable.SingleNumber;
import MyHashTable.ContainsDuplicates;
import MyHashTable.IntersectionOfTwoArrays;
import MyHashTable.TwoSumHashMap;
import MyHashTable.HappyNumber;
import MyHashTable.IsomorphicString;
import MyHashTable.FirstUniqueCharacterinaString;
import MyHashTable.MinimumIndexSumofTwoLists;
import MyHashTable.IntersectionOfTwoArraysII;
import MyHashTable.ContainsDuplicateII;
import MyHashTable.GroupAnagrams;
import MyHashTable.ValidSudoku;

import QueueAndStack.MyCircularQueue;

import MyHashTable.JewelsAndStones;
import MyHashTable.LongestSubstringWithoutRepeatingCharacters;
import MyHashTable.FourSumII;
import MyHashTable.TopKFrequentElements;
import MyHashTable.RandomizedSet;
import RecursionI.ReverseStringRecursive;
import RecursionI.SwapNodesinPairs;
import RecursionI.SearchinBinarySearchTree;
import RecursionI.ClimbingStairs;
import RecursionI.FibonacciNumber;
import RecursionI.MaximumDepthofBinaryTree;
import RecursionI.Pow_x_n;
import RecursionI.MergeTwoSortedListsRecursive;
import RecursionI.KthSymbolInGrammar;
import RecursionI.UniqueBinarySearchTreesII;
import Sorting.Sorting;
import Extra.TwoSum;
import Extra.PalindromeNumber;
import Extra.QueueUsingStack;
import Extra.MinimizeMaximumPairSumInArray;
import Extra.FrequencyOfTheMostFrequentElement;
import Extra.SearchInsertPosition;
import Extra.MaximumNumberOfCoinsYouCanGet;
import Extra.BestTimetoBuyandSellStock;
import Extra.CountPairsWhoseSumIsLessThanTarget;
import Extra.MajorityElement;
import Extra.RemoveDuplicatesFromSortedList;
import Extra.MaximumProductOfTwoElementsInAnArray;
import Extra.MinimumChangesToMakeAlternatingBinaryString;
import Extra.DecodeWays;
import Extra.MinimumTimeToMakeRopeColorful;
import Extra.ValidPalindrome;
import Extra.LengthOfLastWord;
import Extra.SubarraySumEqualsK;
import Patterns.Patterns;
import BasicMath.BasicMath;
import BasicRecursion.BasicRecursion;
import Extra.SortColors;
import Extra.RemoveOutMostParanthesis;
import Extra.LargestOddNumberinString;
import Extra.RotateString;
import Extra.MergeKSortedLists;
import Extra.MinStack;
import Extra.MeetingRoomII;
import Extra.StackUsingQueue;

// nothing but adding commit
class Main {
    public static void main(String args[]) {

        // ArrayProblems obj = new ArrayProblems();
        // int[] arr = { 1, 2, 3 };
        // int k = 3;
        // System.out.println(obj.longestSubarraywithSumK(arr, k) + " " + 2);
        // k = 5;
        // int[] arr2 = { 2, 3, 5 };
        // System.out.println(obj.longestSubarraywithSumK(arr2, k) + " " + 2);

        // int[] arr3 = { -1, 1, 1 };
        // k = 1;
        // System.out.println(obj.longestSubarraywithSumK(arr3, k) + " " + 3);

        System.out.println("Hello World");

        // MeetingRoomII meetingRoomII = new MeetingRoomII();
        // int[][] meetings = { { 0, 30 }, { 15, 20 }, { 5, 10 }, { 31, 34 }, { 31, 34 }
        // };
        // System.out.println(meetingRoomII.minimumMeetingRooms(meetings));
        // int[][] meetings2 = { { 7, 10 }, { 2, 4 } };
        // System.out.println(meetingRoomII.minimumMeetingRooms(meetings2));

        // StackUsingQueue myStack = new StackUsingQueue();
        // myStack.push(1);
        // // myStack.push(2);
        // System.out.println(myStack.top()); // return 2
        // System.out.println(myStack.pop()); // return 2
        // System.out.println(myStack.empty()); // return False

        QueueUsingStack myQueue = new QueueUsingStack();
        myQueue.push(1); // queue is: [1]
        myQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue)
        myQueue.push(3); // queue is: [1, 2] (leftmost is front of the queue)

        System.out.println(myQueue.peek()); // return 1
        System.out.println(myQueue.pop()); // return 1, queue is [2]
        myQueue.pop();
        System.out.println(myQueue.empty()); // return false

        MinStack minStack = new MinStack();
        minStack.push(-2);
        minStack.push(0);
        minStack.push(-3);
        minStack.push(-4);
        System.out.println(minStack.getMin()); // return -3
        minStack.pop();
        System.out.println(minStack.top()); // return 0
        System.out.println(minStack.getMin()); // return -2

    }
}