Starting a personal node project could be easy; starting a team node project could be challenging.
I am a developer currently working in SEEK Australia.
In my experience, common mistakes developer make when starting a projects are:
- No Linting
| const MAX_RETRIES = 3; | |
| const BASE_DELAY_IN_MS = 1000; | |
| export const exponentialBackOffGenericFunc = | |
| // prettier-ignore | |
| <U extends (...args: any[]) => any>(genericFunc: U) => // eslint-disable-line | |
| async (...args: Parameters<U>): Promise<ReturnType<U>> => { | |
| let retries = 0; | |
| const isUnderMaxRetries = retries < MAX_RETRIES; |
Starting a personal node project could be easy; starting a team node project could be challenging.
I am a developer currently working in SEEK Australia.
In my experience, common mistakes developer make when starting a projects are:
{
"version": "0.2.0",
"configurations": [
{
"name": "Run tsx in VSCode Debugger",
"type": "node",
"request": "launch",
"runtimeExecutable": "node",
"runtimeArgs": ["--loader", "tsx"],by Tatiana Mac
Last updated 14 April 2021
As speaking comes with immense privilege, I have crafted a speaker rider to set expectations and boundaries around my engagement. I am grateful to all the conference organisers who have brilliantly hosted me. I would love to continue to exercise this privilege to speak at conferences, and use this privilege to make the landscape more accessible and beneficial to tech's most historically excluded and marginalised communities.
😫 I provide a lot of explanations for those of you who never had to consider these things. Most thoughtful conferences I've attended check most of these boxes intrinsically, particularly when conference runners are experienced speakers. They get it.
| def is_valid_state(state): | |
| # check if it is a valid solution | |
| return True | |
| def get_candidates(state): | |
| return [] | |
| def search(state, solutions): | |
| if is_valid_state(state): | |
| solutions.append(state.copy()) |
| /* | |
| //Problem Statement | |
| You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. | |
| You may assume the two numbers do not contain any leading zero, except the number 0 itself. | |
| //Examples |
| /* | |
| Framework Skeleton | |
| Understanding the problem { | |
| //Problem Statement | |
| *Problem Statement in own words go here* |