Home
Posts
Categories
Series
Tags
About
High Score Kit: Greedy#1
Make Large Number
postedOn: 2024-4-11   updatedOn: 2024-4-11   includedIn: HighScoreKit
wordsCount: 208   readingTime: 1 min   viewers:

Problem

Given a number, your task is to remove k digits from the number in such a way that the remaining digits form the largest possible number. The number is provided as a string number and the integer k represents the number of digits to remove. Your function solution should return the resulting largest number as a string.

Constraints

  • number is a string representing a number that is at least two digits long and up to 1,000,000 digits.
  • k is a natural number that is at least 1 and less than the number of digits in number.

Example Inputs and Outputs

number k return
“1924” 2 “94”
“1231234” 3 “3234”
“4177252841” 4 “775841”

Explanation of Examples

  • Example 1:
    • Removing two digits from “1924” can create the numbers [19, 12, 14, 92, 94, 24]. The largest number among them is “94”.
  • Example 2:
    • From “1231234”, removing three digits can create several combinations, with “3234” being the largest possible result.
  • Example 3:
    • For “4177252841”, the largest number formed by removing four digits is “775841”.

How to Approach?

Step1: Initialize variables in loop

Code

1
2
3
4
5
6
7
8
9
class Solution {
    public String solution(String number, int k) {
        String answer = "";
        


        return answer;
    }
}
Aaron Oh
고려대코딩개발협동조합 창단 멤버
Table of Contents
Related Posts
High Score Kit: DFS&BFS#2
Problem In the ROR game, you play on a team that competes to destroy the opposing team’s base first, making it advantageous to reach the enemy base as quickly as possible. Suppose you’re a team member and are located at position (row: 1, column: 1) on a 5x5 map, while the enemy base is at (row: 5, column: 5).
2024-4-11
High Score Kit: DFS&BFS#1
Problem You are given an array of non-negative integers and a target number. Your task is to find how many ways you can add and subtract the given numbers to achieve the target number. The order of numbers in the array must be preserved. For example, with the array [1, 1, 1, 1, 1], there are five ways to reach the target number 3:
2024-4-11
High Score Kit: Brute Force#2
Problem In a power grid network composed of n transmission towers connected in a tree structure via wires, you are tasked with dividing the network into two parts by cutting one of the wires. The goal is to make the number of transmission towers in each part as equal as possible.
2024-4-11
High Score Kit: Brute Force#1
Problem In the XX game, there is a fatigue system represented by non-negative integers, allowing players to explore dungeons by using a certain amount of fatigue. Each dungeon requires a “minimum required fatigue” to start exploring and consumes a certain amount of “fatigue” upon completion. For example, to explore a dungeon with a “minimum required fatigue” of 80 and a “consumption fatigue” of 20, a player’s current remaining fatigue must be at least 80, and it will decrease by 20 after exploring the dungeon.
2024-4-11
High Score Kit: Stack&Queue#2
Problem The Programmers team is currently performing feature improvement tasks. Each feature can only be released when its progress reaches 100%. However, since the development speed of each feature varies, it is possible for features developed later to be completed earlier. In such cases, a feature that is developed later will be released together with the feature in front of it that is scheduled for earlier release.
2024-4-10
High Score Kit: Stack&Queue#1
Problem Given an array arr consisting of integers ranging from 0 to 9, the task is to remove consecutive duplicates while preserving the order of the remaining elements. For instance, if arr = [1, 1, 3, 3, 0, 1, 1], the result should be [1, 3, 0, 1]. Similarly, for arr = [4, 4, 4, 3, 3], the result should be [4, 3].
2024-4-10