Collin Shoop CollinShoop

## Cracking the Coding Interview: URLIfy (solution)
func URLify(input []rune, l int) {
	i := len(input)-1 // insert pointer, start as the last index of the input array
	l-- // reading pointer, start at the end of the input string
	for l >= 0 {
		if input[l] == ' ' {
			input[i-2] = '%'
			input[i-1] = '2'
			input[i] = '0'
			i -= 3
		} else {

## Cracking the Coding Interview: URLIfy (unsolved)
package main

import "fmt"

/**
	URLIfy: Write a method to replace all spaces in a string with '%20'. You may assume that the string
	has sufficient space at the end to hold the additional characters, and that you are given the "true" length
	of the string.
 */

## Leetcode: 235. Lowest Common Ancestor of a Binary Search Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val   int
 *     Left  *TreeNode
 *     Right *TreeNode
 * }
 */
func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
    if root == nil {

## Leetcode: 653. Two Sum IV - Input is a BST
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func findTarget(root *TreeNode, k int) bool {
    vals := map[int]bool{}

## Leetcode: 98. Validate Binary Search Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isValidBST(root *TreeNode) bool {
    if root == nil {

## Leetcode: 700. Search in a Binary Search Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func searchBST(root *TreeNode, val int) *TreeNode {
    if root == nil || root.Val == val {

## Leetcode: 112. Path Sum
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func hasPathSum(root *TreeNode, targetSum int) bool {
    var helper func(root *TreeNode, sum int) bool

## Leetcode: 226. Invert Binary Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func invertTree(root *TreeNode) *TreeNode {
    if root == nil {

## Leetcode: 101. Symmetric Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isSymmetric(root *TreeNode) bool {
    if root == nil {

## Leetcode: 104. Maximum Depth of Binary Tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func maxDepth(root *TreeNode) int {
    if root == nil {
	func URLify(input []rune, l int) {
	i := len(input)-1 // insert pointer, start as the last index of the input array
	l-- // reading pointer, start at the end of the input string
	for l >= 0 {
	if input[l] == ' ' {
	input[i-2] = '%'
	input[i-1] = '2'
	input[i] = '0'
	i -= 3
	} else {
	package main

	import "fmt"

	/**
	URLIfy: Write a method to replace all spaces in a string with '%20'. You may assume that the string
	has sufficient space at the end to hold the additional characters, and that you are given the "true" length
	of the string.
	*/
	/**
	* Definition for a binary tree node.
	* type TreeNode struct {
	* Val int
	* Left *TreeNode
	* Right *TreeNode
	* }
	*/
	func lowestCommonAncestor(root, p, q TreeNode) TreeNode {
	if root == nil {