importjava.util.*; importjava.io.*; classGFG{ publicstaticvoidmain(String[]args){ BST tree=newBST(); tree.insert(30); tree.insert(50); tree.insert(15); tree.insert(20); tree.insert(10); tree.insert(40); tree.insert(60); tree.inorder(); } } classNode{ Node left; intval; Nod...
importjava.util.*; classGFG{ publicstaticvoidmain(String[]args){ Scanner in=newScanner(System.in); Strings=in.nextLine(); StringBuilder sb=newStringBuilder(s); Strings0=s; intk=s.length(); if((int)s.charAt(0)>90){ intbeta=((int)(s.charAt(0)))-32; ...
importjava.io.*; importjava.util.*; // Main class classGFG{ // Main driver method publicstaticvoidmain(String[]args) { // Random array of string as input Stringgfg[]={"Are","You","A","Programmer"}; Stringgfg2=""
importjava.lang.*; importjava.io.*; classGFG { publicstaticvoidmain(String[]args) { Scanner dis=newScanner(System.in); Strings1="",s2=""; intt=0,l=0,i=0,j=0,w1=0,w2=0; t=dis.nextInt(); for(i=0;i<t;i++) { s1=dis.next(); ...
importjava.io.*; importjava.util.*; classGfG { publicstaticvoidmain(Stringargs[]) { Scanner sc=newScanner(System.in); intt=sc.nextInt(); while(t-->0) { intn=sc.nextInt(); intA[]=newint[n]; for(inti=0;i<n;i++) A[i]=sc.nextInt(); ...
// Java program to find minimum number of // flip to make binary string alternate classGFG { // Utility method to flip a character publicstaticcharflip(charch) { return(ch=='0')?'1':'0'; } // Utility method to get minimum flips when ...
// Java program to find median importjava.util.*; classGFG{ // Function for calculating median publicstaticdoublefindMedian(inta[],intn) { // First we sort the array Arrays.sort(a); // check for even case if(n%2!=0) return(double)a[n/2]; ...
forkdownload copy importjava.io.*; classGFG{ // function to check whether // the bit at given position // is set or unset staticintbitAtGivenPosSetOrUnset (intn,intk) { // to shift the kth bit // at 1st position intNew_num=1<<(k-1); ...
importjava.util.*; classGFG { // Returns count of pairs in arr[0..n-1] with XOR // value equals to x. staticintxorPairCount(intarr[],intn,intx) { intresult=0;// Initialize result // create empty map that stores counts of ...
*/ importjava.util.*; importjava.lang.*; importjava.io.*; importjava.util.HashMap; classKey{ Stringkey; Key(Stringkey) { this.key=key; } @Override publicinthashCode() { inthash=(int)key.charAt(0); System.out.println("hashCode for key: " +key+" = "+hash); returnhash; } @Ove...