Valentyn Ponomarenko P-A-R-U-S

## PDBtoGAC.ps1
#ODB Files Location
$binFolder = "C:\Projects\.net 2.0\build\bin"
$gacFolder = "%SYSTEMROOT%\Assembly\GAC_MSIL"

set-location $binFolder

$pdbfiles = get-childitem | where {$_.name.EndsWith("pdb")}
foreach ($pdb in $pdbfiles)
{


## Queue - Golang.go
package Helpers

type Queue struct {
	q []int32
}

func (q *Queue) push(v int32) {
	q.q = append(q.q, v)
}

## Sort Byte Array - Golang.go
b := []byte("9856743210")

fmt.Println("Before:", string(b))
sort.Slice(b, func(i, j int) bool {
			return b[i] < b[j]
})
fmt.Println("After:", string(b))

## Stack - Golang.go
// Following implemetation of Stack tie each element to it parent
type stackElement struct {
	data interface{}

	next *stackElement
}

type Stack struct {
	Size int32
	head *stackElement

## Min Heap - Golang.go
package DataStuctures

import (
	"testing"
)

type MinHeap struct {
	 heap []int32
}

## Max Heap - Golang.go
package DataStuctures

import (
	"testing"
)

type MaxHeap struct {
	heap []int
}

## Find_max_number_of_connected_colors_in_grid.go
package Google

import "testing"

// Find max number of connected colors in grid
// https://proglib.io/p/google-interview-task/?fbclid=IwAR2PXn_XqXQx97U3FLSFssVfDa1-m2P-T3yAJELEJoOWpNfcQjfyesOegpY

type si struct {
	r int
	c int

## Cracking_the_Coding_Interview_4-8_test.go
/*
First Common Ancestor: Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree.
Avoid storing additional nodes in a data structure.
NOTE: This is not necessarily a binary search tree.
Hints: # 10, #16, #28, #36, #46, #70, #80, #96
*/

/*
Создайте алгоритм и напишите код поиска первого общего предка двух узлов бинарного дерева. Постарайтесь избежать
хранения дополнительных узлов в структуре данных.

## Cracking_the_Coding_Interview_4-9_test.go
package Part_4

import (
	"fmt"
	"testing"
)

/*
BST Sequences: A binary search tree was created by traversing through an array from left to right and inserting each element.
Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.

## Cracking_the_Coding_Interview_4-12_test.go
package Part_4

import (
	"testing"
)

/*

Paths with Sum: You are given a binary tree in which each node contains an integer value (which might be positive or negative).
Design an algorithm to count the number of paths that sum to a given value.
	#ODB Files Location
	$binFolder = "C:\Projects\.net 2.0\build\bin"
	$gacFolder = "%SYSTEMROOT%\Assembly\GAC_MSIL"

	set-location $binFolder

	$pdbfiles = get-childitem \| where {$_.name.EndsWith("pdb")}
	foreach ($pdb in $pdbfiles)
	{
	package Helpers

	type Queue struct {
	q []int32
	}

	func (q *Queue) push(v int32) {
	q.q = append(q.q, v)
	}
	b := []byte("9856743210")

	fmt.Println("Before:", string(b))
	sort.Slice(b, func(i, j int) bool {
	return b[i] < b[j]
	})
	fmt.Println("After:", string(b))
	// Following implemetation of Stack tie each element to it parent
	type stackElement struct {
	data interface{}

	next *stackElement
	}

	type Stack struct {
	Size int32
	head *stackElement
	package DataStuctures

	import (
	"testing"
	)

	type MinHeap struct {
	heap []int32
	}
	package Google

	import "testing"

	// Find max number of connected colors in grid
	// https://proglib.io/p/google-interview-task/?fbclid=IwAR2PXn_XqXQx97U3FLSFssVfDa1-m2P-T3yAJELEJoOWpNfcQjfyesOegpY

	type si struct {
	r int
	c int
	/*
	First Common Ancestor: Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree.
	Avoid storing additional nodes in a data structure.
	NOTE: This is not necessarily a binary search tree.
	Hints: # 10, #16, #28, #36, #46, #70, #80, #96
	*/

	/*
	Создайте алгоритм и напишите код поиска первого общего предка двух узлов бинарного дерева. Постарайтесь избежать
	хранения дополнительных узлов в структуре данных.
	package Part_4

	import (
	"fmt"
	"testing"
	)

	/*
	BST Sequences: A binary search tree was created by traversing through an array from left to right and inserting each element.
	Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.