[Feature Request]: LC problem - 169 Majority Element

[Ramya-korupolu]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

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.

Use Case

Helps for solving leet code problem

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[github-actions]

Hi @Ramya-korupolu! 👋 Thank you for opening your first issue on CodeHarborHub. We're excited to hear your thoughts and help you out. You've raised a great topic! Please provide as much detail as you can so we can assist you effectively. Welcome aboard!

[github-actions]

Hi @Ramya-korupolu! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions]

Hello @Ramya-korupolu! Your issue #1912 has been closed. Thank you for your contribution!