NeuroByte | Complete Solutions Guide

10 Programming missions

4 Languages per mission

40 Ready solutions

1 Single HTML file

Mission Library

Use the search box to find a problem quickly, or filter the website to show only one programming language.

No matching missions found

Try searching for words like sum, even, max, vowel, reverse, palindrome, sort, or FizzBuzz.

01 Beginner Mission

Binary Server

Problem: Read two integers, one per line, and print their sum.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');
const a = parseInt(lines[0]);
const b = parseInt(lines[1]);
console.log(a + b);

Python

a = int(input())
b = int(input())
print(a + b)

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(a + b);
    }
}

using System;

class Main {
    static void Main() {
        int a = int.Parse(Console.ReadLine());
        int b = int.Parse(Console.ReadLine());
        Console.WriteLine(a + b);
    }
}

02 Beginner Mission

Mail Server

Problem: Given N integers, one per line, print EVEN or ODD for each number.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');
const n = parseInt(lines[0]);

for (let i = 1; i <= n; i++) {
    const num = parseInt(lines[i]);
    console.log(num % 2 === 0 ? 'EVEN' : 'ODD');
}

Python

n = int(input())

for _ in range(n):
    num = int(input())
    print('EVEN' if num % 2 == 0 else 'ODD')

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            System.out.println(num % 2 == 0 ? "EVEN" : "ODD");
        }
    }
}

using System;

class Main {
    static void Main() {
        int n = int.Parse(Console.ReadLine());

        for (int i = 0; i < n; i++) {
            int num = int.Parse(Console.ReadLine());
            Console.WriteLine(num % 2 == 0 ? "EVEN" : "ODD");
        }
    }
}

03 Array Mission

Firewall Server

Problem: Given N integers on the second line, print the minimum number, then the maximum number.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');
const nums = lines[1].split(' ').map(Number);

console.log(Math.min(...nums));
console.log(Math.max(...nums));

Python

n = int(input())
nums = list(map(int, input().split()))

print(min(nums))
print(max(nums))

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;

        for (int i = 0; i < n; i++) {
            int x = sc.nextInt();

            if (x < min) min = x;
            if (x > max) max = x;
        }

        System.out.println(min);
        System.out.println(max);
    }
}

using System;
using System.Linq;

class Main {
    static void Main() {
        Console.ReadLine();

        int[] nums = Console.ReadLine()
            .Split(' ')
            .Select(int.Parse)
            .ToArray();

        Console.WriteLine(nums.Min());
        Console.WriteLine(nums.Max());
    }
}

04 String Mission

Router Station

Problem: Count how many vowels are in the input string. Vowels are a, e, i, o, u, case-insensitive.

● Solved

JavaScript

const line = require('fs').readFileSync(0, 'utf8').trim();
const vowels = 'aeiouAEIOU';

let count = 0;

for (const ch of line) {
    if (vowels.includes(ch)) count++;
}

console.log(count);

Python

line = input()
vowels = 'aeiouAEIOU'

count = sum(1 for ch in line if ch in vowels)

print(count)

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();

        int count = 0;

        for (char ch : line.toCharArray()) {
            if ("aeiouAEIOU".indexOf(ch) >= 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

using System;

class Main {
    static void Main() {
        string line = Console.ReadLine();
        string vowels = "aeiouAEIOU";

        int count = 0;

        foreach (char ch in line) {
            if (vowels.IndexOf(ch) >= 0) {
                count++;
            }
        }

        Console.WriteLine(count);
    }
}

05 Math Mission

RAM Station

Problem: Print the sum of N numbers, then print the floor of their average.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');
const n = parseInt(lines[0]);
const nums = lines[1].split(' ').map(Number);

const sum = nums.reduce((a, b) => a + b, 0);

console.log(sum);
console.log(Math.floor(sum / n));

Python

n = int(input())
nums = list(map(int, input().split()))

total = sum(nums)

print(total)
print(total // n)

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        long sum = 0;

        for (int i = 0; i < n; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        System.out.println(sum / n);
    }
}

using System;
using System.Linq;

class Main {
    static void Main() {
        int n = int.Parse(Console.ReadLine());

        long[] nums = Console.ReadLine()
            .Split(' ')
            .Select(long.Parse)
            .ToArray();

        long sum = nums.Sum();

        Console.WriteLine(sum);
        Console.WriteLine(sum / n);
    }
}

06 Logic Mission

CPU Cooler

Problem: Count how many of the N readings are strictly greater than threshold T.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');

const [n, t] = lines[0].split(' ').map(Number);
const readings = lines[1].split(' ').map(Number);

const count = readings.filter(x => x > t).length;

console.log(count);

Python

n, t = map(int, input().split())
readings = list(map(int, input().split()))

print(sum(1 for x in readings if x > t))

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int t = sc.nextInt();

        int count = 0;

        for (int i = 0; i < n; i++) {
            if (sc.nextInt() > t) {
                count++;
            }
        }

        System.out.println(count);
    }
}

using System;
using System.Linq;

class Main {
    static void Main() {
        int[] first = Console.ReadLine()
            .Split(' ')
            .Select(int.Parse)
            .ToArray();

        int t = first[1];

        int count = Console.ReadLine()
            .Split(' ')
            .Select(int.Parse)
            .Count(x => x > t);

        Console.WriteLine(count);
    }
}

07 String Mission

Database Node

Problem: Print the input string reversed.

● Solved

JavaScript

const line = require('fs').readFileSync(0, 'utf8').trim();

console.log(line.split('').reverse().join(''));

Python

line = input()

print(line[::-1])

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String line = sc.nextLine();

        System.out.println(new StringBuilder(line).reverse().toString());
    }
}

using System;

class Main {
    static void Main() {
        string line = Console.ReadLine();

        char[] chars = line.ToCharArray();
        Array.Reverse(chars);

        Console.WriteLine(new string(chars));
    }
}

08 String Mission

Auth Terminal

Problem: Print YES if the word reads the same forwards and backwards. Otherwise, print NO.

● Solved

JavaScript

const word = require('fs').readFileSync(0, 'utf8').trim();

const reversed = word.split('').reverse().join('');

console.log(word === reversed ? 'YES' : 'NO');

Python

word = input()

print('YES' if word == word[::-1] else 'NO')

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String word = sc.nextLine();
        String reversed = new StringBuilder(word).reverse().toString();

        System.out.println(word.equals(reversed) ? "YES" : "NO");
    }
}

using System;

class Main {
    static void Main() {
        string word = Console.ReadLine();

        char[] chars = word.ToCharArray();
        Array.Reverse(chars);

        Console.WriteLine(word == new string(chars) ? "YES" : "NO");
    }
}

09 Array Mission

Backup Array

Problem: Print the N numbers sorted in ascending order, space-separated.

● Solved

JavaScript

const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');

const nums = lines[1]
    .split(' ')
    .map(Number)
    .sort((a, b) => a - b);

console.log(nums.join(' '));

Python

n = int(input())
nums = sorted(map(int, input().split()))

print(' '.join(map(str, nums)))

Java

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] nums = new int[n];

        for (int i = 0; i < n; i++) {
            nums[i] = sc.nextInt();
        }

        Arrays.sort(nums);

        StringBuilder sb = new StringBuilder();

        for (int i = 0; i < n; i++) {
            if (i > 0) sb.append(' ');
            sb.append(nums[i]);
        }

        System.out.println(sb.toString());
    }
}

using System;
using System.Linq;

class Main {
    static void Main() {
        Console.ReadLine();

        int[] nums = Console.ReadLine()
            .Split(' ')
            .Select(int.Parse)
            .ToArray();

        Array.Sort(nums);

        Console.WriteLine(string.Join(" ", nums));
    }
}

10 Final Mission

AI Core FINAL

Problem: Print 1 to N using FizzBuzz rules. FIZZBUZZ for multiples of both 3 and 5, FIZZ for 3, BUZZ for 5, number otherwise.

● Solved

JavaScript

const n = parseInt(require('fs').readFileSync(0, 'utf8').trim());

for (let i = 1; i <= n; i++) {
    if (i % 15 === 0) {
        console.log('FIZZBUZZ');
    } else if (i % 3 === 0) {
        console.log('FIZZ');
    } else if (i % 5 === 0) {
        console.log('BUZZ');
    } else {
        console.log(i);
    }
}

Python

n = int(input())

for i in range(1, n + 1):
    if i % 15 == 0:
        print('FIZZBUZZ')
    elif i % 3 == 0:
        print('FIZZ')
    elif i % 5 == 0:
        print('BUZZ')
    else:
        print(i)

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        for (int i = 1; i <= n; i++) {
            if (i % 15 == 0) {
                System.out.println("FIZZBUZZ");
            } else if (i % 3 == 0) {
                System.out.println("FIZZ");
            } else if (i % 5 == 0) {
                System.out.println("BUZZ");
            } else {
                System.out.println(i);
            }
        }
    }
}

using System;

class Main {
    static void Main() {
        int n = int.Parse(Console.ReadLine());

        for (int i = 1; i <= n; i++) {
            if (i % 15 == 0) {
                Console.WriteLine("FIZZBUZZ");
            } else if (i % 3 == 0) {
                Console.WriteLine("FIZZ");
            } else if (i % 5 == 0) {
                Console.WriteLine("BUZZ");
            } else {
                Console.WriteLine(i);
            }
        }
    }
}

Quick Reference

Common stdin patterns for competitive programming and in-game coding editors.

JavaScript

// Read all input
const lines = require('fs').readFileSync(0, 'utf8').trim().split('\n');

// Parse examples
const n = parseInt(lines[0]);
const nums = lines[1].split(' ').map(Number);
const word = lines[0];

Python

# Single value
n = int(input())

# Multiple values
a, b = map(int, input().split())

# Array
nums = list(map(int, input().split()))

# Read all input
import sys
lines = sys.stdin.read().strip().split('\n')

Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        String token = sc.next();
        String line = sc.nextLine();
    }
}

using System;
using System.Linq;

class Main {
    static void Main() {
        string line = Console.ReadLine();
        int n = int.Parse(Console.ReadLine());

        int[] nums = Console.ReadLine()
            .Split(' ')
            .Select(int.Parse)
            .ToArray();
    }
}