CareerCup

package main

import (
	"fmt"
)

type Tree struct {
	val   int
	left  *Tree
	right *Tree
}

func findSequence(root *Tree) []int {
	lTry := findSequenceHelper(root.left)
	rTry := findSequenceHelper(root.right)
	var res []int
	if len(lTry) > len(rTry) {
		res = lTry
	} else {
		res = rTry
	}
	cTry := findSequenceHelper(root)
	if len(cTry) > len(res) {
		res = cTry
	}
	return res
}

func findSequenceHelper(root *Tree) []int {
	res1 := lessSequence(root.left, root.val)
	res1 = append(res1, root.val)
	res1 = append(res1, graterSequence(root.right, root.val)...)
	res2 := graterSequence(root.left, root.val)
	res2 = append([]int{root.val}, res2...)
	res2 = append(res2, lessSequence(root.right, root.val)...)
	if len(res1) > len(res2) {
		return res1
	} else {
		return res2
	}
}

func lessSequence(root *Tree, max int) []int {
	if root == nil || root.val != max-1 {
		return []int{}
	}
	lTry := lessSequence(root.left, root.val)
	rTry := lessSequence(root.right, root.val)
	if len(lTry) > len(rTry) {
		return append(lTry, root.val)
	} else {
		return append(rTry, root.val)
	}
}

func graterSequence(root *Tree, min int) []int {
	if root == nil || root.val != min+1 {
		return []int{}
	}
	lTry := graterSequence(root.left, root.val)
	rTry := graterSequence(root.right, root.val)
	res := []int{root.val}
	if len(lTry) > len(rTry) {
		return append(res, lTry...)
	} else {
		return append(res, rTry...)
	}
}

func main() {
	root := &Tree{
		val: 2,
		left: &Tree{
			val: 1,
			left: &Tree{
				val: 0,
				left: &Tree{
					val: 10,
				},
				right: &Tree{
					val: -1,
				},
			},
		},
		right: &Tree{
			val: 3,
			left: &Tree{
				val: 4,
				right: &Tree{
					val: 5,
					left: &Tree{
						val: 6,
					},
				},
			},
			right: &Tree{
				val: 7,
			},
		},
	}
	fmt.Println(findSequence(root))
}

<?php

$binary=[2=>2];

$binary[2]=[1=>1,3=>3];

$binary[2][1]=[0=>0];
$binary[2][1][0]=10;

$binary[2][3]=[4=>4,7=>7,5=>5];


echo '<pre>';
print_r($binary);
$result=array_unique(itrate($binary,[]));
//array_unique(($binary);
sort($result);

calculateLongSeq($result);


function calculateLongSeq($arr){

$max_seq=[];
$seq=$arr[0];
$count=0;
for($i=0;$i<count($arr);$i++){

if($seq==$arr[$i]){
$count++;
$seq++;
}
else{
$max_seq[]=$count;
$count=0;
$seq=$arr[$i];
}
}

echo max($max_seq);
exit();
}

function itrate($binary,$result){

foreach ($binary as $key => $value) {

array_push($result,$key);

if(is_array($value)){
$result=array_merge($result,itrate($value,$result));
}
else{
array_push($result,$value);
}
}

return $result;
}

<?php

$binary=[2=>2];

$binary[2]=[1=>1,3=>3];

$binary[2][1]=[0=>0];
$binary[2][1][0]=10;

$binary[2][3]=[4=>4,7=>7,5=>5];


echo '<pre>';
print_r($binary);
$result=array_unique(itrate($binary,[]));
//array_unique(($binary);
sort($result);

calculateLongSeq($result);


function calculateLongSeq($arr){

	$max_seq=[];
	$seq=$arr[0];
	$count=0;
	for($i=0;$i<count($arr);$i++){
	
		if($seq==$arr[$i]){
			$count++;
			$seq++;
		}
		else{
			$max_seq[]=$count;
			$count=0;
			$seq=$arr[$i];
		}
	}

	echo max($max_seq);
	exit();
}

function itrate($binary,$result){
	
	foreach ($binary as $key => $value) {

		array_push($result,$key);
		
		if(is_array($value)){
			$result=array_merge($result,itrate($value,$result));
		}
		else{
			array_push($result,$value);
		}
	}

	return $result;
}