Algorithm (2139) 썸네일형 리스트형 (C++) - LeetCode (easy) 500. Keyboard Row https://leetcode.com/problems/keyboard-row/description/ Keyboard Row - LeetCode Can you solve this real interview question? Keyboard Row - Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below. In the American keyboard: * the first ro leetcode.com 전수조사 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 첫 째, 둘 째, 셋 째 .. (C++) - LeetCode (easy) 496. Next Greater Element I https://leetcode.com/problems/next-greater-element-i/description/ Next Greater Element I - LeetCode Can you solve this real interview question? Next Greater Element I - The next greater element of some element x in an array is the first greater element that is to the right of x in the same array. You are given two distinct 0-indexed integer arrays nums1 leetcode.com 전수조사 문제였습니다. 📕 풀이방법 📔 입력 및 초기.. (C++) - LeetCode (easy) 495. Teemo Attacking.cpp https://leetcode.com/problems/teemo-attacking/description/ Teemo Attacking - LeetCode Can you solve this real interview question? Teemo Attacking - Our hero Teemo is attacking an enemy Ashe with poison attacks! When Teemo attacks Ashe, Ashe gets poisoned for a exactly duration seconds. More formally, an attack at second t will mean Ashe is leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 ashe가 독에 당한 전체.. (C++) - LeetCode (easy) 492. Construct the Rectangle https://leetcode.com/problems/construct-the-rectangle/description/ Construct the Rectangle - LeetCode Can you solve this real interview question? Construct the Rectangle - A web developer needs to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화.. (C++) - LeetCode (easy) 485. Max Consecutive Ones https://leetcode.com/problems/max-consecutive-ones/description/ Max Consecutive Ones - LeetCode Can you solve this real interview question? Max Consecutive Ones - Given a binary array nums, return the maximum number of consecutive 1's in the array. Example 1: Input: nums = [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 정답 ans.. (C++) - LeetCode (easy) 482. License Key Formatting https://leetcode.com/problems/license-key-formatting/description/ License Key Formatting - LeetCode Can you solve this real interview question? License Key Formatting - You are given a license key represented as a string s that consists of only alphanumeric characters and dashes. The string is separated into n + 1 groups by n dashes. You are also given a leetcode.com 문자열 재구성 문제였습니다. 📕 풀이방법 📔 입력 .. (C++) - LeetCode (easy) 476. Number Complement https://leetcode.com/problems/number-complement/description/ Number Complement - LeetCode Can you solve this real interview question? Number Complement - The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation. * For example, The integer 5 is "101" in binary and it leetcode.com bitmasking을 사용해보는 문제였습니다. 📕 풀이방법 📔 입력 .. (C++) - LeetCode (easy) 463. Island Perimeter https://leetcode.com/problems/island-perimeter/description/ Island Perimeter - LeetCode Can you solve this real interview question? Island Perimeter - You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 4방향을 검사할 .. 이전 1 ··· 72 73 74 75 76 77 78 ··· 268 다음
