CareerCup

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            var root = new Node(7);
            root.Right = new Node(15);
            root.Left = new Node(3);
            
            root.Right.Right = new Node(20);
            root.Right.Left = new Node(10);
            
            root.Left.Right = new Node(5);
            root.Left.Left = new Node(1);
            
            var result = GetNearestElement(root, 4, root, int.MaxValue);
            
            if (result != null)
            {
                Console.WriteLine("Element Found ->  {0}", result.Value);
            }
            else
            {
                Console.WriteLine("No Element was Found ");
            }
            
            
            
        }
        
        public static Node GetNearestElement(Node root, int val, Node nearestNode, int diff)
        {
            if (root.Value == val)
                return root;
            
            if (Math.Abs(root.Value - val) < diff)
            {
                nearestNode = root;
                diff = Math.Abs(root.Value - val);
            }
            
            if (root.Value > val && root.Left != null)
                return GetNearestElement(root.Left, val, nearestNode, diff);
            else if (root.Value < val && root.Right != null)
                return GetNearestElement(root.Right, val, nearestNode, diff);
                
            else
            {
                return nearestNode;
            }
        }
        
        
    }
    
    public class Node
    {
        public int Value{ get; set;}
        public Node Right{ get; set;}
        public Node Left{ get; set;}
        
        public Node(int val)
        {
            this.Value = val;
        }
        
    }
}

public class Program
    {
        public static void Main(string[] args)
        {
            var dict = new Dictionary<string, int>();
            dict.Add("a", 1);
            dict.Add("aa", 1);
            dict.Add("aaa", 1);
            
            var input = "aaabaa";
            
            get_combinations(input, dict);
            
        }
        
        public static void get_combinations(string input, Dictionary<string, int> dict)
        {
            for (int i = 0; i < input.Length; i++)
            {
                for (int j = i ; j < input.Length ; j++)
                {
                    if (dict.ContainsKey(input.Substring(i, j-i+1)))
                    {
                        Console.WriteLine(input.Substring(i, j-i+1));
                    }
                }
            }
        }
    }

import copy 

def get_sets_of_sum(numbers, k, possible_set, result):
    if k == 0:
        if sorted(possible_set) not in result :
            result.append( sorted(possible_set))
    elif k < 0:
        return
    else: 
        for n in numbers:
            new_set = copy.copy(possible_set)
            new_set.append(n)
            
            new_numbers = copy.copy(numbers)
            new_numbers.remove(n)
            
            get_sets_of_sum(new_numbers, k-n, new_set, result)
        
        
k = 10
possible_set = []
numbers = list(range(1,10))
result = []
get_sets_of_sum(numbers, k, possible_set, result)

for r in result:
    print(r)