Write a function that returns the sum of the arguments. Once resolved, now refactor the function so it can be called in all these ways. add(1)()()()(1,2) // 3, add(1,2,3) // 3, add(1)()()(2,3) // 3, add()()()()()()()()()(1)(2,3) // 3 It was no clear to me first, but the function needs >2 arguments to return the sum.
Write a function that identifies valid strings of parenthesis “(()())” is ok, “)()” is not and then returns true or false. Then comment on BigO issues. Refactor to make it more efficient in terms of space complexity.
Questions on complex joins
Why do you want to work here?
What are a few metrics for evaluating Machine Learning models?
What is your SAT Score?
Pattern drawing.
Explain your coding challenge.
What is c
Salary expectations
Viewing 6041 - 6050 interview questions