일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 클라우드
- it
- probability
- TOEFL
- Bitcoin
- 백테스트
- AWS
- can
- 확률
- python
- 자동차sw
- 암호화폐
- 토플 라이팅
- toefl writing
- 자동매매
- 아마존 웹 서비스
- 백트레이더
- backtrader
- 블록체인
- 파이썬
- 퀀트
- 프로그래밍
- backtest
- 토플
- 오토사
- GeorgiaTech
- AUTOSAR
- 비트코인
- 개발자
- Cloud
- Today
- Total
목록Leetcode (2)
Leo's Garage
Easy A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line. You are given an integer array heights representing the current order that the students are standing in. Eac..
Easy A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings. A valid parentheses string s is primitive if it is nonempty, and there does not exist a way to split it into s = A + B, with A and B nonempty valid parent..