Missing Cards in Deck

Problem Statement

Missing Cards in Deck Problem Description Daniel is a magician. As part of his practice, he uses a standard deck of cards made up of 4 suits, with 13 cards in each suit. The cards are numbered 1 to 13, and the four suits are marked with the letters S, C, H and D. Each card is labeled in the format DXY, where D denotes the suit and XY denotes the number. All numbers are expressed in two digits i.e., the card of S and number 8 is labeled S08. One day, getting late for a show, Daniel hurriedly picked up the nearest deck on his table and left the house. Upon reaching the venue, he realised his deck was a used deck, which may not be complete or be mixed with cards from other decks. Given the cards in his deck as a single string, can you write a program to determine how many cards are missing in each suit? If the deck contains identical cards in a suit, print DUPLICATE for that suit instead of the missing number of cards. Read the input from STDIN and print the output to STDOUT. Do not print