꿈꾸는공학도

https://leetcode.com/problems/design-circular-deque/사실 예전에 풀었던 문제인데, 다행히(?) 인간은 망각의 동물인지라 초면 인 것 마냥 풀었다. deque 구조의 delete / insert 등등의 method를 한번 구현해 보는 것이 골자! Design your implementation of the circular double-ended queue (deque).Implement the MyCircularDeque class:MyCircularDeque(int k) Initializes the deque with a maximum size of k.boolean insertFront() Adds an item at the front of Deque. Retu..

https://leetcode.com/problems/my-calendar-ii/description/You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a triple booking.A triple booking happens when three events have some non-empty intersection (i.e., some moment is common to all the three events.).The event can be represented as a pair of integers start and end that represent..

https://app.codility.com/c/run/trainingUU9KUZ-BJY/ CodilityYour browser is not supported Please, update your browser or switch to a different one. Learn more about what browsers are supportedapp.codility.comThere are N ropes numbered from 0 to N − 1, whose lengths are given in an array A, lying on the floor in a line. For each I (0 ≤ I We say that two ropes I and I + 1 are adjacent. Two adjacent..

https://leetcode.com/problems/maximum-swap/description/?envType=daily-question&envId=2024-10-17You are given an integer num. You can swap two digits at most once to get the maximum valued number.Return the maximum valued number you can get. Example 1:Input: num = 2736Output: 7236Explanation: Swap the number 2 and the number 7.Example 2:Input: num = 9973Output: 9973Explanation: No swap. Constrain..

https://app.codility.com/programmers/lessons/14-binary_search_algorithm/min_max_division/ MinMaxDivision coding task - Learn to Code - CodilityDivide array A into K blocks and minimize the largest sum of any block.app.codility.comYou are given integers K, M and a non-empty array A consisting of N integers. Every element of the array is not greater than M.You should divide this array into K block..

https://app.codility.com/programmers/lessons/6-sorting/max_product_of_three/ MaxProductOfThree coding task - Learn to Code - CodilityMaximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).app.codility.comA non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P For example, array A such that:A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A..

https://www.geeksforgeeks.org/problems/quick-sort/1 Quick Sort | Practice | GeeksforGeeksQuick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.Given an array arr[], its starting position is low (the index of the array) and its ending position is high(the iwww.geeksforgeeks.orgQuick Sort is a Divide and Conquer algorith..

https://leetcode.com/problems/pascals-triangle-ii/description/Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: Example 1:Input: rowIndex = 3Output: [1,3,3,1]Example 2:Input: rowIndex = 0Output: [1]Example 3:Input: rowIndex = 1Output: [1,1] Constraints:0  Follow up:..

https://leetcode.com/problems/longest-nice-substring/description/A string s is nice if, for every letter of the alphabet that s contains, it appears both in uppercase and lowercase. For example, "abABB" is nice because 'A' and 'a' appear, and 'B' and 'b' appear. However, "abA" is not because 'b' appears, but 'B' does not.Given a string s, return the longest substring of s that is nice. If there ..

https://leetcode.com/problems/jewels-and-stones/description/You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.Letters are case sensitive, so "a" is considered a different type of stone from "A". Example 1:I..