# Puzzle 31) The archery match

Submitted by Abhishek Jain, on September 30, 2017

**Puzzle**

In an archery match, scoring of target was 40 for the bull's-eye, 39 for the outer ring of bull’s eye, and 24,23, 17, and 16 respectively for the outer rings of one another respectively, as shown below.

Three players had a match with six arrows each. The result was: Marry, 120 points; Harry, 110 points; Larry, 100 points. Every arrow hits the target and scored, and the bull's-eye was hit only once.

**Can you, from above facts, determine the exact six score/hit made by each competitor?**

**Key points**

- Scoring: 40 for bull’s eye and 39,24,23,17 and 16 respectively for the rings from the center outwards.
- There are 3 players for a match with six arrows each.
- Result: Marry : 120 points, Harry : 110 points, Larry: 100 points.
- It is guaranteed that, every arrow hits the target.
- The bull’s eye was hit only once.
- You have to determine the exact six hits made by each competitor.

**Answer**

Mr. Larry scored 100 with four 17's and two 16's; Harry scored 110 with two 23's and four 16's; Marry scored 120 with one 40 and five 16's. Her score can be made up in various ways, except for the fact that the bull's-eye has to be got in somewhere, and this is the only place where it can occur.

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.