Pascal’s triangle 2
Before solving this, have a look at similar problem “pascal’s triangle”. Given a non-negative integer numRows, generate the first numRows of…
Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle.
n Pascal’s triangle, each number is the sum of the two numbers directly above it. Example: Input: 5 Output: [ [1], [1,1], [1,2,1],…
Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals…
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example: Input:…
Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list. Example: Input: 1->2->3->4->5->NULL, m = 2, n = 4 Output: 1->4->3->2->5->NULL…
Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2…
check if the given string is valid or not explanation with solution
Validate if a given string is numeric. Some examples: “0” => true ” 0.1 ” => true “abc” => false…
Subsets II in CPP
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set must…
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must…
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions. Example: Input: head =…