HackerRank Interview Prep - Problem 14: Frequency Queries скачать в хорошем качестве

HackerRank Interview Prep - Problem 14: Frequency Queries

Hello, my name is Brian Dyck, I am a full-time software engineer and a Computer Science graduate walking through HackerRank problems for new and old programmers alike. My goal is to help programmers build up skills and not just see the solutions to problems, but to learn how to think through the problems. Many new videos to come, so stay tuned! Problem: Frequency Queries Description: You are given queries. Each query is of the form two integers described below: 1 x : Insert x in your data structure. 2 y: Delete one occurence of y from your data structure, if present. 3 z : Check if any integer is present whose frequency is exactly z. If yes, print 1 else 0. The queries are given in the form of a 2-D array queries of size q where queries[i][0] contains the operation, and queries[i][1] contains the data element.