꿈꾸는공학도

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/description/Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:[4,5,6,7,0,1,4] if it was rotated 4 times.[0,1,4,4,5,6,7] if it was rotated 7 times.Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the ..

https://leetcode.com/problems/min-stack/description/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 the element val onto the stack.void pop() removes the element on the top of the stack.int top() gets the top element of the stack.int getMin() retrieves t..

https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. Example 1:Input: root = [3,1,4,null,2], k = 1Output: 1Example 2:Input: root = [5,3,6,2,4,null,null,1], k = 3Output: 3 Constraints:The number of nodes in the tree is n.1 0 Follow up: ..

https://app.codility.com/programmers/lessons/9-maximum_slice_problem/max_profit/ MaxProfit coding task - Learn to Code - CodilityGiven a log of stock prices compute the maximum possible earning.app.codility.comAn array A consisting of N integers is given. It contains daily prices of a stock share for a period of N consecutive days. If a single share was bought on day P and sold on day Q, where 0..

https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/?envType=problem-list-v2&envId=treeGiven a n-ary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See ..

https://leetcode.com/problems/is-graph-bipartite/description/?envType=problem-list-v2&envId=graphThere is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph, where graph[u] is an array of nodes that node u is adjacent to. More formally, for each v in graph[u], there is an undirected edge between node u and node v. The graph has the f..

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..