javacpp

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

 Inheritance is a future of oops(Object Oriented Programming).it Used To Share The Properties of Class or a class drive from another one class is Called Inheritance. in Java Programming "extends" Keyword is used to inherit the class. Syntax: class A{ //member variables and function } class B extends class A { //member variables and function } example, class A{ void superclass() { System.out.println("super class"); } } class B extends class A { public static void main() { B b=new B(); b.superclass(); } } From The Above Java Programming Contains Two Classes Named As "A" and "B".class A contains a Member Method Named as "superclass()" and class B contains main method.then class B is Inherit(Extends) From class A.So We are call The method superclass from class B.

 Array [5][3][4][10] ->values [0][1][2][3] ->index Linked List -Head -Tail -Middle /* [10|pointer]->[20|pointer]->[30|pointer] */ Stack -Push -Pop -Top -Peak /* [ 20 ] <--Push Or Pop From One Side [ 15 ] [ 10 ] [ 5  ] */ Que -Push -Enque -Deque /* Pop From Another Side <--[5][10][15][20] <--Push from One Side */ Tree -Root -Left -Right /*    root /    \        /      \      Left Right     / \           \    /     \            \ Left right     Right Traversal 1.PreOrder(Root,Left,Right) Regressive(root): if(root!=null) print(root.data) Regressive(root.left) Regressive(root.right) 2.InOrder(Left,Root,Right) Regressive(root): if(root!=null) Re...

1.Factorial of Given Number Using Java. import java.util.*;  class factorial{ public static int fact( int n){ if (n< 3 ){ return 1 ; } else { return fact(n- 1 )+fact(n- 2 ); } } public static void main( String [] args){          Scanner in=new Scanner(System.in);          int n=in.nextInt(); System.out.println(fact( n )); } } output: 6 8 2.staireCase Using Java Programming. class staireCase{ public static void main( String [] args){ int n= 5 ; for ( int i= 1 ;i<=n;i++){ for ( int j= 0 ;j<n;j++){ if (j>=n-i) { System.out.print( "#" ); } else { System.out.print( " " ); } } System.out.println(); } } } output: # ...

  /* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...

  class node{ int data; node left; node right; node( int data){ this .data=data; } } class treeHeight{ node root; treeHeight(){ root= null ; } public static void main( String [] args){ treeHeight t=new treeHeight(); t.insert( 15 ); t.insert( 20 ); t.insert( 10 ); t.insert( 5 ); t.insert( 2 ); System.out.println(t.height(t.root)); } public void insert( int data){ root=addNode(root,data); } public node addNode(node root, int data){ if (root== null ){ return new node(data); } else if (root.data<data){ root.right=addNode(root.right,data); } else if (root.data>data){ root.left=addNode(root.left,data); } else { return root; } return root; } /* 15,20,10,5 Regression Is Used To Divide a Hu...

  /* Tree is a non-linear Data Structure. root | /------------------------------\ left right | | /--------------\ /-----------------\ left right left right \ \ \ leaf 1.Binary Tree. 2.AVL Tree. 3.Red Black Tree. */ //Structure of Tree In Java Class which hold the Data and pointer of left and right node class node{ int data; node right; node left; node( int data){ this .data=data; } } //Binary Tree Class To Access The node Class class binaryTree{ node root; binaryTree(){ root= null ; } public static void ...