Saloni6111 / DSA_POTD_Hacktoberfest2024

MIT License

2 stars 9 forks source link

Open Himanshur-debug opened 8 hours ago

Himanshur-debug commented 8 hours ago

Majority Vote (GFG)

Problem Title: Majority Vote.
Link to Problem: link
Description: The problem is to find candidates in an array nums[] that appear more than one-third of the time, or return -1 if no such candidate exists.

Himanshur-debug commented 8 hours ago

@Saloni6111 Can you please assign this issue to me ?

Saloni6111 commented 6 hours ago

@Saloni6111 Can you please assign this issue to me ?

assigned!