Given an integer N, the task is to find the largest number that can be shown with the help of N segments using any number of 7 segment displays.
Input: N = 7
Largest number that can be displayed by turning on seven segments is 711 with the help of 3 segments display set.
If the problem is observed carefully, then the number N can be of two types that is even or odd and each of them should be solved separately as follows:
- For Even: As in the above image, There are 6 numbers that can be displayed using even number of segments which is
0 - 6 1 - 2 2 - 5 4 - 4 6 - 6 9 - 6
As it is observed number 1 uses the minimum count of segments to display a digit. Then, even the number of segments can be displayed using 1 with 2 counts of segments in each digit.
- For Odd: As in the above image, there are 5 numbers that can be displayed using an odd number of segments which is
3 - 5 5 - 5 7 - 3 8 - 7
As it is observed number 7 uses the minimum number of odd segments to display a digit. Then an odd number of segments can be displayed using 7 with 3 counts of segments in each digit.
- If the given number N is 0 or 1, then any number cannot be displayed with this much of bits.
- If the given number N is odd then the most significant digit will be 7 and the rest of the digits can be displayed with the help of the (N – 3) segments because to display 7 it takes 3 segments.
- If given number N is even then the most significant digit will be 1 and the rest of the digits can be displayed with the help of the (N – 2) segments because to display 1, it takes 2 segments only.
- The number N is processed digit by digit recursively.
Explanation with Example:
Given number N be – 11
|Digit (from MSB to LSB)||N||Largest number from N using segment||Segments used||Segments remaining|
Then, the largest number will be 71111.
Below is the implementation of the above approach:
- Time Complexity: As in the above approach, there is recursive call which takes O(N) time in worst case, Hence the Time Complexity will be O(N).
- Auxiliary Space Complexity: As in the above approach, taking consideration of the stack space used in recursive call then the auxiliary space complexity will be O(N)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.