chore: format files

pull/302/head
Yangshun Tay 2 years ago
parent 4beb2ac50f
commit 598a0dc39a

@ -105,7 +105,7 @@ Advanced problem solving signals:
| --- | --- |
| Strong hire | No trouble achieving all basic problem solving signals and did so with enough time to achieve most advanced problem solving signals. |
| Leaning hire | Managed to achieve all basic problem solving signals but did not have sufficient time to achieve advanced problem solving signals. |
| Leaning no hire | Showed only some basic problem solving signals, failing to achieve the rest. |
| Leaning no hire | Showed only some basic problem solving signals, failing to achieve the rest. |
| Strong no hire | Unable to solve the problem or did it without much explanation of their thought process. Approach was disorganized and incorrect. |
<InDocAd />
@ -130,7 +130,6 @@ Advanced technical competency signals:
| Leaning no hire | Struggled to produce a working solution in code. Multiple syntax errors and bad use of language paradigms. |
| Strong no hire | Could not produce a working solution in code. Major syntax errors and very bad use of language paradigms. |
### 4. Testing
Testing signals

@ -4,11 +4,9 @@ Design a snake game that is to be played in web browser.
Client: React + Redux
Rendering:
Pixel-based graphics. Depending on the intended resolution, can divide the screen into N \* M pixels. Can dynamically calculate the size of each pixel.
Rendering: Pixel-based graphics. Depending on the intended resolution, can divide the screen into N \* M pixels. Can dynamically calculate the size of each pixel.
Fruit: One pixel.
Snake body: One pixel width made up of connected pixels.
Fruit: One pixel. Snake body: One pixel width made up of connected pixels.
Model:
@ -59,7 +57,7 @@ function generateFruit() {
// Second approach: brute force
for (let i = 0; i < rows; i++) {
for (let j = 0; j < cols; j++) {
let point = { x: i, y: j };
let point = {x: i, y: j};
if (snake.points.find(next_fruit_location) === -1) {
fruit = point;
}
@ -70,7 +68,7 @@ function generateFruit() {
const available_points = [];
for (let i = 0; i < rows; i++) {
for (let j = 0; j < cols; j++) {
let point = { x: i, y: j };
let point = {x: i, y: j};
if (snake.points.find(next_fruit_location) === -1) {
available_points.push(point);
}

@ -1,5 +1,5 @@
import React from 'react';
import type { Props } from '@theme/DocSidebar/Mobile';
import type {Props} from '@theme/DocSidebar/Mobile';
declare function DocSidebarMobile(props: Props): JSX.Element;
declare const _default: React.MemoExoticComponent<typeof DocSidebarMobile>;
export default _default;

Loading…
Cancel
Save