https://leetcode.com/problems/top-k-frequent-elements/description/ Top K Frequent Elements - LeetCode Top K Frequent Elements - Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input: nums = [1], k = 1 Output: leetcode.com 문제 Given an integer array nums..

https://leetcode.com/problems/group-anagrams/description/ Group Anagrams - LeetCode Group Anagrams - Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters e leetcode.com 문제 Given an array of strings strs, group the..

https://leetcode.com/problems/longest-repeating-character-replacement/submissions/ Longest Repeating Character Replacement - LeetCode Longest Repeating Character Replacement - You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of the leetcod..

https://leetcode.com/problems/validate-binary-search-tree/description/ Validate Binary Search Tree - LeetCode Validate Binary Search Tree - Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: * The left subtree of a node contains only nodes with keys less than the node's key. * The right subtree leetcode.com 문제 Given the root o..

https://leetcode.com/problems/word-search/ Word Search - LeetCode Word Search - Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The s leetcode.com 문제 Given an m x n grid of characters board and a string word, ..