Community Profile

photo

J. S. Kowontan


Last seen: 10ヶ月 前

2,678 2017 年以降の合計貢献数

Computational mathematician and research scientist with specialization in algorithm development, AI and machine learning, signal and systems, modeling and simulation, physics engine development, operation research, advanced modern control and MATLAB programming.

連絡する

J. S. Kowontan's バッジ

  • Famous
  • Project Euler I
  • Puzzler
  • Draw Letters
  • Creator
  • Strings II Master
  • Word Puzzles Master
  • Celebrity
  • Computational Geometry II Master
  • Magic Numbers II Master
  • Computational Geometry IV Master
  • Indexing V Master
  • Number Manipulation II Master
  • Matrix Patterns III Master
  • Indexing IV Master

すべて表示

貢献した分野
表示方法

解決済み


Pass the Threshold!!
Write a Matlab function that will take as input a matrix of arbitrary dimensions and a scalar threshold value, and return a vec...

2年以上 前

解決済み


The Google Interview: Two Eggs Problem
Consider the following problem, a popular Google interview question: A firm has invented a super-strong egg. For publicity pu...

2年以上 前

解決済み


Toads and Frogs Puzzle 2
On a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, a...

2年以上 前

問題


Nash Equilibrium
In game theory, a player's *strategy* is any of the options that can be chosen in a setting where the pay-off depends not only o...

2年以上 前 | 3 | 4 個のソルバー

解決済み


Reverse the input
Given an input (n), produce an output in the reverse order with out using string variables or string function. Example x ...

2年以上 前

解決済み


Sum of first n terms of a harmonic progression
Given inputs a, d and n, return the sum of the first n terms of the harmonic progression a, a/(1+d), a/(1+2d), a/(1+3d),....

2年以上 前

解決済み


string comparision
compare two strings if both are same return 1 else return 0

2年以上 前

問題


Let's Make A Deal: Criminal Minds
The game of Let's Make A Deal proceeds as follows; The player is given the choice of three doors: Behind one door is a car; b...

2年以上 前 | 1 | 2 個のソルバー

解決済み


Find argmax of a function
You are given vectors x and y (=f(x)). Return the element of x for which f(x) is maximized.

2年以上 前

問題


Let's Make A Deal: The Player's Dilemma 2
Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. Y...

2年以上 前 | 1 | 2 個のソルバー

問題


Let's Make A Deal: The Player's Dilemma
Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. Y...

2年以上 前 | 0 | 2 個のソルバー

解決済み


Seperate array to small section according to its index position
Given a integer n, we can generate a sequence [0,1,2,3,4,..., 2^n-1], then we separate it to two sequence according to their ind...

2年以上 前

解決済み


Penny Distribution Machine
A machine consists of a row of boxes. To start, one places N pennies in the leftmost box. The machine then redistributes the pen...

2年以上 前

解決済み


God of War: The Chains Of Olympus
The Spartan warrior, Kratos, is held by a chain of _n > 1_ links in the underworld. His only chance of survival is to break the ...

2年以上 前

解決済み


Counting Squares
An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown bel...

2年以上 前

問題


God of War: The Chains Of Olympus
The Spartan warrior, Kratos, is held by a chain of _n > 1_ links in the underworld. His only chance of survival is to break the ...

2年以上 前 | 1 | 5 個のソルバー

問題


Penny Distribution Machine
A machine consists of a row of boxes. To start, one places N pennies in the leftmost box. The machine then redistributes the pen...

2年以上 前 | 0 | 11 個のソルバー

解決済み


Five Fingers
A little girl has just learnt how to count from 1 to N using the five fingers of her left hand as follows. She starts by calling...

2年以上 前

問題


Five Fingers
A little girl has just learnt how to count from 1 to N using the five fingers of her left hand as follows. She starts by calling...

2年以上 前 | 2 | 20 個のソルバー

問題


Counting Squares
An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown bel...

2年以上 前 | 3 | 22 個のソルバー

解決済み


007: Chinese Barrack Invasion
*MISSION:* Successfully invade a military barrack located in China. *WARNING:* There is a row of _n_ security switches protec...

2年以上 前

問題


007: Chinese Barrack Invasion
*MISSION:* Successfully invade a military barrack located in China. *WARNING:* There is a row of _n_ security switches protec...

2年以上 前 | 1 | 8 個のソルバー

問題


The Generalized-N Eggs Problem
A firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building with...

2年以上 前 | 1 | 2 個のソルバー

問題


The Google Interview: Two Eggs Problem
Consider the following problem, a popular Google interview question: A firm has invented a super-strong egg. For publicity pu...

2年以上 前 | 2 | 17 個のソルバー

解決済み


Sort Reversal
There are n index cards in a row, with n distinct integers written on them (one number per card) so that the numbers are sorted ...

2年以上 前

問題


Sort Reversal
There are n index cards in a row, with n distinct integers written on them (one number per card) so that the numbers are sorted ...

2年以上 前 | 2 | 9 個のソルバー

問題


Toads and Frogs Puzzle 2
On a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, a...

2年以上 前 | 1 | 6 個のソルバー

解決済み


Toads and Frogs Puzzle
On a one-dimensional board with n + m + 1 cells, there are n counters in the first n cells representing Toads and m counters in ...

2年以上 前

問題


Toads and Frogs Puzzle
On a one-dimensional board with n + m + 1 cells, there are n counters in the first n cells representing Toads and m counters in ...

2年以上 前 | 0 | 7 個のソルバー

解決済み


Raise each element to the power of its index in a matrix
In a matrix, A = [1,2;3,4] raise the power of each element like: 1^1+2^3+3^2+4^4 and add it all to produce the result 274

2年以上 前

Load more