Generate Parentheses - LeetCode Can you solve this real interview question? Generate Parentheses - Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"] Exa leetcode.com 문제 Given n pairs of parentheses, write a function to generate all combinations of well-formed paren..

Longest Arithmetic Subsequence - LeetCode Can you solve this real interview question? Longest Arithmetic Subsequence - Given an array nums of integers, return the length of the longest arithmetic subsequence in nums. Note that: * A subsequence is an array that can be derived from another array by leetcode.com 문제 Given an array nums of integers, return the length of the longest arithmetic subsequ..