I hereby claim:
- I am hofmannz on github.
- I am hofmannz (https://keybase.io/hofmannz) on keybase.
- I have a public key ASDAJa7jxk8VtwNj4CKAVAEl3jjZm5HNB1MrRqgaMe4SFQo
To claim this, I am signing this object:
/* | |
Author: | |
Zino Hofmann, 11327650, zino@hofmann.amsterdam | |
Description: | |
A prolog knowledge base with 7832 distances in kilometers between 89 dutch cities from the cities.pl knowledge base. | |
cities.pl: | |
https://gist.github.com/HofmannZ/174b3cea734ae4c5761a67266edfe67d | |
/* | |
Author: | |
Zino Hofmann, 11327650, zino@hofmann.amsterdam | |
Description: | |
A prolog knowledge base with 89 dutch cities and their coordinates. | |
Usage: | |
city( +Name, -Latitude, -Longitude). | |
*/ |
I hereby claim:
To claim this, I am signing this object:
During this 45-minute video call, you will be asked to complete three coding exercises. You're encouraged to discuss your thought process, the trade-offs you consider, and the complexity of your solutions. We are using TypeScript and Node.js for our stack, so please ensure your solutions are compatible with these technologies.
Given an array of n
objects, each with properties id
(a unique integer) and timestamp
(a JavaScript Date
object), write a function to sort the array. The primary sort key should be timestamp
(oldest to newest), and the secondary key (in case of ties) should be id
(smallest to largest).