DFS approach to detect cycle in directed and undirected graphs

It contains categorised list of top 75 problems from leetcode.

A whole range of problems based on monotonic stack

A simplified way of solving and understanding backtracking problems.

Explaination of solid principles with example.

a list of resources for practice Low Level Design

It is a curated list of some tricky JS questions generally asked in interviews.

This is a simple application that gives an idea of how to creak a bulk import of csv files to SQL database.

Kadane’s Algorithm TL;DR This algorithm is used to find maximum sum sub-array from a given array.  Its has O(n) time complexity and O(1) space complexity.  It works irrespective of whether the elements are positive or negative, whether sorted or unsorted.  Its DP approach Its brute force approach takes O(n^2) as it calculates all possible sub-array and then return maximum out of them.  Since brute force approach is very obvious and easy to implement, so, I am not discussing it here.

LEETCODE : 169. Majority Element Link Problem Description : Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. For example: Example 1: Input: [3,2,3] Output: 3   Example 2: Input: [2,2,1,1,1,2,2] Output: 2 Explaination : There is pretty easy way to solve it by using count of every element and then returning the element which has count greater than n/2 .

LEETCODE : 171. Excel Sheet Column Number Link Problem Description : Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 ... Example 1: Input: "A" Output: 1  Example 2: Input: "AB" Output: 28 Example 3: Input: "ZY" Output: 701  Explaination :

CodeChef : https://www.codechef.com/JAN20B/problems/BRKBKS Problem: For her next karate demonstration, Ada will break some bricks. Ada stacked three bricks on top of each other. Initially, their widths (from top to bottom) are W1,W2,W3. Ada’s strength is S. Whenever she hits a stack of bricks, consider the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k bricks break and are removed from the stack.

It contains some of the interview questions that are asked to React developers these days.

Problem: Chef wants to organize a contest. Predicting difficulty levels of the problems can be a daunting task. Chef wants his contests to be balanced in terms of difficulty levels of the problems. Assume a contest had total P participants. A problem that was solved by at least half of the participants (i.e. P / 2 (integer division)) is said to be cakewalk difficulty. A problem solved by at max P / 10 (integer division) participants is categorized to be a hard difficulty.

Problem: Consider an array of integers, A = a0, a1, a2….an-1. We define the absolute difference between two elements, ai and aj (where ai not equal to aj ), to be the absolute value of ai-aj. Given an array of n integers, find and print the minimum absolute difference between any two elements in the array. Input Format The first line contains a single integer denoting (the number of integers).