Took the Online Assesment on Hackerrank for LMTS position at Salesforce in India. It was a 60 minute proctored test. It only had 2 leetcode easy questions.\n1. You were given a list of strings where each string contained a triplet. All of you had to do was return a list of strings that said whether the given triplet could make a "ISOSCELES", "EQUILATERAL, or "NONE OF THESE" triangle. \n```\nip: \n3 4 5\n3 3 5\n3 3 3\n1 1 2\n```\n```\nop:\nNONE OF THESE\nISOSCELES\nEQUILATERAL\nNONE OF THESE\n```\n2. You were given a dictionary of strings in the forn of a list of strings(`vector<string> dictionary`) and a string s. Your job was to return the lexicographically smallest string in the dictionary that was a subsequence of s.

Took the Online Assesment on Hackerrank for LMTS position at Salesforce in India. It was a 60 minute proctored test. It only had 2 leetcode easy questions.\n1. 