Check if huge integer string is divisible by 8

Q: Check if huge integer string is divisible by 8

Evaluates modular arithmetic reasoning and large-integer string-processing skills in the Coding & Algorithms domain for a Data Scientist role, with an abstraction level of algorithmic fundamentals and low-level string manipulation.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a very large non-negative integer represented as a decimal string s (it may be too large to fit in 64-bit types). Determine whether the integer is divisible by 8 without converting the full string to an integer type.

Constraints/assumptions:

1 <= len(s) <= 10^6
s contains only characters '0'..'9'
Leading zeros may appear (e.g., "00016" ).

Return true/false.

Examples:

s = "16" → true
s = "123" → false
s = "1000" → true

Check if huge integer string is divisible by 8

Quick Overview

Comments (0)