Category: programming languages
Given a binary tree, convert it to a string that consist of parenthesis and interests in the pre-order traversal. The empty brackets () for left sub trees can be …
Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Example: Input: S = “loveleetcode”, …
Given two non-negative integers represented by strings, return the sum of both. You should not use any BigInteger library nor convert the inputs to integer types directly, as the …
Given an array of string that is in the format of “count domain”, count the subdomain visits. For example, input the output is – could be in any order. …
The Wiggle Sorting may produce more than one possible outcome as long as the final sorted array satisfies: nums <= nums >= nums <= nums Given an unsorted array …
