meetKazuki

import fs from 'fs';
import path from 'path';
import { exec } from 'child_process';

enum KnexMigrationType {
  Id = 'uuid',
  String = 'string',
  Number = 'integer',
  Float = 'float',
  Array = 'enum',

meetKazuki

        UserData:
          "Fn::Base64": !Sub |
            #!/bin/bash
            yum install ruby -y
            wget https://aws-codedeploy-${AWS::Region}.s3.${AWS::Region}.amazonaws.com/latest/install
            chmod +x ./install
            ./install auto
            cd /tmp
            yum install -y https://s3.amazonaws.com/ec2-downloads-windows/SSMAgent/latest/linux_amd64/amazon-ssm-agent.rpm
            systemctl enable amazon-ssm-agent

meetKazuki

(*
  WIP: This solution uses recursive factorial definition.
  At the moment, this solution does not satisfy the complete requirements
  of the problem statement. If I'm given enough time, I can implement a
  solution that will match the specifications.
*)

program factorial;

function factorial(number: integer): longint;

meetKazuki

Pushing to Multiple Git Repos

If a project has to have multiple git repos (e.g. Bitbucket and Github) then it's better that they remain in sync.

Usually this would involve pushing each branch to each repo in turn, but actually Git allows pushing to multiple repos in one go.

If in doubt about what git is doing when you run these commands, just

meetKazuki

makeInvestment: async () => {
      /* 
        add this script inside your page head tag <script async src="https://js.paystack.co/v1/inline.js" />  
        this will make the PasystackPop available
       */

      const handler = PaystackPop.setup({
        key: process.env.PAYSTACK_LIVE_API,
        email: 'user@example.com',

meetKazuki

'use strict';

// Dependencies
const gcloud = require('google-cloud', {
  projectId: 'sara-bigquery',
  keyfileName: 'keyfile.json'
});
const vision = gcloud.vision();
const fs = require('fs');
const async = require('async');

meetKazuki

{
  "$schema": "https://aka.ms/terminal-profiles-schema",
  "globals": {
    "alwaysShowTabs": true,
    "defaultProfile": "{79285a8e-036c-446f-8a9c-78994e34cf85}",
    "initialCols": 120,
    "initialRows": 30,
    "requestedTheme": "dark",
    "keybindings": [
      {

meetKazuki

/**
 * Write a function that counts how many different ways you can make
 * change for an amount of money, given an array of coin denominations.
 * 
 * The order of coins does not matter
 */
function countChange(money, coins) {
  let waysOfDoingNcents = [];
  for (let i = 0; i <= money; i++)
    waysOfDoingNcents[i] = 0;