알고리즘

https://leetcode.com/problems/find-peak-element/description/?envType=study-plan-v2&envId=top-interview-150 Find Peak Element - LeetCode Can you solve this real interview question? Find Peak Element - A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, leetc..
https://leetcode.com/problems/two-sum/description/?envType=study-plan-v2&envId=top-interview-150 Two Sum - LeetCode Can you solve this real interview question? Two Sum - 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 input would have exactly one solution, and you may not leetcode.com 📌 - 풀이 처음엔 브루..
https://leetcode.com/problems/min-stack/description/?envType=study-plan-v2&envId=top-interview-150 Min Stack - LeetCode Can you solve this real interview question? Min Stack - Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: * MinStack() initializes the stack object. * void push(int val) pushes t leetcode.com 📌 - 풀이 1..
https://leetcode.com/problems/add-two-numbers/description/?envType=study-plan-v2&envId=top-interview-150 Add Two Numbers - LeetCode Can you solve this real interview question? Add Two Numbers - You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and leetcode.c..
https://leetcode.com/problems/linked-list-cycle/submissions/?envType=study-plan-v2&envId=top-interview-150 LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 📌- 풀이 start와 end를 각각 설정하고 start가 end 보다 작거나 같을 동안 반복 중간값을 설정하고 중간값 보..
https://leetcode.com/problems/valid-palindrome/description/?envType=study-plan-v2&envId=top-interview-150 Valid Palindrome - LeetCode Can you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric cha leetcod..
Casteira
'알고리즘' 카테고리의 글 목록 (4 Page)