자바

카테고리 없음

[LeetCode] 155번 (Min Stack)

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 🤣 문제 설명 ..

개인 공부/코딩테스트

[LeetCode] 125번 (Valid Palindrome)

https://leetcode.com/problems/valid-palindrome/?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 leetcode.com 🤣 문제 설..

개인 공부/코딩테스트

[LeeCode] 122번 (Best Time to Buy and Sell Stock II)

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ Best Time to Buy and Sell Stock II - LeetCode Can you solve this real interview question? Best Time to Buy and Sell Stock II - You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold leetcode.com 🤣 문제..

개인 공부/코딩테스트

[LeetCode] 121번 (Best Time to Buy and Sell Stock)

https://leetcode.com/problems/majority-element/?envType=study-plan-v2&envId=top-interview-150 Majority Element - LeetCode Can you solve this real interview question? Majority Element - Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists leetcode.com 🤣 문제 설명 주식의..

개인 공부/코딩테스트

[LeetCode] 169번 (Majority Element)

https://leetcode.com/problems/majority-element/?envType=study-plan-v2&envId=top-interview-150 Majority Element - LeetCode Can you solve this real interview question? Majority Element - Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists leetcode.com 🤣 문제 설명 n 크..

개인 공부/코딩테스트

[LeetCode] 80번 (Remove Duplicates Sorted Array 2)

https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/?envType=study-plan-v2&envId=top-interview-150 Remove Duplicates from Sorted Array II - LeetCode Can you solve this real interview question? Remove Duplicates from Sorted Array II - Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place [https://en.wikipedia.org/wiki/In-place_algorithm] such..

개인 공부/코딩테스트

[LeetCode] 27번 (Remove Element)

https://leetcode.com/problems/remove-element/?envType=study-plan-v2&envId=top-interview-150 Remove Element - LeetCode Can you solve this real interview question? Remove Element - Given an integer array nums and an integer val, remove all occurrences of val in nums in-place [https://en.wikipedia.org/wiki/In-place_algorithm]. The order of the elements may be changed. Then r leetcode.com 🤣 문제 설명 정수..

개인 공부/코딩테스트

[LeetCode] 88번(Merge Sorted Array)

필자는 자바 스프링 기술스택으로 백엔드 취업을 준비하고 있습니다. 기존에는 파이썬으로 코딩테스트를 준비했지만, 부쩍 자바로 시험봐야 하는 곳도 늘어나고 무엇보다 코딩테스트를 준비하며 자바에 대한 문법과 이해를 높이기 위해 자바로 다시 코딩테스트를 준비하려고 합니다. 때문에 아직 코드가 조금 미흡하더라도 이해해주시길 바랍니다. https://leetcode.com/problems/merge-sorted-array/description/?envType=study-plan-v2&envId=top-interview-150 Merge Sorted Array - LeetCode Can you solve this real interview question? Merge Sorted Array - You are give..

Da2isy
'자바' 태그의 글 목록