코딩테스트준비

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each inpu

Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range -231

Given an alphanumeric string s, return the second largest numerical digit that appears in s, or -1 if it does not exist.An alphanumeric string is a st

Given an array nums. We define a running sum of an array as runningSumi = sum(nums0…numsi).Return the running sum of nums.Example 1:Example 2:Example

Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.A subarray is defined as a contiguous seque

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that numsi == numsj and abs(i -

Given integer array nums, return the third maximum number in this array. If the third maximum does not exist, return the maximum number.Example 1:Exam

큐는 First In First Out, FIFO라고 불리는 구조이다. 가장 먼저 넣은것이 가장 먼저 나오고 가장 나중에 넣은 것이 가장 나중에 나온다.큐에 데이터를 넣는 것을 Enqueue,데이터를 빼내는 것을 Dequeue라고 한다.Stack: Last-in-fir

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (F

그림과 함께 있어서 링크를 눌러 사이트에 직접 들어가서 문제를 보자.내 풀이

Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simpl

풀이