Given a string consisting of lowercase English letters, remove the minimum number of letters such that all letter are distinct. Return the string which is lexicographically largest.
Given an array of numbers, for each index calculate the product of all numbers except the number at the current index. Do this without using divsion operator.
Round 2
Same question as first question of Round 1
Given a number N and a linked list. Return all the numbers present in the linked list after n nodes.
Some question related to project.
Round 3
Question related to projects.
How authentication is done.
Why should we hire you.
What else you do other than study.
As I mentioned that I also play chess, so the interviewer asked me what life lesson I learned from chess.