|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
package main import ( "fmt" "sync" ) //channel func chanFunc(ch chan int) { fmt.Println("chValue") defer close(ch) ch <- 1 } func main() { //channel ch := make(chan int) go chanFunc(ch) fmt.Println(<-ch) } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
package main import ( "fmt" "sync" ) func tie(wg *sync.WaitGroup) { fmt.Println("Shiv") wg.Done() } func main() { var wg sync.WaitGroup wg.Add(1) go tie(&wg) wg.Wait() } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 |
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 adjancy matrix in java The program in java it adds edges and checks if edge exist between specified vertices.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 |
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 UPI ID chaudharisuresh997@okhdfcbank
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
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()); } } |
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 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.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
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 where you wish to navigate. About.html
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
<ion-header> <ion-navbar> <ion-title> About </ion-title> </ion-navbar> </ion-header> <ion-content padding> <button ion-button (click)="navigate()">Default</button> </ion-content> |
<button ion-button> directive is used in ionic to create button. click event is…
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. Please have a look at below code.It is self explanatory.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
import { Component } from '@angular/core'; import { NavController } from 'ionic-angular'; @Component({ selector: 'page-about', templateUrl: 'about.html' }) export class AboutPage { one1(one:string) { alert(one); } list=["Shiv","ganesh"] constructor(public navCtrl: NavController) { } } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
<ion-header> <ion-navbar> <ion-title> About </ion-title> </ion-navbar> </ion-header> <ion-content padding> <ion-list> <ion-item *ngFor="let one of list" (click)="one1(one)"> {{one}} </ion-item> </ion-list> </ion-content> |
Live Example https://ionic-fwbhvk.stackblitz.io
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 in key and value. Hashmap is not synchronized. Collections.synchronizedHashset Hashmap does not allow duplicate key. Hashmap allows only one null…
<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 is implemented using the TreeMap. Main purpose is for sorting the stores elements. …
Doubly Linked List Tutorial in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 |
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