dineshrajpurohit

package main

import "fmt"

// fibonacci is a function that returns
// a function that returns an int.
func fibonacci() func() int {
	x := 0
	y := 1
	return func() int{

dineshrajpurohit

/**
 * Dinesh 
 * 
 */
//package com.dinesh.tutorials;

	public static void pascal(int n){
		int[][] pas = new int[n][];
		for(int i=0; i<n;i++){
			pas[i] = new int[i+1];

dineshrajpurohit

    // Sieve of erosthenes
	public static void primes(int n){
		Boolean[] prime = new Boolean[n+1];
		
		for(int i=2;i<=n;i++){
			prime[i] = true;
		}
		
		for(int div=2;div*div<=n;div++){
			if(prime[div] == true){

dineshrajpurohit

public Boolean isValidBinary(BinaryTreeNode root, BinaryTreeNode prev){
	    
	    
	    // Stack  3 2 1 
	    // 1 2 3
	 //  if(current.left != null ){
	 //    Boolean left = isValidBinary(current.left);  
	 //      if(left == false)
	 //         return false;
	 //      else{

dineshrajpurohit

package com.dinesh.tutorials;

class NumberAndRoman{
	 
/**
 * Converting the Numbers to Roman Numbers
 *
**/
public static String convertToRoman(int num){
String rom = "";

dineshrajpurohit

/**
 * 
 *  Dinesh
 * 
 *  RootedTreeTraversal
 *   - Preorder Traversal
 *   - Postorder Traversal
 *   - Inorder Traversal
 *   - Levelorder Traversal
 * 

dineshrajpurohit

/**
 * 
 *  Dinesh
 * 
 *  RootedTreeTraversal
 *   - Preorder Traversal
 *   - Postorder Traversal
 *   - Inorder Traversal
 *   - Levelorder Traversal
 * 

dineshrajpurohit

/**
 *  Infix to postfix implementation
 * 
 *  Dinesh
 *  
 *  Input: 4+8*6-5/3-2*2+2 ==>  486*+53/-22*-2+    
 * 
 * Algorithm:
 *  - Whenever an integer/character comes from expression we append to postfix String
 *  - Whenever a operator comes in we check the precedence of the incoming operator with the 

dineshrajpurohit

/**
 * 
 * Postfix implementation using StackList: 
 * Code for stacklist: https://gist.github.com/dineshrajpurohit/0bb67d29a039f85f2f10
 * 
 * Dinesh
 * 
 * PostFix Expression parsing and getting the result
 * 
 *  e.g: 42+351-*+ ==> 18

dineshrajpurohit

/**
 *  Implementation of Stacks using Linked List
 * 
 *  Dinesh
 * 
 */

// Namespace
var EX = {};