# 179

User Experience Developer interview questions shared by candidates

## Top Interview Questions

Sort: Relevance|Popular|Date
Software Engineer, User Experience was asked...November 20, 2016

### Given a linked list of characters, print the characters in reverse order.

reverse the linked list, iterate through it and print, reverse it back.

traverse through it using a recursive function with a printing statement after the traversal statement so when it gets to the end of the function and its returning, it will print along the way. Less

def reverse[T](seq: Seq[T]): Seq[T] = { seq match { case Nil =&gt; Seq() case head :: tail =&gt; reverse(tail) :+ head } } println(reverse(List('A', 'B', 'C', 'D', 'E'))) Less

### Using a nested for() loop is inefficient, can you do it more efficient than the native String.indexOf() method? Without nesting for loops or recursion.

Convert the strings to objects with each word being added as a property to speed up the lookup. I had heard of this technique but never done it myself. Less

sort the words will be done in n Log n . for each word in 1st string do binary search on other string which will run in n log n so overall complexity will be n log n. Less

### "You have 30 minutes to show us what you've got."

Ask more specifics on the position. The recruiter gave me NO information on the available position, so I was under the impression that I was up for consideration in several positions.. Less

I can tell you what I don't got -- a job.

### Given two strings of words create an algorithm to return all the words that occur in only one of the two strings. A word can be in one string many times and still pass as long as it's not in the other.

My answer started out a simple string comparison, but then realized the algorithm needs to be a little more complex to satisfy the requirement. I turned the strings into arrays, then created a function that used a nested for loop to compare the arrays. similar to the native String.indexOf() method, only customized for the requirement. Less

You can use a hash map to count the words in the two arrays. Words with count==1 are the answer Less

### How to remove a text box out of 5 boxes arranged in loop (Parent Box to Child box) with the help of Javascript?

with the help of addClass and removeClass function using (this)

### how to make a bot for Candy crush

design an Algorithm using your common sense

Same thing happened to me - what company asks you to do a project - aka homework... stupid and a waste of time Less

### Why did you want to join the company?

Benefits and my skills matches with the position