문제 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the sam...
문제 Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this by modif...
문제 Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Note: All given inputs are in lowercase letters a-z. ...
문제 Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of...
문제 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, whi...
문제 Given a string, find the length of the longest substring without repeating characters. 주어진 문자열에서 알파벳이 중복되지 않고 가장 길게 연속되는 문자열 일부를 반환하라 Example 1: Example 2: Example 3: 풀이 리트코드에서 처음으로 푼 Medium 레벨...
문제 Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find ...
문제 Codewars In this kata you have to create all permutations of an input string and remove duplicates, if present. This means, you have to shuffle all letters from the input in all possible orders. 문...