Knapsack Problem (Dynamic Programming)
An optimal solution to problem contain optimal solution to subproblems. To consider all subset of items, 2 cases for every item arises
Author: Logan
Multiset Partitioning Problem
The number of possible partition of a set of n elements is B(n) known as Bell number. As we know, this problem is NP-Complete i.e. it has non-polynomial time solution.
A Chocolate Fiesta | HackerRank
While it is given that if two numbers are same in the given set, they have different colors. It means that if a1 = a2, then choosing a1 and choosing a2 will be considered as different sets.
Quicksort worst-case and averages-case analysis
Quick Sort is capable of sorting a list of data elements significantly faster (twice or thrice faster) than any of the common sorting algorithms and that’s why it is the favourite topic of interviewers.
Max Area of Island – LeetCode Solution [Medium]
You are given an m x n binary matrix grid. An island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
N Queen Problem Analysis
The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.
Backtracking
Backtracking is a general algorithm for finding solutions to some computational problems, that incrementally builds candidates to the solutions, and abandons a candidate (“backtracks”) as soon as it determines that the candidate cannot possibly be completed to a valid solution.
Arrays
An array is a finite collection of similar elements stored in adjacent memory locations. The simplest form of array is a one-dimensional array that can be defined as a finite ordered set of similar type of data.