Andrei K akost

## akost.zsh-theme
# akost zsh theme

function get_pwd() {
  print -D $PWD
}

function precmd() {
print -rP '
$fg_bold[green]%m$fg[white]:$(get_pwd)$reset_color $(git_prompt_info)'
}

## kids-20-inch-bike.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                akost
                / kids-20-inch-bike.md
            
            
              Last active
              April 2, 2019 04:48
            
              
                Kids 20" Bike Research
              
          
    Kids' 20" inch bikes research (October 2018).
Requirements:

Good brand
Hand brakes (not a coaster brake)
Reasonable price
Multiple gears (except Cleary Bikes Owl)

Results:

  
## dfs-inorder.py
"""
Depth-First Search for binary tree
In-order traversal
"""

import unittest

class Node(object):
    def __init__(self, data = None, left = None, right = None):
        self.data = data

## bfs.py
"""
Breadth-First Search for binary tree
"""

import unittest

class Node(object):
    def __init__(self, data = None, left = None, right = None):
        self.data = data
        self.left = left

## str_to_int.py
"""
Convert string to integer
"""
import unittest

class TestStringMethods(unittest.TestCase):

    def test1(self):
        self.assertEqual(myInt("123"), 123)

## str_to_int.py
"""
Convert string to integer
"""
import unittest

class TestStringMethods(unittest.TestCase):

    def test1(self):
        self.assertEqual(myInt("123"), 123)

## cycle_detection.py
"""
Detect a cycle in a linked list. Note that the head pointer may be 'None' if the list is empty.

A Node is defined as:

    class Node(object):
        def __init__(self, data = None, next_node = None):
            self.data = data
            self.next = next_node
"""

## hours.php
<?php echo ($i <= 12) ? $i : (($i <= 24) ? ($i - 12) : ($i - 24)) ?><?php echo $i < 12 ? 'am' : ($i > 23) ? 'am' : 'pm' ?>

## gist:b1fc7189ea5dc291b79e
javascript:(function(){function%20read(url){var%20r=new%20XMLHttpRequest();r.open('HEAD',url,false);r.send(null);return%20r.getAllResponseHeaders();}alert(read(window.location))})();

## godaddy-ssl-howto
openssl req -new -newkey rsa:2048 -nodes -keyout yourdomain.key -out yourdomain.csr

http://support.godaddy.com/help/article/3601/generating-a-certificate-signing-request-nginx
http://support.godaddy.com/help/article/4976/rekeying-an-ssl-certificate

# Be sure to remember to chain them!
cat gd_bundle-g2-g1.crt >> yourdomain.crt

# Move 'em
sudo mv yourdomain.crt /etc/ssl/certs/yourdomain.crt
	# akost zsh theme

	function get_pwd() {
	print -D $PWD
	}

	function precmd() {
	print -rP '
	$fg_bold[green]%m$fg[white]:$(get_pwd)$reset_color $(git_prompt_info)'
	}
	"""
	Depth-First Search for binary tree
	In-order traversal
	"""

	import unittest

	class Node(object):
	def __init__(self, data = None, left = None, right = None):
	self.data = data
	"""
	Breadth-First Search for binary tree
	"""

	import unittest

	class Node(object):
	def __init__(self, data = None, left = None, right = None):
	self.data = data
	self.left = left
	"""
	Convert string to integer
	"""
	import unittest

	class TestStringMethods(unittest.TestCase):

	def test1(self):
	self.assertEqual(myInt("123"), 123)
	"""
	Detect a cycle in a linked list. Note that the head pointer may be 'None' if the list is empty.

	A Node is defined as:

	class Node(object):
	def __init__(self, data = None, next_node = None):
	self.data = data
	self.next = next_node
	"""
	openssl req -new -newkey rsa:2048 -nodes -keyout yourdomain.key -out yourdomain.csr

	http://support.godaddy.com/help/article/3601/generating-a-certificate-signing-request-nginx
	http://support.godaddy.com/help/article/4976/rekeying-an-ssl-certificate

	# Be sure to remember to chain them!
	cat gd_bundle-g2-g1.crt >> yourdomain.crt

	# Move 'em
	sudo mv yourdomain.crt /etc/ssl/certs/yourdomain.crt