shurane

function numToBinaryString(num, padding=8) {
    const n = num.toString(2);
    const paddedString = "0".repeat(padding);
    return paddedString.substr(n.length) + n;
}

for (let i = 0; i < 20; i++){
    console.log(i, numToBinaryString(i));
}

shurane

*.log
package-lock.json
node_modules/

secrets.js

shurane

// https://stackoverflow.com/questions/6259982/how-do-you-use-the-conditional-operator-in-javascript

shurane

Leetcode List: https://leetcode.com/list/x55fznh6

From Rajib and Ehtesh:

• https://leetcode.com/problems/search-in-rotated-sorted-array/
• https://leetcode.com/problems/find-minimum-in-rotated-sorted-array
• https://leetcode.com/problems/search-a-2d-matrix-ii
• https://leetcode.com/problems/squares-of-a-sorted-array

From Rajib and Madhura:

• https://leetcode.com/problems/maximum-subarray/

shurane

using System;
using System.Net.Http;
using System.Web;

namespace ElasticSearchRequests
{
    class Program
    {
        static void Main(string[] args)
        {

shurane

# Definition for a binary tree node.
class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
    def __repr__(self):
        return "TreeNode({})".format(self.val)

# see https://www.geeksforgeeks.org/lowest-common-ancestor-binary-tree-set-1/ for tips

shurane

import React, { Component } from 'react';
import { debounce } from 'lodash';

class SearchBox extends Component {
  constructor(props) {
    super(props);
    this.state = {value: ''};

    // https://stackoverflow.com/a/28046731/198348
    // this.handleChange = this.handleChange.bind(this);

shurane

<?xml version="1.0" encoding="utf-8" ?>
<configuration>
  <system.diagnostics>
    <trace autoflush="false" indentsize="4">
      <listeners>
        <remove name="Default" />
        <add name="consoleListener" type="System.Diagnostics.ConsoleTraceListener"/>
      </listeners>
    </trace>
  </system.diagnostics>

shurane

"*":
  core:
    disabledPackages: [
      "spell-check"
    ]
    telemetryConsent: "limited"
  editor:
    fontSize: 16
    invisibles: {}
    lineHeight: 1.2

shurane

import random
# import blessings
# term = blessings.Terminal()

# this looks suspiciously a lot like the fisher yates algorithm
lst = range(30)


# def colorized(lst, yellows=[]):
    # result = "["