Extension to problem 2479:
Determine the number of complete set of Mongean shuffles required to get the original status of a deck of cards of length n.
Brute force :-)
Remove the vowels
Calculate the Levenshtein distance between two strings
Distance walked 3D
01 - Scalar variables
Pernicious Anniversary Problem
Graph Algorithms 3: Number of Connected Components
Path of least resistance - Move all direction
BLOCK x3 (Version 2)
Largest Geometric Series
Calculate the h-index
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office