XXX: // Reposted to my blog for better indexing: Support me and my work as a witness - witness thread by voting me here, or voting me as a proxy. Thank you! Some of My Contributions: SteemIt Tutorials,

Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create. Examples: Input: S = "a1b2"

Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. For example, given a 3-ary tree: We should

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). Example 1: Input: [3, 2, 1] Output:

Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s. The

XXXX Reposted to my blog for better indexing. Support me and my work as a witness - witness thread by voting me here, or voting me as a proxy. Thank you! Some of My Contributions: SteemIt Tutorials, Robots,

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two

Question: Write a function to compute the number of bits required to convert a integer to another. For example, Input 29 (or 11101), 15 (or 01111) the output is 2. It may seem complex but it is actually

Question: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and

Question: Implement the inspect_bits function to check if any given 32-bit integer contains 2 or more consecutive ones in its binary representation. If it does, the function should return 1 otherwise it

Task: Merge two given sorted integer array A and B into a new sorted integer array. Example A=[1,2,3,4], B=[2,4,5,6], return [1,2,2,3,4,4,5,6] XXX: Support me and my work as a witness - witness thread

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Example

Given a string which contains only letters. Sort it by lower case first and upper case second. Example For "abAcD", a reasonable answer is "acbAD" Challenge Do it in one-pass and in-place.