Package g3601_3700.s3663_find_the_least_frequent_digit

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3663 - Find The Least Frequent Digit.

    Easy

    Given an integer n, find the digit that occurs least frequently in its decimal representation. If multiple digits have the same frequency, choose the smallest digit.

    Return the chosen digit as an integer.

    The frequency of a digit x is the number of times it appears in the decimal representation of n.

    Example 1:

    Input: n = 1553322

    Output: 1

    Explanation:

    The least frequent digit in n is 1, which appears only once. All other digits appear twice.

    Example 2:

    Input: n = 723344511

    Output: 2

    Explanation:

    The least frequent digits in n are 7, 2, and 5; each appears only once.

    Constraints:

    • <code>1 <= n <= 2<sup>31</sup> - 1</code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer getLeastFrequentDigit(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait