Mining Engineering > GATE 2023 > Aptitude
There are 4 red, 5 green, and 6 blue balls inside a box. If N number of balls are picked simultaneously, what is the smallest value of N that guarantees there will be at least two balls of the same colour?
One cannot see the colour of the balls until they are picked.
A
4
B
15
C
5
D
2

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science