GAURAV YADAVgaurav246blogs.hashnode.dev·Dec 9, 2023151 DSA Problem journeyQ6:)Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. Example: Input: nums = [3,2,3] Output: [3] Solution: class Solution { public: vector<int> majorityElement(vector<int>& nums) { int countMajority...11 likesC++Add a thoughtful commentNo comments yetBe the first to start the conversation.
