Given a pair of words (the first is the correct spelling and the second is the contestant’s spelling of the word) determine if the word is spelt correctly. The degree of correctness is as follows: CORRECT if it is an exact match ALMOST CORRECT if no more than 2 letters are wrong WRONG if 3 or more letters are wrong Input Format: Input consists of a pair of words. Output Format: Output the contestant’s spelling of the word and the degree of correctness. All letters are upper case. The output is to be formatted exactly like that for the sample output given below. Assumptions: Words contain only upper case letters. The maximum word length is 10. Sample Input: SAMPLE SIMPLE Sample Output: SIMPLE IS ALMOST CORRECT PROGRAM
-
Notifications
You must be signed in to change notification settings - Fork 0
Given a pair of words (the first is the correct spelling and the second is the contestant’s spelling of the word) determine if the word is spelt correctly. The degree of correctness is as follows: CORRECT if it is an exact match ALMOST CORRECT if no more than 2 letters are wrong WRONG if 3 or more letters are wrong Input Format: Input consists o…
Bhramari-P-shetty/spellbee
About
Given a pair of words (the first is the correct spelling and the second is the contestant’s spelling of the word) determine if the word is spelt correctly. The degree of correctness is as follows: CORRECT if it is an exact match ALMOST CORRECT if no more than 2 letters are wrong WRONG if 3 or more letters are wrong Input Format: Input consists o…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published