stepbrobd

import argparse
import csv
import gzip
import urllib.request


def main() -> None:
    parser = argparse.ArgumentParser()
    parser.add_argument("file", type=argparse.FileType("r"))
    parser.add_argument("auth", type=str)

stepbrobd

{
  inputs = {
    nixpkgs.url = "github:nixos/nixpkgs/nixos-unstable";
    parts.url = "github:hercules-ci/flake-parts";
    nixgl.url = "github:nix-community/nixgl";
  };

  outputs = inputs @ { self, nixpkgs, parts, nixgl }: parts.lib.mkFlake { inherit inputs; } {
    systems = [ "aarch64-darwin" "x86_64-darwin" "x86_64-linux" ];

stepbrobd

"""
Problem:
Given an immutable tree (where each node is identified by a unique ID and contains a list of children),
write a function to process queries that ask for the n-th parent (iteratively climbing upwards) of a node.
Preprocessing is allowed (in below code, all lines that are used to populating cache are considered as preprocessing),
want fastest average query time, allow some space complexity.

Time complexity: O(log(n))
Space complexity: O(n*log(n))
"""

stepbrobd

import requests
import json
import time
import argparse
import sys
import webbrowser
import urllib.parse
from difflib import SequenceMatcher
from typing import Dict, Optional

stepbrobd

{
  inputs.nixpkgs.url = "github:nixOS/nixpkgs/nixos-unstable";
  inputs.systems.url = "github:nix-systems/default";
  inputs.parts.url = "github:hercules-ci/flake-parts";
  inputs.parts.inputs.nixpkgs-lib.follows = "nixpkgs";

  inputs.nixpkgs-dask.url = "github:nixOS/nixpkgs/a42717b875f8d9da831ed7a8ceab1dc986ce518b"; # 2024.6.0
  inputs.nixpkgs-ray.url = "github:nixOS/nixpkgs/4f6c942f7a68ee2c05832531d42370c6268e7ff1"; # 2.47.1

  outputs = inputs: inputs.parts.lib.mkFlake { inherit inputs; } {