解決済み

Flip the bit
Given an input character string (e.g. '1001'), return a character string with the bits flipped ('0110').

12ヶ月前

解決済み

Remove a specific character with another
Remove any (-) dash sign with (_) underscore Ex = 'The-Journey-of-thoudsands-miles-starts-with-a-single-step' y = 'The_Jour...

12ヶ月前

解決済み

Find the logic and return the nth number (plus)
This problem is the harder version of Problem 61015 given a sequence of numbers arranged in the following order: A=0,1,3,4,9,1...

12ヶ月前

問題

Find the logic and return the nth number (plus)
This problem is the harder version of Problem 61015 given a sequence of numbers arranged in the following order: A=0,1,3,4,9,1...

12ヶ月前 | 1 | 31 個のソルバー

解決済み

Find the logic and return the nth number
given a sequence of numbers arranged in the following order: A=0,1,3,4,9,10,12,13,27,28,30,31,36,37,...... Write a function th...

12ヶ月前

問題

Find the logic and return the nth number
given a sequence of numbers arranged in the following order: A=0,1,3,4,9,10,12,13,27,28,30,31,36,37,...... Write a function th...

12ヶ月前 | 0 | 34 個のソルバー

解決済み

The Secret Code of Mars
NASA has intercepted a mysterious signal from Mars filled with random letters and numbers. Scientists believe each number in the...

12ヶ月前

解決済み

Find nth number
The numbers 2 and 7 are called lucky numbers, an integer containing only the digits 2 and 7 is also called lucky number. The pro...

12ヶ月前

解決済み

find the nth fibonacci number
The Fibonacci sequence is defined as follows: give n, find the nth fibonacci number

12ヶ月前

問題

find the nth fibonacci number
The Fibonacci sequence is defined as follows: give n, find the nth fibonacci number

12ヶ月前 | 0 | 55 個のソルバー

解決済み

find the nth number (plus)
this problem is the harder version of Problem 61014. The numbers 2 and 7 are called lucky numbers, an integer containing only t...

12ヶ月前

問題

find the nth number (plus)
this problem is the harder version of Problem 61014. The numbers 2 and 7 are called lucky numbers, an integer containing only t...

12ヶ月前 | 0 | 41 個のソルバー

問題

Find nth number
The numbers 2 and 7 are called lucky numbers, an integer containing only the digits 2 and 7 is also called lucky number. The pro...

12ヶ月前 | 0 | 46 個のソルバー

解決済み

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 ...

約1年前

解決済み

De-dupe
Remove all the redundant elements in a vector, but keep the first occurrence of each value in its original location. So if a =...

約1年前

解決済み

Quote Doubler
Given a string s1, find all occurrences of the single quote character and replace them with two occurrences of the single quote ...

約1年前

解決済み

Find Rows with Specift Properities
Delete rows with specific properites as following: Find rows that have a negative value in any element of the row and delete it...

約1年前

解決済み

Finding peaks
Find the peak values in the signal. The peak value is defined as the local maxima. For example, x= [1 12 3 2 7 0 3 1 19 7]; ...

約1年前

解決済み

Max index of 3D array
Given a three dimensional array M(m,n,p) write a code that finds the three coordinates x,y,z of the Maximum value. Example ...

約1年前

解決済み

Determine the number of odd integers in a vector
Determine the number of unique odd integers in a vector. Examples: Input x = [2 5 8 3 7 1]; Output y = 4; Inp...

約1年前

解決済み

Reference Index Number
Given a reference set R of elements (each unique but identical in type), and a list V of elements drawn from the set R, possibly...

約1年前

解決済み

Insert zeros into vector
Insert zeros after each elements in the vector. Number of zeros is specified as the input parameter. For example: x = [1 ...

約1年前

解決済み

Change the sign of even index entries of the reversed vector
change the signs of the even index entries of the reversed vector example 1 vec = [4 -1 -2 9] ans = [9 2 -1 -4] example2...

約1年前

解決済み

Set a diagonal
Given a matrix M, row vector v of appropriate length, and diagonal index d (where 0 indicates the main diagonal and off-diagonal...

約1年前

解決済み

Create a vector whose elements depend on the previous element
The idea is to create a vector A whose elements depend on the previous element : *A(i+1) = 2*A(i)+1* *2 Inputs*: - A : The...

約1年前

解決済み

Implement a bubble sort technique and output the number of swaps required
A bubble sort technique compares adjacent items and swaps them if they are in the wrong order. This is done recursively until al...

約1年前

解決済み

Create an n-by-n null matrix and fill with ones certain positions
The positions will be indicated by a z-by-2 matrix. Each row in this z-by-2 matrix will have the row and column in which a 1 has...

約1年前

解決済み

Unique values without using UNIQUE function
You must return unique values in a vector in *stable* mode without using the unique function. About stable order flag: ...

約1年前

解決済み

Decimation - Optimized for speed
This problem is similar to http://www.mathworks.com/matlabcentral/cody/problems/1092-decimation, only this time the score will b...

約1年前

解決済み

Decimation
When dealing to the Roman Army, the term decimate meant that the entire unit would be broken up into groups of ten soldiers, and...

約1年前