I hereby claim:
- I am kjknair on github.
- I am jknair (https://keybase.io/jknair) on keybase.
- I have a public key ASBEVlDN-djwPyaPhvpBe5JsEgQVuFkWQgIN_RxJCWNTPQo
To claim this, I am signing this object:
| import java.io.BufferedReader; | |
| import java.io.File; | |
| import java.io.FileReader; | |
| import java.io.IOException; | |
| import java.util.ArrayList; | |
| import java.util.Comparator; | |
| import java.util.HashMap; | |
| import java.util.HashSet; | |
| import java.util.List; | |
| import java.util.Locale; |
| // https://www.cs.cmu.edu/~15451-f18/lectures/lec19-DFS-strong-components.pdf | |
| import java.util.*; | |
| class Graph { | |
| ArrayList<Integer>[] graph; | |
| public Graph(int n) { | |
| graph = new ArrayList[n]; |
| // https://www.cs.cmu.edu/~15451-f18/lectures/lec19-DFS-strong-components.pdf | |
| import java.util.*; | |
| class Graph { | |
| ArrayList<Integer>[] graph; | |
| public Graph(int n) { | |
| graph = new ArrayList[n]; |
| // https://www.cs.cmu.edu/~15451-f18/lectures/lec19-DFS-strong-components.pdf | |
| import java.util.*; | |
| class Graph { | |
| ArrayList<Integer>[] graph; | |
| public Graph(int n) { | |
| graph = new ArrayList[n]; |
| /* | |
| * Copyright (c) 2021 JayaKrishnan Nair K | |
| * All rights reserved. | |
| */ | |
| package tech.jknair.uibase.utils | |
| import kotlin.properties.ObservableProperty | |
| import kotlin.properties.ReadWriteProperty | |
| import kotlin.reflect.KProperty |
| import matplotlib.pyplot as plt | |
| from matplotlib import animation, rc | |
| rc('animation', html='html5') | |
| def calculateY(x, W, b): | |
| return x * W + b | |
| def calculate_all_predictions(x, W, b): | |
| return list(map(lambda xx: calculateY(xx, W, b), x)) |
| import java.util.Arrays; | |
| class QuickSort { | |
| public static void main(String[] args) { | |
| QuickSort quickSort = new QuickSort(); | |
| int[] input = new int[]{ | |
| 26690, 701, 126, 248845, 17, | |
| 54016, 71347, 99457, 134932, | |
| 1754, 2241, 2957, 3732, 4, |
| import java.util.Arrays; | |
| class BinarySearch { | |
| public int search(int[] input, int searchInput) { | |
| int n = input.length; | |
| if (n == 0) { | |
| return -1; | |
| } | |
| int midPoint = n / 2; |
I hereby claim:
To claim this, I am signing this object:
| #!/bin/bash | |
| git config core.hooksPath .githooks | |
| chmod +x ./.githooks/* | |
| echo "Successfully added git-hooks!" |