XOR Encryption (6 Marks)
CodeChefOpen on judge ↗
You are given an encryption algorithm in which the plain text is encrypted by XORing the plaintext N times where N is the length of the string. The catch here is that every time we XOR the string, we shift it to the right. The string is in hexadecimal. For example if the string is abcd we get,  Your tas
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start