Given an array representing the weight of astroid [5,-5,6] the positive astroid can move right side and negative astroid can move into left side.if astroid are moving towards each other then they can collide.If they are of same weight then they cancel each other.Otherwise the astroid with more weight wins. [5,-5,6,7] => [6,7] [1,2,-3,-6,8,-10] => [-3,-6,-10]
It's a question that came from all last years
Mostly about your self, tech stack, etc
hexadecimal conversion.
FizzBuzz, find first non-repeated char in a string, and String manipulation
Design and implement a rate limiter?
Leetcode medium
int j =+ 6; j += 3; cout << j; What gets printed out?
What is something you've done at your current job that you're proud of. Please explain.
o salario muito baixo com o mercado
Viewing 201 - 210 interview questions