2021 Tencent Backend Developer Online Coding Test Problem 4 (RMQ)
Problem:
Given a string of capitalized alphabets of size N, and a subarray size M, find the largest subarray of size M in lexicographical order.
Example:
Input: s = "ABKBD", and M = 3
Output: KBD
Analysis:
For the first alphabet in the answer, at lea...
jinianluo.hashnode.dev2 min read