---
title: "Discussion on \"229. Majority Element II - Leetcode\" | Hashnode"
description: "Discussion on \"229. Majority Element II - Leetcode\". Problem\nProblem Link\nGiven an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.\nExample 1:\nInput: nums = [3,2,3]\nOutput: [3]\n\nExample 2:\nInput: nums = [1]\nOutput: [1]\n\nEx"
url: "https://hashnode.com/posts/229/653680ce7f8067fe0b6cf9f6"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [229\. Majority Element II - Leetcode](https://chetan77.hashnode.dev/229?utm_source=hashnode&utm_medium=feed)

Problem Problem Link Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. Example 1: Input: nums = \[3,2,3\] Output: \[3\] Example 2: Input: nums = \[1\] Output: \[1\] Ex

Oct 23, 2023 · 4 min read · chetan77.hashnode.dev  
Updated Oct 18  
Read the article

-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#moores-voting-algorithm](https://hashnode.com/tag/moores-voting-algorithm)
-   [#java](https://hashnode.com/tag/java)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

  
[View profile](https://hashnode.com/@chetan77)

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.