ngshaohui

#Helper function for the getNearest function
#isOdd should start as true (counting first level as 1)
#curNode starts from root
#searches for nearest stop to query that is not already in the blacklist
def getNearestH(self, curNode, isOdd, queryPoint, champion, blacklist):

    if curNode == None: #base case
        return champion
    else: #get distance of queryPoint to current stop
        stopLocation = (curNode.data["Latitude"], curNode.data["Longitude"])

ngshaohui

Just Console Log

Aspects of this challenge

• reverse engineering + crypto
• re: source is obfuscated with bad variable and function names
• crypto: aes library is imported, and CBC method is called
• need to understand javascript scoping

Stepping through the problem

1. Identify unused code

ngshaohui

import { KDTree, DistanceFunc } from './KDTree'
import { expect } from 'chai'
import 'mocha'

interface Point {
  x: number
  y: number
}

const pointList: Point[] = [