摘要：Problem description: Given an input string , reverse the string word by word. Example: Input: ["t","h","e"," ","s","k","y"," ","i","s"," ","b","l","u" 阅读全文

摘要：Problem Description: Implement the StreamChecker class as follows: StreamChecker(words): Constructor, init the data structure with the given words. qu 阅读全文

摘要：Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. Not 阅读全文

摘要：Assume you have an array of length n initialized with all 0's and are given kupdate operations. Each operation is represented as a triplet: [startInde 阅读全文

摘要：Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be 阅读全文