onCodility Distinct Solution

This is a warmup. Follow specification.

Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from 1

If you enjoyed this post, then make sure you subscribe to my Newsletter and/or Feed.

use std::io; use std::cmp::Ordering; fn get_numbers() – Vecu32 let mut line = String::new(); io::stdin().read_line(&mut line).ok().expect(Failed to read line); line.split_whitespace().map(s llect() fn main() let a = get_numbers(); let b = get_numbers(); let mut alice = 0; let mut bob = 0; for idx in 0..3 match a[idx].cmp(&b[idx]) Ordering::Less = bob += 1, Ordering::Greater = alice += 1, Ordering::Equal = , println!( , alice, bob);

onCodility SqlSegmentsSum Kalium 2015 Solution

This entry was posted inCoding ChallengeHackerRankRust. Bookmark thepermalink.

onCodility BinaryGap Solution

HackerRank Non-Divisible Subset Solution

HackerRank Flatland Space Station Solution

HackerRank Divisible Sum Pairs Solution

HackerRank Kangaroo Solution

HackerRank Circular Array Rotation Solution