SDE - Intern

You are given a string (STR) of length N, consisting of only the lower case English alphabet.

Your task is to remove all the duplicate occurrences of characters in the string.

For Example:

If the given string is:
abcadeecfb

Then after deleting all duplicate occurrences, the string looks like this:
abcdef

You have been given a Binary Tree of 'N'

nodes, where the nodes have integer values.

Your task is to return the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].
The Preorder traversal will be [1, 3, 5, 2, 4, 7, 6].
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].

This was a Machine learning problem. I was given a scenario where I had a dataset of many users with their likes and dislikes for many movies. Now given a user with some information about his movie preferences, I had to built a ML model which can suggest a movie to the user from the database. In other words, my ML model should be able to predict the likes/dislikes of that particular user for the entire movie database

I was asked to describe my strengths and weaknesses

What has changed in me since I joined college?