keicoon15

https://leetcode.com/problems/isomorphic-strings/ 205. Isomorphic Strings Easy Topics Companies Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same charac..

Maximum Subsequence Score - LeetCode Maximum Subsequence Score - LeetCode Can you solve this real interview question? Maximum Subsequence Score - You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indic leetcode.com nums1, nums2 주어진 숫자 배열에서 k 개의 index 를 뽑아, nums1 에서는 총합..

Kth Largest Element in a Stream - LeetCode Kth Largest Element in a Stream - LeetCode Can you solve this real interview question? Kth Largest Element in a Stream - Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. Implement KthLargest class: leetcode.com 주어지는 배열에서 "k" 번째로 큰 수를 찾는 문제입니다. 큰 수라는 내용에..