Software Engineer Intern

You are given a string 'STR' consisting of lower and upper case characters. You need to remove the consecutive duplicates characters, and return the new string.

Note :

You don't have to print anything, it has already been taken care of. Just implement the given function.

You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.

Note :

1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.

Design a reverse proxy for the given scenario. You will be given n servers and their IP addresses, m endpoints the reverse proxy has a list of IPs for each endpoints. Every request that comes to an endpoint goes in round robin fashion to this IP address.You also get special type of hits to the reverse proxy from the server monitor which says that:- a particular server has gone down and can’t take any request- a particular server is up now and can’t take any requestOnce a server comes back up it should be added to end of the queue in round robin corresponding to each of endpoints it is responsible for.At the end of q queries give out list of requests received by each servers.

This problem requires you to implement a log watching solution (similar to the tail -f command in UNIX). However, in this case, the log file is hosted on a remote machine (same machine as your server code). The log file is in append-only mode. You have to implement the following:1. A server side program to monitor the given log file and capable of streaming updates that happen in it. This will run on the same machine as the log file. You may implement the server in any programming language.2. A web based client (accessible via URL like http://localhost/log) that prints the updates in the file as and when they happen and NOT upon page refresh. The page should be loaded once and it should keep getting updated in real-time. The user sees the last 10 lines in the file when he lands on the page. Problem Constraints The server should push updates to the clients as we have to be as real time as possible. The server should not retransmit the entire file every time. It should only send the updates. The server should be able to handle multiple clients at the same time. The web page should not stay in loading state post the first load and it should not reload thereafter as well. You may not use off-the-shelf libraries or tools that provide tail-like functionalities. We will be evaluating you for code quality, testability, modularity, corner cases, etc.

This was again a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

In this problem, you have to build a small knowledge base about the top N movies listed on IMDb Charts and provide a mechanism to query the same.
Your program should accept N as an input parameter and do the following:
Fetch the list of top N movies from the IMDb website and build an in-memory knowledge base comprising of
the names of movies
the names of the cast of each movie
This should be built at runtime and stored in a suitable data-structure of your choice.
Provide a query interface (command line would do) to query this knowledge base by actor’s name. For a given actor and a number M (< N), it should return the top M movies they have acted in.
You may attempt this problem in any language and libraries of your choice. You can not use any external API for fetching movies from IMDb.

For example, if N=3, then the program should parse the first 3 movies’ individual pages from IMDb Charts and build the knowledge base of the cast (there are about 15-20 names per page). Upon querying for “Morgan Freeman” and M=1, you should return “The Shawshank Redemption”.

Q1). How did you find the last n lines of log file ? and if given more time how would you do it efficiently ?
Q2). Among the internships listed in your resume, which project was most interesting ? some followup questions on that project
Q3). Things that you learn’t during this internship and mistakes you made during it