Every week, we feature the type of brain-teasing question that might be asked in a full-stack developer's job interview at places such as Google and Facebook.
每个星期，我们都会提供这样的大脑挑逗的问题， 这个问题可能会在谷歌和Facebook等地方的全套开发人员的面试中提出。
https://discuss.codecademy.com/t/challenge-max-product-finder/113074
This week's challenge was reported to have been asked in interviews at Google:
据报道，本周的挑战在Google的采访中被要求：
Given an array of integers, write a function, maxProductFinder, that finds the largest product that can be obtained from any 3 integers in the array.
给定一个整数数组，写一个函数 maxProductFinder，它找到可以从数组中的任何3个整数获得的最大的乘积。
https://discuss.codecademy.com/t/extra-information-on-challenges/83909#basic
Given an array of integers, write a function, maxProductFinderK, that can be obtained from any k integers in the array.
给定整数数组，写一个函数maxProductFinderK，可以从数组中的任何k个整数获得。
Write maxProductFinder and maxProductFinderK as efficiently as possible.
尽可能高效地编写 maxProductFinder和 maxProductFinderK。
//https://discuss.codecademy.com/t/code-challenges-in-interviews/82161
https://rollbar.com/Xray/Full-Stack-WebApp/items/11/
https://blog.codeship.com/getting-node-js-testing-and-tdd-right/
https://github.com/jiacai2050/you-paint-i-guess
graphql
https://github.com/samerbuna
https://github.com/ufo-github/react-bb
https://github.com/samerbuna/learning-graphql
https://github.com/mugli/learning-graphql