## Merge Sort for Linked Lists in JavaScript

Prerequisite: Merge Sort for Linked Lists Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes… Read More »

- Burst Balloon to maximize coins
- Maximum sum in circular array such that no two elements are adjacent
- Walmart Labs Interview Experience ( On Campus FT + 6 month Internship )
- Minimum steps to reach target by a Knight | Set 2
- Matrix Chain Multiplication (A O(N^2) Solution)
- Understanding The Coin Change Problem With Dynamic Programming
- Minimum number of increasing subsequences
- Count the number of ways to traverse a Matrix
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Nutanix Interview Experiance - Campus Placements
- Paytm Interview experience for FTE (On-Campus)
- Number of subsets with sum divisible by m
- Goldman Sachs Interview Experience | Set 51
- Minimum cost to buy N kilograms of sweet for M persons
- Ways to write N as sum of two or more positive integers | Set-2
- Treasure and Cities
- Water Jug Problem using Memoization
- Memoization (1D, 2D and 3D)
- Level Ancestor Problem
- Longest Common Subsequence | DP using Memoization
- Longest subarray having maximum sum
- Count common subsequence in two strings
- Edit distance and LCS (Longest Common Subsequence)
- Minimum odd cost path in a matrix
- Number of ways to reach Nth floor by taking at-most K leaps
- Find the sum of first N odd Fibonacci numbers
- Sum of Fibonacci numbers at even indexes upto N terms
- Longest Decreasing Subsequence
- Total number of different staircase that can made from N boxes
- Length of longest common subsequence containing vowels

Prerequisite: Merge Sort for Linked Lists Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes… Read More »

Print the Fibonacci sequence. The first Fibonacci numbers are: [sourcecode language=”CPP”] // Simple CPP Program to print Fibonacci // sequence #include <iostream> using std::cout; void… Read More »

Given a 3 x n board, find the number of ways to fill it with 2 x 1 dominoes. Example 1 Following are all the… Read More »

Given n wines in a row, with integers denoting the cost of each wine respectively. Each year you can sale the first or the last… Read More »

Consider a tree with n nodes and root. You can jump from one node to any other node on the same height a maximum of… Read More »

Given n elements, write a program that prints the longest increasing subsequence whose adjacent element difference is one. Examples: Input : a[] = {3, 10,… Read More »

Given N elements, write a program that prints the length of the longest increasing subsequence whose adjacent element difference is one. Examples: Input : a[]… Read More »

Given an array arr[]. Determine whether it is possible to split the array into two sets such that the sum of elements in both the… Read More »

Given an array, we partition a row of numbers A into at most K adjacent (non-empty) groups, then the score is the sum of the… Read More »

Given an array of n positive integers, write a program to find the maximum sum of increasing subsequence from prefix till i-th index and also… Read More »

Given n arrays of different length consisting of integers, task is to find the maximum sum of elements in that 2D array of size m… Read More »

Given a matrix (or 2D array) a[][] of integers, find prefix sum matrix for it. Let prefix sum matrix be psa[][]. The value of psa[i][j]… Read More »

Given a text and a wildcard pattern, find if wildcard pattern is matched with text. The matching should cover the entire text (not partial text).… Read More »

Given an array of integers, a number and a maximum value, task is to compute the maximum value that can be obtained from the array… Read More »

A Multistage graph is a directed graph in which the nodes can be divided into a set of stages such that all edges are from… Read More »