You are passed an array whose rows consists of [x_0,x_1) coordinates that represents an interval of shops over a path P. Find the maximum number of shows that may cover the path such that as no x_i spot contains more than three shops. The shops must cover the entire path.
You have a String that must be encrypted based on business rules. The first char must not be changed, the capitalization of all positions in the String must be preserved the next letter to be encrypted is based on the position in the English alphabet the previous character is positioned at. The letter A starts at 0 Z starts at 25.
Where would you see yourself in the next few years?
Write code for a web app that randomly assigns the background color as red or blue on the first visit and the background color should stay the same color each time the page is loaded. Write tests to ensure it works properly.
What has been your best success story
What the best thing you did in your current job.
Will you complete a coding exercise to prove your ability, taking up to 10 hours of work?
Build a website that turns either red/blue when a user first visits the site and persist that color. Typical recursive algorithm problem Flatten an array system design about scaling number of users
Please talk about your previous experience?
There is a full-stack web app running in a cloud (i.e. AWS) and I wanted to migrate everything over to another cloud (i.e. Digital Ocean). How can I do this without facing any downtime or maintenance time?
Viewing 151 - 160 interview questions