Statistik
0 Probleme
53 Lösungen
RANG
N/A
of 301.287
REPUTATION
N/A
BEITRÄGE
0 Fragen
0 Antworten
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
0
RANG
of 21.220
REPUTATION
N/A
DURCHSCHNITTLICHE BEWERTUNG
0.00
BEITRÄGE
0 Dateien
DOWNLOADS
0
ALL TIME DOWNLOADS
0
BEITRÄGE
0 Beiträge
BEITRÄGE
0 Öffentlich Kanäle
DURCHSCHNITTLICHE BEWERTUNG
BEITRÄGE
0 Discussions
DURCHSCHNITTLICHE ANZAHL DER LIKES
Feeds
Gelöst
Find perfect placement of non-rotating dominoes (easier)
Given a list of ordered pairs, find the order they should be placed in a line, such that the sum of the absolute values of the d...
12 Monate vor
Gelöst
Remove all the words that end with "ain"
Given the string s1, return the string s2 with the target characters removed. For example, given s1 = 'the main event' your ...
12 Monate vor
Gelöst
Find state names that start with the letter N
Given a list of US states, remove all the states that start with the letter N. If s1 = 'Alabama Montana Nebraska Vermont Ne...
12 Monate vor
Gelöst
Weighted Convolution
Given two input vectors x = [x_1, x_2, ..., x_K] and y = [y_1, y_2, ..., y_K] of equal length, compute the weighted convolution ...
12 Monate vor
Gelöst
Simpsons's rule (but not Homer Simpson)
I wonder what Homer Simpson would have thought of Simpson's rule? Somehow I doubt his thoughts would have included the phrase Ne...
12 Monate vor
Gelöst
Composite Trapezoidal Rule for Numeric Integration
Use the trapezoidal rule to numerically integrate a function, _f(x)_, passed as the first argument, between upper and lower limi...
12 Monate vor
Gelöst
Sequential Unconstrained Minimization (SUMT) using Exterior Penalty
Write a function to find the values of a design variable vector, _x_, that minimizes a scalar objective function, _f_, given a f...
12 Monate vor
Gelöst
Quasi-Newton Method for Unconstrained Minimization using BFGS Update
Write a function to find the values of a design variable vector, _x_, that minimizes an unconstrained scalar objective function,...
12 Monate vor
Gelöst
Differential equations I
Given a function handle |f| an initial condition |y0| and a final time |tf|, solve numerically the differential equation dy...
12 Monate vor
Gelöst
Monte-Carlo integration
Write a function that estimates a d-dimensional integral to at least 1% relative precision. Inputs: * d: positive integer....
12 Monate vor
Gelöst
Stuff the Board
You have a stack of tiles to put onto an array-like playing board. Each tile has a number (always an integer), and the board var...
12 Monate vor
Gelöst
Rotate and display numbered tile
Imagine a square tile with four numbers on it, one on each edge. We will call these edges north, east, south, and west. If th...
12 Monate vor
Gelöst
Find best domino orientation
Given a list of pairs, find the orientation they should be placed in a line, such that the sum of the absolute values of the dif...
12 Monate vor
Gelöst
Choose the best fitting dominoes
You will be given a cell array of nx2 matrices. Choose one row from each matrix. These are the ordered pairs that will be placed...
12 Monate vor
Gelöst
Scoring for oriented dominoes
Given a list of ordered pairs, and the order they should be placed in a line, find the sum of the absolute values of the differe...
12 Monate vor
Gelöst
Sum of series III
What is the sum of the following sequence: Σ(2k-1)^3 for k=1...n for different n?
12 Monate vor
Gelöst
Sum of series II
What is the sum of the following sequence: Σ(2k-1)^2 for k=1...n for different n?
12 Monate vor
Gelöst
Approximation of Pi
Pi (divided by 4) can be approximated by the following infinite series: pi/4 = 1 - 1/3 + 1/5 - 1/7 + ... For a given number of...
12 Monate vor
Gelöst
Largest Geometric Series
Extension of Ned Gulley's wonderful Problem 317. In a geometric series, ratio of adjacent elements is always a constant value. ...
12 Monate vor
Gelöst
Sum of series I
What is the sum of the following sequence: Σ(2k-1) for k=1...n for different n?
12 Monate vor
Gelöst
Chain multiplication - 02
Following up on the problem in 55295, you found the number of multiplications needed to multiply two matrices. Now, you are giv...
etwa ein Jahr vor
Gelöst
Find an optimal placement of coolers on a grid
In a certain chemical plant, 6 new pieces of cooling equipment (coolers) are to be installed in a vacant space. This vacant spac...
etwa ein Jahr vor
Gelöst
longest common substring : Skipped character version
Two strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, howe...
etwa ein Jahr vor
Gelöst
Sub-sequence - 03
Given three sequences, find the length of the longest common subsequence. It is similar to the previous problem -- <https...
etwa ein Jahr vor
Gelöst
Sub-sequence - 02
Given two sequences, find the length of the longest common subsequence. a=[1,1,1,1,1,2,3,1,4] b=[2,3,0,0,9,5,4,1] longe...
etwa ein Jahr vor
Gelöst
Sub-sequence - 01
Find the length of the longest increasing subsequence in the given array. a=[2,4,2,1,3,5,6] longest increasing subsequen...
etwa ein Jahr vor
Gelöst
Is this group simply connected?
Given connectivity information about a graph, your job is to figure out if the graph is fully connected. You are given a list of...
etwa ein Jahr vor
Gelöst
Quarantine Days
In these quarantine days, a list of what Max may do on a typical day is given in a table with the starting hour to ending hour. ...
etwa ein Jahr vor
Gelöst
The Tortoise and the Hare - 02
Previous problem <https://www.mathworks.com/matlabcentral/cody/problems/45425-the-tortoise-and-the-hare-01> Suppose in an inf...
etwa ein Jahr vor
Gelöst
The Tortoise and the Hare - 01
Suppose in an infinitely long line, the hare is standing in position 0. From that place, it can jump either in the +ve direct...
etwa ein Jahr vor

