Skip to content

Instantly share code, notes, and snippets.

SF, hacking, thinking, observing, feeling

Anton Podviaznikov podviaznikov

SF, hacking, thinking, observing, feeling
Block or report user

Report or block podviaznikov

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
  • Jump to Beginning of Line – Control+A
  • Jump to End of Line – Control+E
  • Go to Next Line – Control+N
  • Go to Previous Line – Control+P
  • Delete Previous Word – Control+W
  • Delete Line from Cursor to Beginning – Control+U
  • Delete Line from Cursor to End – Control+K
  • Cut from Cursor to Beginning of Line – Control+U
  • Cut from Cursor to End of Line – Control+K
  • Paste Previously Cut Text at Cursor – Control+Y

Keybase proof

I hereby claim:

  • I am podviaznikov on github.
  • I am podviaznikov ( on keybase.
  • I have a public key whose fingerprint is ED55 74C1 1394 8860 7EA1 C228 879F 60AE EC4D D532

To claim this, I am signing this object:

Verifying myself: My Bitcoin username is +podviaznikov.
View pascaltriangle.clj
(defn pascaltriangle-iter [row col]
(if (or (= col 1) (= col row))
(pascaltriangle-iter (- row 1) (- col 1))
(pascaltriangle-iter (- row 1) col))))
(defn pascaltriangle-row [row]
(for [i (range 1 (+ 1 row))]
(pascaltriangle-iter row i)))
View nginx.txt
podviaznikov / fibonacci.clj
Created Oct 30, 2013
Fibonacci implementation on Clojure.
View fibonacci.clj
(defn fib-iter [a b n]
(if (zero? n)
(recur (+ a b) a (dec n))))
(defn fib [n]
(fib-iter 1 0 n))
(fib 40) ;102334155
podviaznikov / gdc.clj
Created Oct 30, 2013
The greatest common divisor (GCD) of two integers: x and y. Clojure implementation.
View gdc.clj
(defn gdc [x y]
(if (= x y)
(if (> x y)
(recur (- x y) y)
(recur (- y x) x))))
(gdc 10, 100) ; 10
podviaznikov / quicksort.clj
Last active Dec 26, 2015
Quicksort implemented in Clojure
View quicksort.clj
(defn qpart [data p]
(reduce (fn [acc item]
(< item p) (assoc acc :left (conj (:left acc) item))
(> item p) (assoc acc :right (conj (:right acc) item))
:else (assoc acc :ps (conj (:ps acc) item))))
{:left [] :right [] :ps []} data))
podviaznikov / lonelyinteger.clj
Last active Dec 26, 2015
Find integer without a pair in the sequence. Clojure implementation.
View lonelyinteger.clj
(defn finditemwithoutpair [data]
(if (= 1 (count data))
(first data)
(if (= (first data) (second data))
(finditemwithoutpair (drop 2 data))
(first data))))
You can’t perform that action at this time.