function dividedByThree(int $number): bool { while (($number = abs($number)) > 10) { $number = array_sum(str_split($number)); } return in_array($number, [3,6,9]); }1 1 function dividedByThree(int $number): bool 2 2 { 3 - $abs = abs($number); 4 - if($abs < 10){ 5 - return $abs == 3 || $abs == 6 || $abs == 9; 3 + while (($number = abs($number)) > 10) { 4 + $number = array_sum(str_split($number)); 6 6 } 7 - $sum = array_sum(str_split($abs,1)); 8 - return dividedByThree($sum); 6 + 7 + return in_array($number, [3,6,9]); 9 9 }
Hailstone numbers are an interesting number series. The series is defined as follows:
- Pick a number
- If odd multiply by 3 add one
- Else even divide by 2
- Stop calculating the sequence when you reach 1
Different numbers reach one after a different number of steps.
e.g. Here are a few Hailstones that take a long time to reach 1
Hailstone 27 Steps: 112
Hailstone 54 Steps: 113
Hailstone 73 Steps: 116
Your code will need to be efficient with BigInt Lists
case class Hailstones (hailstoneStart : BigInt ) {
private def getSequenceHighPerformance (currentHailstone : BigInt, acc : List[BigInt]) : List[BigInt] = {
if (currentHailstone == 1) currentHailstone::acc
else if (currentHailstone.testBit(0)) getSequenceHighPerformance((currentHailstone << 1) + currentHailstone + 1, currentHailstone :: acc)
else getSequenceHighPerformance(currentHailstone >> 1, currentHailstone :: acc)
}
val seq = getSequenceHighPerformance(hailstoneStart, List[BigInt]()).reverse
}
object Hailstones {
def findSeq = Hailstones(18).seq
}// You can test using ScalaTest (http://www.scalatest.org/).
import org.scalatest._
// TODO: replace this example test with your own, this is just here to demonstrate usage.
// See http://www.scalatest.org/at_a_glance for example usages
class HailstoneSpec extends FlatSpec with Matchers {
"Hailstones(18)" should "should have length 21" in {
Hailstones(18).seq.length should be (21)
}
"Hailstones(27)" should "should have length 112" in {
Hailstones(27).seq.length should be (112)
}
"Hailstones(12)" should "should be list 12,6,3,10,5,16,8,4,2,1" in {
Hailstones(12).seq should be (List[BigInt](12, 6, 3, 10, 5, 16, 8, 4, 2, 1))
}
}shortest I can get it
Write a function that converts a base 10 number and returns binary (base 2).
Binary is consisted of zeros and ones only, and those make up the binary number.
Suppose that place value works the same.
func binaryConverter(_ input: Int) -> Int {
//Your Code Here
return input
}import XCTest
// XCTest Spec Example:
// TODO: replace with your own tests (TDD), these are just how-to examples to get you started
class SolutionTest: XCTestCase {
static var allTests = [
("Test Example", testExample),
]
func testExample() {
let actual = 1
XCTAssertEqual(actual, 1)
}
}
XCTMain([
testCase(SolutionTest.allTests)
])Make a calculator that can take in two integers and process any of the four basic operations. (Add, subtract, multiply, divide).
For the operation symbol, you need to turn the string that the person has inserted, and it should not be case sensitive.
Finally, it should return "Not a valid operation", if the operation that the user entered is not one of the four.
func calculator(_ int1: Int, _ operation: String, _ int2: Int) {
//Code Here
}import XCTest
// XCTest Spec Example:
// TODO: replace with your own tests (TDD), these are just how-to examples to get you started
class SolutionTest: XCTestCase {
static var allTests = [
("Test Example", testExample),
]
func testExample() {
let actual = 1
XCTAssertEqual(actual, 1)
}
}
XCTMain([
testCase(SolutionTest.allTests)
])Convert a grade out of 100 to a letter grade.
Here are the criteria: used in assessing:
90-100 points = A
80-89 points = B
70-79 points = C
60-69 points = D
0-59 points = F
Make sure to return "Not a grade" for integers that are not equal to or between 100.
func gradeCalc(_ score: Int) {
// Your Code under here
}import XCTest
// XCTest Spec Example:
// TODO: replace with your own tests (TDD), these are just how-to examples to get you started
class SolutionTest: XCTestCase {
static var allTests = [
("Test Example", testExample),
]
func testExample() {
let actual = 1
XCTAssertEqual(actual, 1)
}
}
XCTMain([
testCase(SolutionTest.allTests)
])#testing kumite# TODO: Replace examples and use TDD development by writing your own tests
# These are some of the methods available:
# test.expect(boolean, [optional] message)
# test.assert_equals(actual, expected, [optional] message)
# test.assert_not_equals(actual, expected, [optional] message)
# You can use Test.describe and Test.it to write BDD style test groupings#define _GNU_SOURCE 1 #include <string.h> char *Hi(void) { char *x = strdup("Hello World."); return x; }1 + #define _GNU_SOURCE 1 1 1 #include <string.h> 2 - #include <stdlib.h> 3 - #define x "Hello World." 4 4 5 5 char *Hi(void) { 6 - char *ans = calloc(strlen(x) + 1, sizeof(char)); 7 - strcpy(ans, x); 8 - return ans; 5 + char *x = strdup("Hello World."); 6 + return x; 9 9 }