## Longest Increasing Subsequence, Leetcode, Dynamic programming

Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18 Output: 4 Explanation: The longest…

## LeetCode – 224. Basic Calculator , Interview question

Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or…

## Custom getElementByAttribute function – JavaScript/FrontEnd interview question

This article will describe how you can write your own Custom getElementByAttribute function and it is a common JavaScript/FrontEnd interview question. It…

## JavaScript interview questions – Flatten an array in JavaScript

This is also one of the most common questions you will find in your JavaScript or FrontEnd interview questions. The idea…

## Debounce function – JavaScript/FrontEnd interview questions

JavaScript or FrontEnd interviews be tricky sometimes. These questions aim at testing your understanding of JavaScript concepts like – hoisting, closures,…

## Find a rectangle of 0s in matrix of 1s and 0s

Question: Find a rectangle of 0s in matrix of 1s and 0s Input:

Output: [[0, 0], [0, 0], [3, 3],…

## Print all combinations of points from given set of input that can compose a given number. (Recursive & Dynamic approach)

Problem: Print all combinations of points from given a set of input that can compose a given number. (Recursive and…

## Find child having n parent ( Graph Problem )

Question: Suppose we have some input data describing a graph of relationships between parents and children over multiple generations. The…

## Depth Sum or Nested List Weight Sum ( Linked In Interview question)

Problem: Given the nested list of integer, calculate the depth sum. Sample Input: [[1,1], 2, [1,1]] Output: 10 Explanation: 1* 2 +…