Category: algorithm

2019
0
dailyalgorithm

7월의 알고리즘

20190715instruction array에서 인접한 subarray의 합의 최댓값을 찾아라최댓값이 음수일 경우 0을 리턴한다. 123// e.g.Max.sequence(new int[]{-2, 1, -3, 4, -1, 2, 1, -5, 4});// 6: {4, -1, 2, 1} Solution12345678910

0
dailyalgorithm

Salesman's Travel

Instructions A traveling salesman has to visit clients. He got each client’s address e.g. “432 Main Long Road St. Louisville OH 43071” as a list.The basic zipcode format usually consists of two capita

0
dailyalgorithm

Greed is Good

Instructions Greed is a dice game played with five six-sided dice. Your mission, should you choose to accept it, is to score a throw according to these rules. You will always be given an array with fi

2018
0
dailyalgorithm

Simple Pig Latin

Instructions Move the first letter of each word to the end of it, then add “ay” to the end of the word. Leave punctuation marks untouched. Examples 12pigIt('Pig latin is cool'); // igPay at

0
dailyalgorithm

Highest Scoring Word

Instructions Given a string of words, you need to find the highest scoring word. Each letter of a word scores points according to it’s position in the alphabet: a = 1, b = 2, c = 3 etc. You need to re

0
dailyalgorithm

Persistent Bugger

Instructions Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until yo

0
dailyalgorithm

Dubstep

Instructions Polycarpus works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes

0
dailyalgorithm

CamelCase Method

Instructions Write simple .camelCase method (camel_case function in PHP, CamelCase in C# or camelCase in Java) for strings. All words must have their first letter capitalized without spaces. For inst

0
dailyalgorithm

Isograms

Instructions An isogram is a word that has no repeating letters, consecutive or non-consecutive. Implement a function that determines whether a string that contains only letters is an isogram. Assume

0
dailyalgorithm

Bit Counting

Instructions Write a function that takes an integer as input, and returns the number of bits that are equal to one in the binary representation of that number. You can guarantee that input is non-nega