Author has experience of developing enterprise large scale applications built with the technologies ranging from Java and frameworks like spring,hibernate,jpa, angularjs.

Count length of singly Linked List recursively

class MySingly{
    int data;
    MySingly next;
    int counter;
    public int count(MySingly singly){
        if(singly!=null){
            counter++;
            count(singly.next);
        }
        return counter;
    }
}
public class LengthOfTree {
    public static void main(String[] args){
        MySingly singly=new MySingly();
        singly.data=4;
        MySingly one=new MySingly();
one.data=4;
        singly.next=one;
        MySingly two=new MySingly();
two.data=6;
        singly.next.next=two;
        MySingly three=new MySingly();
three.data=7;
        singly.next.next.next=three;
   System.out.print(singly.count(singly));
    }
}

class MySingly{

int data;

MySingly next;

int counter;

public int count(MySingly singly){

if(singly!=null){

counter++;

count(singly.next);

}

return counter;

}

public class LengthOfTree {

public static void main(String[] args){

MySingly singly=new MySingly();

singly.data=4;

MySingly one=new MySingly();

one.data=4;

singly.next=one;

MySingly two=new MySingly();

two.data=6;

singly.next.next=two;

MySingly three=new MySingly();

three.data=7;

singly.next.next.next=three;

System.out.print(singly.count(singly));

}

The problem i tried to solve is present in https://www.geeksforgeeks.org/find-length-of-a-linked-list-iterative-and-recursive/ If you liked this post kindly share it with your friends. To prepare for interviews I would recommend

Graph using adjacency matrix in java

Graph using adjancy matrix in java The program in java it adds edges and checks if edge exist between specified vertices.

package com.company;
/**
 * Graph simple example to check if EDGE exist
 * Author:wwww.shivapreals.tech
 */

import java.util.Scanner;

class GraphA{
    int MAX;
    int[][] graph;

    public void addEdge(int x,int y){
        // graph[x][y]=1; 1 error
        graph[x][y]=1;
    }
    public void init(int MAX){
        this.MAX=MAX;
        this.graph=new int[MAX][MAX];
        for(int xaxis=0;xaxis<MAX;xaxis++){
            for(int yaxis=0;yaxis<MAX;yaxis++){
                graph[xaxis][yaxis]=-1;
            }
        }
    }

    public void edgeExist(int i, int i1) {
        if(graph[i][i1]!=-1){
            System.out.print("Edge exist");
        }
    }
}
public class GraphAdjency {
    public static void main(String[] args) {
        GraphA graph = new GraphA();

        System.out.println("Enter Graph 2d size");
        Scanner sc=new Scanner(System.in);
       int MAX=sc.nextInt();//these will be number of rows and columns
        graph.init(MAX);
        graph.addEdge(2,1);
        graph.addEdge(2,3);
        graph.edgeExist(2,1);
    }


}

package com.company;

/**

* Graph simple example to check if EDGE exist

* Author:wwww.shivapreals.tech

import java.util.Scanner;

class GraphA{

int MAX;

int[][] graph;

public void addEdge(int x,int y){

// graph[x][y]=1; 1 error

graph[x][y]=1;

}

public void init(int MAX){

this.MAX=MAX;

this.graph=new int[MAX][MAX];

for(int xaxis=0;xaxis<MAX;xaxis++){

for(int yaxis=0;yaxis<MAX;yaxis++){

graph[xaxis][yaxis]=-1;

}

public void edgeExist(int i, int i1) {

if(graph[i][i1]!=-1){

System.out.print("Edge exist");

}

public class GraphAdjency {

public static void main(String[] args) {

GraphA graph = new GraphA();

System.out.println("Enter Graph 2d size");

Scanner sc=new Scanner(System.in);

int MAX=sc.nextInt();//these will be number of rows and columns

graph.init(MAX);

graph.addEdge(2,1);

graph.addEdge(2,3);

graph.edgeExist(2,1);

}

If you like this tutorial kindly share it spread the word. You can buy me a coffee my Read More

Stack Implementation in java

package com.company;

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

class Stack{
    List<Integer> stackList=new ArrayList<>();
    int top=0;

}
public class StackUtil {
    Stack stack=new Stack();

    public int pop()
    {int item = 0;
        if(stack.top!=-1){
    System.out.println(stack.top);
    if(stack.top==0)
    item=stack.stackList.get(stack.top);
    else
        item=stack.stackList.get(stack.top-1);

    stack.top=stack.top-1;
        }else{System.out.println("EMPTY");}
    return item;
    }
    public void push(int data){
    System.out.println(stack.top);

        stack.stackList.add(data);
        stack.top+=1;

    }
    public static void main(String[] args){
        StackUtil util=new StackUtil();
        util.push(45);
        //util.push(55);
        //util.push(70);
        int stackItem=util.pop();
        System.out.println(stackItem);
        System.out.println(util.pop());
        System.out.println(util.pop());
        System.out.println(util.pop());
        System.out.println(util.pop());
    }
}

package com.company;

import java.util.ArrayList;

import java.util.List;

class Stack{

List<Integer> stackList=new ArrayList<>();

int top=0;

}

public class StackUtil {

Stack stack=new Stack();

public int pop()

{int item = 0;

if(stack.top!=-1){

System.out.println(stack.top);

if(stack.top==0)

item=stack.stackList.get(stack.top);

else

item=stack.stackList.get(stack.top-1);

stack.top=stack.top-1;

}else{System.out.println("EMPTY");}

return item;

}

public void push(int data){

System.out.println(stack.top);

stack.stackList.add(data);

stack.top+=1;

}

public static void main(String[] args){

StackUtil util=new StackUtil();

util.push(45);

//util.push(55);

//util.push(70);

int stackItem=util.pop();

System.out.println(stackItem);

System.out.println(util.pop());

}

If you have loved this post kindly consider to donate at UPI chaudhariusuresh997@okhdfcbank Find Source Code at https://github.com/shivapreals/Data-Structure/blob/master/StackUtil.java

How to navigate to other page Navigation tutorial-ionic2 and angular4

How to navigate to other page Navigation tutorial-ionic2 and angular4 While developing some app you most frequently have the requirement to navigate back and forth between the views. In ionic the NavController from ‘ionic-angular’ comes handy.

import { Component } from '@angular/core';
import { NavController } from 'ionic-angular';
import {ContactPage} from '../contact/contact';
@Component({
  selector: 'page-about',
  templateUrl: 'about.html'
})
export class AboutPage {

  constructor(public navCtrl: NavController) {

  }
navigate(){
  this.navCtrl.push(ContactPage);
}
}

import { Component } from '@angular/core';

import { NavController } from 'ionic-angular';

import {ContactPage} from '../contact/contact';

@Component({

selector: 'page-about',

templateUrl: 'about.html'

})

export class AboutPage {

constructor(public navCtrl: NavController) {

}

navigate(){

this.navCtrl.push(ContactPage);

}

this.navCtrl.push method accepts page Read More

How to iterate items in ionic2 with angular4 tutorial

Hi Everybody,Ever dreamed of developing mobile app on your own.So good news for you is you can develop mobile app if you know little bit of angular.So today we are going to iterate list of items using ionic2 and angular4. Read More

Map Java Collection Tutorial

Map Stores values in key and value. map does not allow duplicate key. only one null key but any number of null values To synchronize the Map use. Collections.synchronizedMap(yourMapObject) Hashmap Hashmap allows random storage sequence is not maintained. Stores values Read More

Java Collection -Set

<I>Set does not contain duplicates. randomly stores elements. does not permits null elements. How to make your list synchronised? Collections.synchronizedSet(yourSetObject) Classes <C>TreeSet Sorts element by natural order. rest of the properties are same as specified by interface Set Internally it Read More

Doubly Linked list in java

Doubly Linked List Tutorial in Java

class DoublyList
{
	DoublyList prev;
	DoublyList next;
	String data;
	
}
class DoublyAPI
{
	DoublyList head;
	
	/**
	 * Append at last
	 * @param data
	 */
	public void appendToDoublyList(String data)
	{
		if(head==null)
		{
			head=createNode(data);			
		}
		else
		{
			DoublyList traverseNode;
			traverseNode=head;
			//traverse till end
			while(traverseNode.next!=null)
			{
				traverseNode=traverseNode.next;
			}
			DoublyList newNode=createNode(data);
			
			traverseNode.next=newNode;
			newNode.prev=traverseNode;
			newNode.next=null;
		}
	}
	public void insertInMiddle(int loc,String data)
	{	
		DoublyList traverseNode = head;
		for(int i=0;i<loc;i++)
		{
			traverseNode=traverseNode.next;
		}
		DoublyList newNode=createNode(data);
	
		newNode.next=traverseNode.next;
		traverseNode.next=newNode;
		newNode.prev=traverseNode;
		newNode.next.prev=newNode;
		
		
	}
	/**
	 * Create A node
	 * @param data
	 * @return
	 */
	
	public DoublyList createNode(String data)
	{
		DoublyList doublyObj=new DoublyList();
		doublyObj.data=data;
		return doublyObj;
	}
	public void printAll()
	{
		while(head!=null)
		{
			System.out.println(head.data);
			head=head.next;
		}
		//System.out.println(head.data);
	}

}
public class DoublyLinkedList {




	public static void main(String[] args) {
		DoublyAPI apiObj=new DoublyAPI();
		apiObj.appendToDoublyList("A");
		apiObj.appendToDoublyList("B");
		apiObj.appendToDoublyList("C");
		apiObj.insertInMiddle(1, "Z");
		apiObj.printAll();
	}

}

class DoublyList

{

DoublyList prev;

DoublyList next;

String data;

}

class DoublyAPI

{

DoublyList head;

/**

* Append at last

* @param data

public void appendToDoublyList(String data)

{

if(head==null)

{

head=createNode(data);

}

else

{

DoublyList traverseNode;

traverseNode=head;

//traverse till end

while(traverseNode.next!=null)

{

traverseNode=traverseNode.next;

}

DoublyList newNode=createNode(data);

traverseNode.next=newNode;

newNode.prev=traverseNode;

newNode.next=null;

}

public void insertInMiddle(int loc,String data)

{

DoublyList traverseNode = head;

for(int i=0;i<loc;i++)

{

traverseNode=traverseNode.next;

}

DoublyList newNode=createNode(data);

newNode.next=traverseNode.next;

traverseNode.next=newNode;

newNode.prev=traverseNode;

newNode.next.prev=newNode;

}

/**

* Create A node

* @param data

* @return

public DoublyList createNode(String data)

{

DoublyList doublyObj=new DoublyList();

doublyObj.data=data;

return doublyObj;

}

public void printAll()

{

while(head!=null)

{

System.out.println(head.data);

head=head.next;

}

//System.out.println(head.data);

}

public class DoublyLinkedList {

public static void main(String[] args) {

DoublyAPI apiObj=new DoublyAPI();

apiObj.appendToDoublyList("A");

apiObj.appendToDoublyList("B");

apiObj.appendToDoublyList("C");

apiObj.insertInMiddle(1, "Z");

apiObj.printAll();

}

This is just like a tip of the iceberg.I would strongly recommend to go through

Singly Linked List using java.

Singly Linked list using java Singly Linked List is created for adding the elements one after another where each Node is linked to the other Node sequentially. The operations covered in this post are Append to the end Read More

Files Read by Multiple Thread

How to read each file on separate thread. Step 1:Get List of all files in the specified folder

String[] files=new File("D:\\test\\").list();

Now pass the file to the seperate thread.

for(String file:files)
{
new Thread(new FileList("D:\\test\\"+file)).start();
}

String[] files=new File("D:\\test\\").list();

Now pass the file to the seperate thread.

for(String file:files)

{

new Thread(new FileList("D:\\test\\"+file)).start();

}

Step 2:Create Class which will display contents of file and implements runnable. Note that I have created constructor to Read More

Author: admin