Company: Visa fte
Difficulty: medium
\n Queue: Replace Consonants \n \n \n Given a string message and an integer n , replace every n th consonant with the next consonant from the alphabet while keeping the case consistent (e.g., b becomes c , e becomes f , etc.). \n \n Notes: \n \n The list of consonants in alphabetical order is: b , c , d , f , g , h , j , k , l , m , n , p , q , r , s , t , v , w , x , y , z . \n z must be replaced with b (and B with C ). \n \n \n Also note that you are not expected to provide the most optimal solution, but a solution with time complexity not worse than O(message.length 2 ) will fit within the execution time limit. \n \n\n \n Input Format \n The input consists of: \n \n A string message . \n An integer n . \n \n \n\n \n Output Format \n Return the modified string after replacing the consonants as specified. \n \n\n \n Constraints \n \n 1 ≤ n ≤ 100 \n 1 ≤ message.length ≤ 10 5 \n \n \n\n \n Examples \n \n Example 1: \n Input:\nmessage = \\\"CodeSignal\\\"\nn = 3 \n Output:\n\\\"CodeTigna