1. given a binary tree, return the number of nodes that got value higher or equal to every node in the path from root to that node. 2. given array of integers, return the first and second lowest numbers. you got 2:20 hours to solve it.
Full Stack Engineer Interview Questions
18,238 full stack engineer interview questions shared by candidates
recreating "lodash"-like functions: Implementing some(arr, func) to return TRUE if some elements in the array satisfy the function. Creating a neg(func)(value) function that takes a function and returns a negated version. Using both some() and neg() to implement every(arr, func).
Design a tagging system
shopping cart with products and coupons and calculate the net price after applying coupons on products. Coupons can be of different types with certain conditions. 1. N% off that is 10% off for all the individual 2.P% off on next item 3.D% off on Nth item of Type T. sequentially wants to apply all the coupons on the cart and get the Total amount.
Have you done pair programming before?
What if you are not appreciated in the group discussion for any point
Find the largest and positive? difference comparing two numbers sequentially in a series of numbers?? (May not be exactly this)
Phone: bind, this, build 2 buttons (html + css); check if parentheses are valid
How do you maintain the session?
Product of Array
Viewing 81 - 90 interview questions