Programming Question:
Jay has N friends, there are M different type of tickets. Jay & his friend, each have some tickets ticket[i]. ticket[N] is the number of tickets Jay has. WAP to return the number of friends who's number of tickets are different from jay's ticket count with 'k'.
input:
1. N - number of Jay's friends
2. M - different type of tickets
3. k - difference required
4. Array of tickets