Raghav2211

class Node{
	int data;
	Node left,right;
	Node(int d){
		data=d;
		left=right=null;
	}
}

class Solution

Raghav2211

public static int coinChange(int[] coins, int amount, Map<Integer, Integer> map) {
    if (map.get(amount) != null) return map.get(amount);
    if (amount == 0) return 0;
    if (amount < 0) return -1;
    int minimumCoin = Integer.MAX_VALUE;
    for (int coin : coins) {
      int remainder = amount - coin;
      int coinNeeded = coinChange(coins, remainder, map);
      map.put(remainder, coinNeeded);
      if (coinNeeded != -1) {

Raghav2211

 public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
       
        if( (p.val == root.val || q.val == root.val) || ( p.val < root.val && q.val > root.val)){
            return root;
        }
        TreeNode ans = root;
        if(p.val< root.val && q.val < root.val ){ //left
            ans = lowestCommonAncestor(root.left,p,q);
        }
        else if(p.val > root.val && q.val > root.val) { // right

Raghav2211

public class TouchingTriangle {
    public static void main(String[] args) {
        touchingTriangle();
    }

    private static void touchingTriangle() {
        int r = 10;
        int qty = 10;
        for (int iu = 1, id = r; iu <= r; ++iu, --id) {

Raghav2211

package main

import (
	"fmt"
)
var jobs = []int {1,2, 3, 4,5,6,7,8,9,10}

func producer ( link chan int , backpressure <- chan int) {
	for  {
		backpressureEvent := <- backpressure

Raghav2211

package main

import (
	"golang.org/x/tour/wc"
	"strings"
)

func WordCount(s string) map[string]int {
	splitInput := strings.Split(s," ")
	wordCount := make(map[string]int)

Raghav2211

func fibonacci() func() int {
	f1,f2 := 0,1
	return func() int {
		f2 , f1 = (f1+f2), f2 // https://golang.org/ref/spec#Order_of_evaluation
		return f1
	}

}