K-Pangrams
Difficulty: Medium
Acceptance: %
Points: 30.00
Given a string str and an integer k, determine if it is possible to transform the string into a pangram using at most k operations.
An operation consists of swapping any alphabetic character in the string with another lowercase alphabetic character.
Note: A pangram is a sentence that contains every letter of the English alphabet at least once.
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(1)
Constraints: - 1<= str.size() <= 10^5
- 0<= k <= 50
- str may contain duplicate characters
- str contains only lowercase alphabets or spaces.
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.