How should I practice Check Permutation Divisible by Eight?

Start by reading the full statement, solve the visible examples, then compare the pattern against related HackerRank onsite interview problems in FastPrep.

Is Check Permutation Divisible by Eight associated with HackerRank?

FastPrep tags this as a HackerRank onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem

Check Permutation Divisible by Eight

Learn this problem

HackerRankFULLTIMEONSITE INTERVIEW

Problem statement

You are given an array of strings numbers. Each string consists of decimal digits.

For each string, determine whether any permutation of its digits can form a number divisible by 8. Return an integer array where the i-th value is 1 if some permutation of numbers[i] is divisible by 8, and 0 otherwise.

A permutation may include leading zeros; the permuted string is interpreted as a decimal number.

Function

checkPermutationDivisibleByEight(numbers: String[]) → int[]

Examples

Example 1

numbers = ["61", "75", "123"]return = [1, 0, 1]

"61" can be permuted to "16", which is divisible by 8. "75" has no valid permutation. "123" can be permuted to "312", which is divisible by 8.

Example 2

numbers = ["8", "10", "1000"]return = [1, 0, 1]

"8" is already divisible by 8. Neither "10" nor "01" is divisible by 8. "1000" is divisible by 8.

Constraints

Each string in numbers contains only decimal digits.