Skip to content

Instantly share code, notes, and snippets.

View GlulkAlex's full-sized avatar
🏠
Working from home

Alex Glukhovtsev GlulkAlex

🏠
Working from home
View GitHub Profile
@GlulkAlex
GlulkAlex / odd_XOR_Filter.py
Created June 9, 2016 15:37
filter sequence of odd integer elements using bitwise exclusive or
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:
@GlulkAlex
GlulkAlex / SumOfDivisors.py
Created June 7, 2016 14:03
Sum_Of_Divisors
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)
@GlulkAlex
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.
@GlulkAlex
GlulkAlex / string_Compression.scala
Last active May 5, 2016 12:58
Functional Programming: Recursion, Divide and Conquer, String Parsing, 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)) ???
@GlulkAlex
GlulkAlex / zeroest_Temperature.scala
Last active May 5, 2016 09:36
Functional Programming: Recursion, 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.
**/