Alex Glukhovtsev GlulkAlex

## zeroest_Temperature.scala
import math._
import scala.util._

/**
 * Created by Alex on 20.06.15.
 */
/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/

## string_Compression.scala
object Solution {

    def main(args: Array[String]) {
        /* Enter your code here.
        Read input from STDIN.
        Print output to STDOUT.
        Your class should be named Solution
        */
      ///>>> it seems that something faster than O(N) needed
      ///> QuickSortMerge may be ? O(N * log(N)) ???

## Least_common_multiple.ipynb

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                GlulkAlex
                / Least_common_multiple.ipynb
            
            
              Last active
              June 3, 2016 17:41
            
              
                Least_common_multiple
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## SumOfDivisors.py
import sys
import math

# Auto-generated code below aims at helping you parse
# the standard input according to the problem statement.

n = int(input())

# Write an action using print
# To debug: print("Debug messages...", file=sys.stderr)

## odd_XOR_Filter.py
def lonely_Integer(
  b: list# of int
) -> int:
    so_Far = set()
    answer = 0

    for n in b:
      if n in so_Far:
        so_Far.discard(n)
      else:

## Capitalize.py
#!/usr/bin/env python
# -*- coding: utf-8 -*-

#utf_8 U8, UTF, utf8

"""Capitalize.py:

interactive Python sessions for doctest
must be in the `right` place
in order to be executed

## hackerRank_IO_handler.scala
object Solution extends App{

  import scala.annotation.tailrec
  import scala.io.StdIn
  import scala.util.{Try, Success, Failure}
  import scala.math.pow//{abs, pow, ceil, floor}


  // as replacement of this Java styled code
    /*

## binary_Tree__Build_N_Print.scala
#!/usr/bin/env scala
// for The `bash` `shell script` './script.sh'
//
//import scala.math.{log, ceil}
import io.AnsiColor._
// or
//import Console.{GREEN, RED, RESET, YELLOW_B, UNDERLINED}
//
//
// ? Is something wrong with:

## balanced_Binary_Search_Tree.js
"use strict";
//
var binary_Search_Tree_Name_Space = {};
  //
  // Done: implement `get_UnBalanced_Sub_Tree`
  // recursive, but not @tail recursive | stack safe
  // traversal from top to bottom
  /** it must return:
  - [unBalanced_Sub_Tree object, balance_Factor] if any
  - or [null, 0] if not found|search fails

## digital_Circuit_Logic_Gates.scala
#!/usr/bin/env scala
// for The `bash` `shell script` './script.sh'
// but App main object warper must be disabled|excluded
import scala.io.AnsiColor._
// it is imported twice in the same scope by
//import scala.Console._
//
//
/*object digital_Circuit_Logic_Gates extends App */{
  /* A digital circuit is composed
	import math._
	import scala.util._

	/**
	* Created by Alex on 20.06.15.
	*/
	/**
	* Auto-generated code below aims at helping you parse
	* the standard input according to the problem statement.
	**/
	object Solution {

	def main(args: Array[String]) {
	/* Enter your code here.
	Read input from STDIN.
	Print output to STDOUT.
	Your class should be named Solution
	*/
	///>>> it seems that something faster than O(N) needed
	///> QuickSortMerge may be ? O(N * log(N)) ???
	import sys
	import math

	# Auto-generated code below aims at helping you parse
	# the standard input according to the problem statement.

	n = int(input())

	# Write an action using print
	# To debug: print("Debug messages...", file=sys.stderr)
	def lonely_Integer(
	b: list# of int
	) -> int:
	so_Far = set()
	answer = 0

	for n in b:
	if n in so_Far:
	so_Far.discard(n)
	else:
	#!/usr/bin/env python
	# -- coding: utf-8 --

	#utf_8 U8, UTF, utf8

	"""Capitalize.py:

	interactive Python sessions for doctest
	must be in the `right` place
	in order to be executed
	object Solution extends App{

	import scala.annotation.tailrec
	import scala.io.StdIn
	import scala.util.{Try, Success, Failure}
	import scala.math.pow//{abs, pow, ceil, floor}


	// as replacement of this Java styled code
	/*
	#!/usr/bin/env scala
	// for The `bash` `shell script` './script.sh'
	//
	//import scala.math.{log, ceil}
	import io.AnsiColor._
	// or
	//import Console.{GREEN, RED, RESET, YELLOW_B, UNDERLINED}
	//
	//
	// ? Is something wrong with:
	"use strict";
	//
	var binary_Search_Tree_Name_Space = {};
	//
	// Done: implement `get_UnBalanced_Sub_Tree`
	// recursive, but not @tail recursive \| stack safe
	// traversal from top to bottom
	/** it must return:
	- [unBalanced_Sub_Tree object, balance_Factor] if any
	- or [null, 0] if not found\|search fails
	#!/usr/bin/env scala
	// for The `bash` `shell script` './script.sh'
	// but App main object warper must be disabled\|excluded
	import scala.io.AnsiColor._
	// it is imported twice in the same scope by
	//import scala.Console._
	//
	//
	/object digital_Circuit_Logic_Gates extends App /{
	/* A digital circuit is composed