fail2ban?GitHub - fail2ban/fail2ban: Daemon to ban hosts that cause multiple authentication errorslog파일을 참조하여 filter에 정의된 조건에 맞는 IP를 기록하고 차단하기 위한 brute force 방어 시스템이다. jail 과 filter라는 개념을 사용하는데,jail은 특정 필터에 의해 걸러진 IP를 가두는 감옥과 같은 개념으로,감옥별로 차단 단계까지 도달하기 위해 반복될 실패횟수나 시간, 차단할 시간 등을 지정할 수 있다.filter는 간단하게 IP 차단 여부를 판단하기 위한 기준이 되는 필터를 의미한다. 설치(ubuntu 기준)$ apt-get update apt-get install fail2ban 설치를 완료..

https://leetcode.com/problems/guess-number-higher-or-lower/description/?envType=study-plan-v2&envId=leetcode-75We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess. You call a pre-defined API int guess(int num), which r..

보호되어 있는 글입니다.

https://developer.mozilla.org/en-US/docs/Web/API/ResizeObserver ResizeObserver - Web APIs | MDNThe ResizeObserver interface reports changes to the dimensions of an Element's content or border box, or the bounding box of an SVGElement.developer.mozilla.orgResizeObserver는 html 엘리먼트의 내용물 크기 또는 svg의 바운딩박스의 변화를 추적해 주는 인터페이스다.new ResizeObserver() 로 인스턴스를 생성한 뒤, 추적하고 싶은 엘리먼트를 observe 하면 끝이다.추적을 멈추고 싶을 ..

https://leetcode.com/problems/edit-distance/description/?envType=study-plan-v2&envId=leetcode-75 Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.You have the following three operations permitted on a word:Insert a characterDelete a characterReplace a characterExample 1: Input: word1 = "horse", word2 = "ros" Output: 3Explanation: hors..

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/?envType=study-plan-v2&envId=leetcode-75You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee. Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the tran..

https://leetcode.com/problems/longest-common-subsequence/description/?envType=study-plan-v2&envId=leetcode-75Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative orde..

https://leetcode.com/problems/daily-temperatures/description/?envType=study-plan-v2&envId=leetcode-75 Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.Example 1:..

https://developers.google.com/workspace/sheets/api/quickstart/python?hl=ko Python 빠른 시작 | Google Sheets | Google for Developers이 페이지는 Cloud Translation API를 통해 번역되었습니다. 의견 보내기 Python 빠른 시작 컬렉션을 사용해 정리하기 내 환경설정을 기준으로 콘텐츠를 저장하고 분류하세요. 빠른 시작에서는 Google Workdevelopers.google.com공식문서가 정말... 잘 돼있는데^^열받게도 이 문서를 찾는 게 너무 힘들었다. 사실상 이 글의 내용은 저 링크 하나만으로 충분하긴 하지만...언젠가 또 이런 삽질을 하게 될 지 모르기 때문에 간략하게나마 정리해 ..

http://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/description/?envType=study-plan-v2&envId=leetcode-75Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation). Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.Example 1:Input: a =..