[Test]
ยท
๐Ÿข One step
[ngrok] ngrok 502 Bad Gateway ์›์ธ์€ ๋„ˆํ•œํ…Œ~
ยท
๐Ÿข One step
kakaobot์„ ๋งŒ๋“ค๋˜ ์ค‘ ๋งŒ๋‚œ ngrok 502 Error ngrok 502 ์˜ค๋ฅ˜๋Š” ์ผ๋ฐ˜์ ์œผ๋กœ ngrok๊ฐ€ ๋กœ์ปฌ ์„œ๋ฒ„์— ์—ฐ๊ฒฐํ•  ์ˆ˜ ์—†์„ ๋•Œ ๋ฐœ์ƒ ์›์ธ ๋กœ์ปฌ ์„œ๋ฒ„๊ฐ€ ์‹คํ–‰๋˜์ง€ ์•Š์Œ: ngrok์€ ๋กœ์ปฌ ์„œ๋ฒ„์— ์—ฐ๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด ์‚ฌ์šฉ๋˜๋Š”๋ฐ, ๋งŒ์•ฝ ๋กœ์ปฌ ์„œ๋ฒ„๊ฐ€ ์‹คํ–‰๋˜์ง€ ์•Š๊ฑฐ๋‚˜ ์ •์ƒ์ ์œผ๋กœ ์ž‘๋™ํ•˜์ง€ ์•Š๋Š” ๊ฒฝ์šฐ ํฌํŠธ ๋ฌธ์ œ: ngrok์ด ์—ฐ๊ฒฐํ•˜๋ ค๋Š” ํฌํŠธ๊ฐ€ ์˜ฌ๋ฐ”๋ฅด์ง€ ์•Š๊ฑฐ๋‚˜ ๋‹ค๋ฅธ ์„œ๋น„์Šค์— ์˜ํ•ด ์ด๋ฏธ ์‚ฌ์šฉ ์ค‘์ธ ๊ฒฝ์šฐ ์˜ค๋ฅ˜๊ฐ€ ๋ฐœ์ƒํ•  ์ˆ˜ ์žˆ๋‹ค. ๋„คํŠธ์›Œํฌ ๋ฌธ์ œ: ๋กœ์ปฌ ๋„คํŠธ์›Œํฌ ์„ค์ •์ด๋‚˜ ๋ฐฉํ™”๋ฒฝ ์„ค์ •์ด ngrok์˜ ์—ฐ๊ฒฐ์„ ์ฐจ๋‹จํ•˜๋Š” ๊ฒฝ์šฐ์—๋„ ๋ฐœ์ƒํ•  ์ˆ˜ ์žˆ๋‹ค. ngrok ์„ค์ • ์˜ค๋ฅ˜: ngrok ๊ตฌ์„ฑ์ด ์ž˜๋ชป๋˜์—ˆ๊ฑฐ๋‚˜ ๋ˆ„๋ฝ๋œ ์„ค์ •์ด ์žˆ๋Š” ๊ฒฝ์šฐ์—๋„ ์ด ์˜ค๋ฅ˜๊ฐ€ ๋ฐœ์ƒํ•  ์ˆ˜ ์žˆ๋‹ค. ํ•ด๊ฒฐ ๋ฐฉ๋ฒ• ๋กœ์ปฌ ์„œ๋ฒ„ ํ™•์ธ: ๋กœ์ปฌ ์„œ๋ฒ„๊ฐ€ ์‹คํ–‰ ์ค‘์ด๊ณ  ์ •์ƒ์ ์œผ๋กœ ์ž‘๋™..
[phpAdmin]
ยท
๐Ÿข One step
https://www.phpmyadmin.net/ phpMyAdmin Your download should start soon, if not please click here. Please verify the downloaded file Please take additional steps to verify that the file you have downloaded is not corrupted, you can verify it using the following methods: phpMyAdmin needs your con www.phpmyadmin.net https://story-moon.tistory.com/37 ๋งฅ๋ถ(M1)์—์„œ PHP / APACHE2 / MYSQL / phpmyadmin ์„ค์น˜ํ•˜๊ธฐ...
[leetcode-36] Valid Sudoku
ยท
๐Ÿข One step
LeetCode-36 Valid Sudoku : A Sudoku board (partially filled) could be valid but is not necessarily solvable. note : Only the filled cells need to be validated according to the mentioned rules.Answer :::python class Solution: def isValidSudoku(self, board: List[List[str]]) -> bool: def valid_row(i, j, row): if row==1: item = board[i] else: item = [board[n][j] for n in range(0,9)] p = [] box = [bo..
[leetcode-242] Valid Anagram
ยท
๐Ÿข One step
LeetCode-242 Valid Anagram : info note : subthe two strings contain the same letters, but the order of the letters may be different. :::python class Solution: def isAnagram(self, s: str, t: str) -> bool: if len(s)!=len(t): return False for i in s: if i not in t: return False else: t = t.replace(i,'',1) return True Result : 59ms Memory: 16.8mb ๋ฌธ์ œ ์ดํ•ด ์ฃผ์–ด์ง„ ๋ฌธ์ž์—ด s์™€ t๊ฐ€ ์ฃผ์–ด์กŒ์„ ๋•Œ, s์˜ ๋ฌธ์ž๋ฅผ ์žฌ๋ฐฐ์—ดํ•˜์—ฌ t๋ฅผ ์–ป..
[leetcode-217] Contains Duplicate
ยท
๐Ÿข One step
LeetCode-217 Contains Duplicate : Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. note : 1
How to LeetCode effectively
ยท
๐Ÿข One step
https://neetcode.io/roadmap NeetCode.io neetcode.io Quality > Quantity Just Know Most Importance Concept 1. Array & Hashing Problems Contains Duplicate Valid Anagram Two Sum Group Anagrams Top K Frequent Elements Product of Array Except Self Valid Sudoku Encode and Decode Strings Longest Consecutive Sequence 2-1. Two Pointers Problems Valid Palindrome Two Sum II Input Array Is Sorted 3Sum Contai..
[leetcode-706] Design HashMap
ยท
๐Ÿข One step
LeetCode-706 Design HashMap : Design a HashMap without using any built-in hash table libraries. note : At most 104 calls will be made to put, get, and remove.Answer :::python class ListNode: def init(self, key=None, value=None): self.key = key self.value = value self.next = None class MyHashMap: def init(self): self.size = 10**4 self.table = collections.defaultdict(ListNode) def put(self, key: i..
๋‹คํ–ˆ๋‹ค
'๐Ÿข One step' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๊ธ€ ๋ชฉ๋ก