Generating all combinations of well-formed parentheses.
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Topic
Interview Questions
A collection of 3 issues
Multiply two non-negative integer strings [with a twist]
Given two non-negative integers n1 and n2 represented as strings, return the product of n1 and n2, also represented as a string. Twist: You can’t use any built-in language integer libraries nor convert the inputs to integers directly.
longestPrefix interview question solution
This is my attempt at solving the longestPrefix interview question from cassidoo's weekly newsletter.