Home

Given a set of items, each with a size and a value, determine the number of each item to include in a collection so that the total size is less than or equal to a given limit and the total value is as large as possible.

Dijkstra’s algorithm computes the shortest path in a graph by iteratively choosing the nearest node and updating distances, guaranteeing optimality when all edge weights are non-negative.

We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last item from the row, removes it from the row permanently, and receives the value of the item. Determine the optimal value if we move first.

There are d dice each having f faces (numbers: 1 to f). Find the number of ways in which we can get sum s from the faces when the dice is rolled.

Statistics of Rolling Dice: The frequencies and probababilities of different numbers obtained by the throw of dice.

How many ways can we make the change, and what is the minimum number of coins that add up to a given amount of money?

Finding the most frequently occurring item in a given integer array (Counting the occurrences / frequency of array elements).

Comparing different algorithms/approaches for sorting, such as Default JS Sort, Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, and Quick Sort. Also comparing standard versions and applied versions (e.g., those with optimization, early termination).

Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.

Finding the longest subsequence common to all sequences in a set of sequences

Given two strings, return the shortest string that has both strings.

How many subsets can sum up to a certain number? (Find sets/arrays of numbers that add up to a given value).

How many subsets can multiply to a certain number? (Find sets/arrays of numbers that multiply to a given value).

Quantifying how dissimilar two strings (e.g., words) are to one another.

Given an array of integers,find the maximum subarray sum possible of all the non-empty subarrays.

Detect if some arrays are same after rotation.

Finding unique characters in a string.

Finding the Nth Fibonacci number and the summation from the first to the Nth, comparing recursive and iterative methods.

Find common elements in arrays.

Find the correct response without exceeding a (low) number of certain failure states.

Suppose you have ‘n’ eggs and you want to determine from which floors in a ‘k’-floor building you can drop an egg such that is doesn’t break. You are to determine the minimum number of attempts you need in order to find the critical floor in the worst case while using the best strategy.

Given a set of positive integers, check if it can be divided into two subsets with equal sum.

Given a rope of length n meters, cut the rope in different parts of integer lengths in a way that maximizes product of lengths of all parts. You must make at least one cut. Assume that the length of rope is more than 2 meters.

Given a rod of length n inches and an array of prices that includes prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces.

Given a string and a dictionary of words, determine if the string can be segmented into a space-separated sequence of one or more dictionary words.

Count the number of ways we can parenthesize the expression so that the value of expression evaluates to TRUE.

Comparing Linear Search and Binary Search

Given two lists of segments, perform operations like merging, subtracting, adding, and calculating overlapping percentages.