search

saurabh47 / Data-structures-and-algorithms

Popular coding questions solution for interview preparation
MIT License
13 stars 8 forks source link

Implement caesar cipher encryption #7

Closed saurabh47 closed 3 years ago

saurabh47 commented 3 years ago

Given a non-empty string of lowercase letters and a non-negative integer representing a key, write a function that returns a new string obtained by shifting every letter in the input string by k positions in the alphabet, where k is the key. Note that letters should "wrap" around the alphabet; in other words, the letter *z shifted by one returns the letter a

Sample Input

string = "abz"
key = 2

Sample Output

"cdb"
Karthik-B-06 commented 3 years ago

I will take this up. Can you assign it to me ?

saurabh47 commented 3 years ago

@Karthik-B-06 assign to you. Send your pull request as soon as possible.

Aditya489 commented 3 years ago

can you assign this to me , i would like to work on this!

saurabh47 commented 3 years ago

@Aditya489 This problem already solved in c language.you send improved version of this code or you solve same problem in different programming language & send the pull request.

Aditya489 commented 3 years ago

its already closed i did it in another programming language , can i submit now?

saurabh47 commented 3 years ago

@Aditya489 You can send pull request.