caspark

vscode_repeatable_action_map = {
    "join line": Key("csa-j"),

    # requires bracket jumper extension
    "klane": Key("ca-left"),
    "krane": Key("ca-right"),
    "krupper": Key("ca-up"),
    "krowner": Key("ca-down"),
    "shift klane": Key("csa-left"),
    "shift krane": Key("csa-right"),

caspark

# Problem:
# Given a binary search tree t with each node having properties left, right 
# (the left and right subtrees respectively) and value (the value of that 
# node) and an integer k, find the k-th smallest element in the BST using
# constant space.
#
# Example:
# t =
#    3
#  /   \

caspark

diff --git a/source_control/git.py b/source_control/git.py
index dc8fe20..943fa39 100644
--- a/source_control/git.py
+++ b/source_control/git.py
@@ -688,6 +688,10 @@ def main():
     # call run_command()
     module.run_command_environ_update = dict(LANG='C', LC_ALL='C', LC_MESSAGES='C', LC_CTYPE='C')
 
+    import time