Skip to content

Instantly share code, notes, and snippets.

View ntkhoi's full-sized avatar
🇻🇳

KhoiNguyen ntkhoi

🇻🇳
  • TVConnal
  • Hoi An, Viet Nam
View GitHub Profile
@ntkhoi
ntkhoi / data.json
Last active April 5, 2026 05:16
Ball speed timeline - live
[
{
"match_id": "3",
"inning": 2,
"over": 19,
"ball": 6,
"bowler_id": null,
"timestamp_utc": "2026-04-05T13:15:05.625286+08:00",
"speed_kph": 127.07,
"release_point_m": null,
import UIKit
typealias PromoteType = (Order) -> (Float)
class Customer {
let fidelity: Int
let name: String
init(name: String,fidelity: Int) {
import UIKit
typealias PromoteType = (Order) -> (Float)
class Customer {
let fidelity: Int
let name: String
init(name: String,fidelity: Int) {
" setup for neovim
call plug#begin()
Plug 'scrooloose/nerdtree'
Plug 'vim-airline/vim-airline'
"Code Completion"
if has('nvim')
Plug 'Shougo/deoplete.nvim', { 'do': ':UpdateRemotePlugins' }
@ntkhoi
ntkhoi / KthSmallestInSet.java
Last active December 7, 2019 16:15
kth Smallest element in set
import java.util.Random;
class KSmallestElementInset {
public static void main(String[] args) {
int[] arr = new int[] { 6,4,5,1,2,8,9,10,11,16,31 };
int result = kThSmallest(arr,0,arr.length - 1,4);
System.out.println(String.format("Result %d" ,result));
}
@ntkhoi
ntkhoi / quicksort.java
Created December 7, 2019 10:23
Quick sort
// 7.1 Description of quicksort CLRS
class Main {
public static void main(String[] args) {
int[] arr = new int[]{7,1,3,5,2,6,4 };
quickSort(arr, 0, arr.length -1);
for(int i = 0 ; i < arr.length ; i ++) {
System.out.print(arr[i]);
}
}
@ntkhoi
ntkhoi / introrx.md
Created July 8, 2017 15:29 — forked from staltz/introrx.md
The introduction to Reactive Programming you've been missing
@ntkhoi
ntkhoi / introrx.md
Created July 8, 2017 15:29 — forked from staltz/introrx.md
The introduction to Reactive Programming you've been missing

Videos