Balanced Binary Tree Coding Interview Question
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the […]
javascript
Color Picker – Big Tech Front-End Interview Question
In Front-End Developer technical screening interview, you may asked UI implementation question. It could be UX design interview question or logical app implementation. It is […]
Parenthesis Matching Interview Question
“Sometimes (when I nest them (my parentheticals) too much (like this (and this))) they get confusing.” Read More About How to Create Progress Bar using […]
How to Create Progress Bar using Javascript
In Web Developer Interview, you may get asked to create some interactive components to test your knowledge with latest APIs. Read: Interview Question to Create […]
Given two strings, s1 and s2, write code to check if s2 is a rotation of s1
This is very simple coding interview question to check your knowledge on linear search algorithm implementation. You have given two strings. For example: Input1: ‘erbottlewat’, […]
Coding Interview Question – Design Tic Tac Toe Game
Many big tech companies like Amazon, Apple, Google ask design question to test client side development skill. Question: Create Tic Tac Toe Game. First we […]
Javascript Interview Questions and Answers
Read More Here Front-end Interview Prep Guide. What is Closure in Javascript? Closure is a feature in javascript where inner function has access to outer […]
Coding Challenge – Find maximum in a stack in o(1) time!
Question: Create getMax() function to find maximum in a stack in O(1) time! This is widely asked technical interview for software engineers. You should know […]
Coding Challenge – Find the year with the most number of people alive!
Below is the coding challenge interview question. Question: Given a list of people with their birth year and death year (all between 1900 and 2000), […]
Coding Challenge – Bring all nonzero elements to the left of the array
Question: Write an algorithm that brings all nonzero elements to the left of the array, and returns the number of nonzero elements. Input : {1, […]