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).
Dice Throw Problem: 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.
Most Frequently Occurring Item: Finding the most frequently occurring item in a given integer array (Counting the occurrences / frequency of array elements).
Levenshtein Distance (String Edit Distance): Quantifying how dissimilar two strings (e.g., words) are to one another.
Statistics of Rolling Dice: The frequencies and probabilities of different numbers obtained by the throw of dice.
Longest Increasing Subsequence (LIS): Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
Subarray with given multiplication: How many subsets can multiply to a certain number? (Find sets/arrays of numbers that multiply to a given value).
Subarray with given sum: How many subsets can sum up to a certain number? (Find sets/arrays of numbers that add up to a given value).
Shortest Common Supersequence (SCS): Given two strings, return the shortest string that has both strings.
Kadane's Algorithm to Maximum Sum Subarray Problem: Given an array of integers,find the maximum subarray sum possible of all the non-empty subarrays.
Online Statistical Hypothesis Tests (2-Sample Tests) List of statistical tests Normality Tests: Shapiro–Wilk Test Levene's Test for Homogeneity of Variance (test for the equality of variances) Paired Samples Tests: Paired Samples t-Test, Wilcoxon Signed-Rank Test Independent Samples Tests: Independent Samples t-Test, Mann–Whitney U Test, Kolmogorov-Smirnov Test Decision Tree Tool > Guides Choose either Pair or...
Search Algorithms – Linear Search vs Binary Search
Linear search and binary search are both algorithms used to find a specific element within a sorted or unsorted list. Linear search involves sequentially checking each element in the list until the desired element is found or the end of the list is reached. This method is simple but less efficient for large lists. On...
Segment Operation – Merge, Subtract, Add, Calculate Overlapping Percentage
Given two lists of segments, perform operations like merging, subtracting, adding, and calculating overlapping percentages.
Dijkstra’s Shortest Path Algorithm
Dijkstra's Shortest Path Algorithm is a technique for finding the shortest route between a starting point and other points in a graph with weighted edges. It progressively updates distances from the start by exploring neighboring nodes, leading to an optimal path when all nodes are considered. It's effective for non-negative weights, used in navigation and...
InvestCal: Investment Calculators
Online tools for stock investors Download: Android Version , Windows Version Discussions: report problems, request new features, Q&A, etc. ––>-->
The Nth and the Sum of Fibonacci Numbers: Finding the Nth Fibonacci number and the summation from the first to the Nth, comparing recursive and iterative methods.
Knapsack – Combinatorial Optimization, Optimal Combination
Combinatorial Optimization: The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large...
Common Elements: Find common elements in arrays.
Egg dropping refers to a class of problems in which it is important to 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...
Partition Problem: Given a set of positive integers, check if it can be divided into two subsets with equal sum.
Boolean Parenthesization Problem:Count the number of ways we can parenthesize the expression so that the value of expression evaluates to TRUE.
Optimal Strategy for a Game: 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.
Maximum Product when Cutting Rope: 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.
Rod Cutting Problem: 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.
Word Break Problem: 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.
Coin Change (Change-making problem): 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?
