Given an integer array nums and an integer k, return the kth largest element in the array.

Aggregate Root 는 도메인 단위이자, 우리가 현실 세계를 기술하는 명세이기도 합니다. 정적인 코드가 동적인 세계와 결합 되어 변화하는 시점을 파악하고, 그것을 통해 모델을 도출하는 것은 서비스를 개발하는 개발자에게 있어 가장 큰 일입니다. 그러나, 이러한 도메인 객체 설계가 좋은 방향으로 동작하기 위해서는 사전에 많은 작업이 필요합니다. 올바르게 각 요소를 Aggregate Root로 쪼개고, 묶는 방법은 무엇일까요.

Given an array, rotate the array to the right by k steps, where k is non-negative.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters.

You are given an array of unique integers salary where salary[i] is the salary of the ithemployee.

Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive).

ou 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 return the sum as a linked list.

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list’s nodes (i.e., only nodes themselves may be changed.)

Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string.