705. Design HashSet Design a HashSet without using any built-in hash table libraries. Implement MyHashSet class: void add(key) Inserts the value key...
2708. Maximum Strength of a Group You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like...
539. Minimum Time Difference Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two...
the sliding array technique cannot be applied to an array which contains negative elements. int subarraySum(vector<int>& nums, int k) { ...
this problem is done using the sliding window technique.. In this, we will first make a map that will store characters and their count until the size...
2542. Maximum Subsequence Score In this approach, we will try to maximize the sum by summing the maximum values together and multiplying the product...