일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 |
- middleware
- express.js
- nextJS
- bitcoin
- SSR
- Ethereum
- solidity
- concept
- node.js
- CLASS
- API
- CSS
- web
- REACT
- graphQL
- typeScript
- useState
- Redux
- evm
- 기준
- built in object
- 삶
- Props
- HTML
- tailwindcss
- JavaScript
- hardhat
- blockchain
- error
- Interface
- Today
- Total
목록Frontend (231)
ReasonJun
https://www.daleseo.com/zod-schema/ Zod를 통한 타입스크립트 친화적인 스키마 정의 Engineering Blog by Dale Seo www.daleseo.com
twMerge is a JavaScript library that merges Tailwind CSS classes without style conflicts. It is useful when you need to conditionally join Tailwind CSS classes together, or when you need to merge Tailwind CSS classes from different sources. clsx is a JavaScript library that provides a simple and efficient way to conditionally join CSS classes together. It is useful for creating reusable CSS comp..
The useLayoutEffect hook is a React hook that can be used to perform side effects that require immediate DOM layout updates. It is similar to the useEffect hook, but it runs synchronously after all DOM updates have been completed, but before the browser repaints the screen. This makes it ideal for use cases such as measuring DOM elements, or animating or transitioning elements. One of the main b..
pnpm is a fast and disk space efficient package manager for JavaScript. It uses a content-addressable filesystem to store all files from all module directories on a disk. This means that pnpm only stores one copy of each file, regardless of how many packages depend on it. This can save a lot of disk space, especially for large projects with many dependencies. pnpm is also very fast. It can insta..

Time complexity Time complexity is a measure of the performance of an algorithm. Analysis of algorithm execution time for input of a specific size. If there are algorithms that perform the same function, the lower the complexity, the better. Big-O Notation This is a notation that considers only the fastest growing terms. Indicates the upper limit of the funciton. For example, let's say there is ..
Algorithm Coding Test Several algorithmic problems are presented within a set period of time (usually within 5 hours). Evaluate the ability to solve problems using appropriate algorithms. Development assignment coding test A test aimed at developing a complete program. The duration can range from as short as a few hours to as long as two weeks or more. It requires the use of a language or framew..