Questions included in my description

Question

Anonymous · Accepted Answer

For the first LC problem. I can see an O(n^2) solution pretty easily. Was wondering if there are any faster solutions, that don't require looking at every single character, if even possible?

Anonymous · Answer

Yes O(N) go for a loop to append all the elements inside the input array into one string then then iterate through it using charAt  adding each number to a new list.

Anonymous · Answer

Second question is fibonacci. Here's my solution:

var climbStairs = function(n) {
    let a = b = 1
    while(n--){
        a = (b+=a) -a //Another way to say let temp = a; a = b; b = temp+b
    }
    return a
};

Expedia Group

Expedia Group interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches