| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 러닝 스칼라
- c++
- mysql
- Linux
- BOF
- backend
- Web
- 인공지능
- hackthissite
- hackerschool
- Javascript
- c
- deep learning
- php
- flask
- 리눅스
- ChatGPT
- 웹해킹
- Scala
- webhacking
- BOF 원정대
- Python
- 챗GPT
- 딥러닝
- 백엔드
- 경제
- hacking
- Shellcode
- 파이썬
- 러닝스칼라
- Today
- Total
목록2022/04 (2)
jam 블로그
#3. Longest Substring Without Repeating Characters [Medium] [Javascript]
문제 Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Notice that the ..
#2. Add Two Numbers [Medium][Javascript]
문제 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. Example 1: Input: l1 = [2,4,3], l2 = [5,6,4] Output: [7,0,8] Explanation: 34..