[ INFO ]category: Behavioral · Onsite difficulty: hard freq: first seen: 2020-05-09
[HARD][ONSITE]OnsiteSDE IIRejected
$catproblem.md
Round 1 :
Hackerrank Test(30 minutes) : Given a string of digits, keep summing the digits and convert them to Hexadecimal. Repeat the same process till minimal hexadecimal Value is attained. (Validation of strings had to be done as well). Input 8981 Output B
Eg. 8981 -> Sum=26 ->Hexa Value 1A->Sum=1+10=11->Hexa Value B (Answer)
Round 2: Onsite Algorithm Round
Search a word in a 2d Character matrix with traversel direction allowed as horizontal, vertical and diagonal. Similar to Word Search https://leetcode.com/problems/word-search/
Median of an infinte stream of numbers. Follow up : Median of two sorted sets in O(log(n)).
Round 3 : Problem Solving
Given a String with one type of brackets, validate if it is balanced or not.