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.
Junior Full Stack Developer Interview Questions
15,707 junior full stack developer interview questions shared by candidates
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.
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).
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
Find all Pythagorean triplets till limit.
Viewing 61 - 70 interview questions
See Interview Questions for Similar Jobs
Wordpress DeveloperPhp Backend DeveloperSenior Full Stack DeveloperWeb Front End Software DeveloperJunior Php DeveloperJunior Front End Web DeveloperJunior Javascript DeveloperFrontend Web DeveloperJunior Frontend DeveloperPhp Wordpress DeveloperJunior Front End EngineerPhp Full Stack DeveloperFrontend Software EngineerJunior Web DeveloperJr Web DeveloperFull Stack Php DeveloperJavascript Software EngineerWordpress Web Developer