---
title: "Discussion on \"Optimizing Algorithms 1: Majority Element\" | Hashnode"
description: "Discussion on \"Optimizing Algorithms 1: Majority Element\". Let's go over to the problem statement quickly.\n\nGiven an array nums of size n, return the majority element.\nThe majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array..."
url: "https://hashnode.com/posts/optimizing-algorithms-1-majority-element/65149b486bdee9f5cd702357"
---

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

Discussion

# [Optimizing Algorithms 1: Majority Element](https://nyx1on.hashnode.dev/optimizing-algorithms-1-majority-element?utm_source=hashnode&utm_medium=feed)

Let's go over to the problem statement quickly. Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array...

Sep 27, 2023 · 3 min read · nyx1on.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#majority-element](https://hashnode.com/tag/majority-element)
-   [#programming-blogs](https://hashnode.com/tag/programming-blogs)
-   [#optimization](https://hashnode.com/tag/optimization)
-   [#cpp](https://hashnode.com/tag/cpp)

## Written by

[NIRNAY BEHERA](https://hashnode.com/@Nyxion)

@Nyxion

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.