Skip to content

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

Naveens1605/Swayamwar-Problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Swayamwar-Problem

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.

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

No packages published

Languages