Skip to content

Instantly share code, notes, and snippets.

View aceisScope's full-sized avatar
:octocat:

Binghui Liu aceisScope

:octocat:
View GitHub Profile
/* ACTUAL IMPLEMENTATION */
const responseToTimeseries = (response) => {
// your implementation goes here
// find the earliest and latest timestamp in the time series.
// assuming any time point can be missing from the input, even the earliest one.
let earliest = Infinity, latest = 0;
response.forEach((input) => {
if (input.data && input.data.length > 0) {
const first = input.data[0][0];

Practice Exam Attempt (3) Carefully taken with notes

Got an 16/20 on the latest practice exam. Missed questions 5, 7, 12, 13.

Summary of why missed each question:

5
always favor simpler method (cbt (cloud big query tool) vs hbase cli) … I feel uneasy with this answer
7
prefer simpler method. pub/sub more than capable. kafka is overkill. this question showed my lack of knowledge of pub/sub capabilities
@aceisScope
aceisScope / RSAKeyPairManager.m
Last active August 29, 2015 14:27
RSAKeyPairManager
//
// KeyPairManager.m
// KeyPair
//
// Created by Liu Binghui on 15/06/15.
// Copyright (c) 2015 HUT. All rights reserved.
//
#import "RSAKeyPairManager.h"
#import <Security/Security.h>