1. online assessment with 2 leetcode medium questions. 2. onsite for 2 rounds of coding a. 3 leetcode questions ranging from ease - medium b. 3 JS questions(how to create apply with bind, how to create table toggle with pure JS, currying), and how the critical rendering process works.
You are given four numbers (type int), and have four basic math operators at your disposal (+, -, x, /). Given arbitrary ways to group the numbers and using any of the operators, determine if you can make the number 24 from the four numbers. The numbers must be processed in the order they appear.
Cant share questions because of NDA
Can not disclose specific questions, but they are your basic technical coding questions. Some are more applicable to the position than others, but all are relevant to software engineering.
First Round: Questions on CSS specificity, position Questions on JS concepts like inheritance, arrow functions, variable hoisting, variable declaration and memory allocation etc. Second Round: Write an algorithm to merge overlapping ranges, given two sets of ranges. Discussion on implementation of infinite scroll Third Round: Program to efficiently deal with hierarchical data where the data itself is stored in a flat format
How were you helping to improve the culture of your team in your previous company?
What was one of the negative feedback that you have received?
O que fazer com um cliente que não quer pagar, é mole?
2 OA question. One is by chair. One is Given two arrays where array 'a' is fixed and array 'b' can be rearranged, for example a: 1,2,3,4,5 and b: 2,6,4,3,5. The objective is to rearrange array 'b' in such a way that as many numbers in 'b' as possible are greater than their corresponding numbers in 'a'. Finally, the sum of numbers in 'b' that are greater than the corresponding numbers in 'a' is calculated. For example, if a: 1,2,3,4,5 and b: 2,3,4,5,6 -> return 2+3+4+5+6.
Data structure algorithm with a few parts/constraints
Viewing 381 - 390 interview questions