In this program, we need to enter Strings of Beverages that bride and groom drinks. The bride will marry the groom who takes the same beverage and if bride at zeroth position doesn't match with her groom then remaining brides can't get marry. The Output will be the no. of pairs of Bride and Groom match.
-
Notifications
You must be signed in to change notification settings - Fork 0
In this program, we need to enter Strings of Beverages that bride and groom drinks. The bride will marry the groom who takes the same beverage and if bride at zeroth position doesn't match with her groom then remaining brides can't get marry. The Output will be the no. of pairs of Bride and Groom match.
Naveens1605/Swayamwar-Problem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
In this program, we need to enter Strings of Beverages that bride and groom drinks. The bride will marry the groom who takes the same beverage and if bride at zeroth position doesn't match with her groom then remaining brides can't get marry. The Output will be the no. of pairs of Bride and Groom match.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published