Problem Statement: Featured Product

An e-commerce website tracks which products are purchased each day.

The product that sells the most on a given day becomes the featured product for the next day.

📌 Rules:

1. Count how many times each product appears in the list.
2. The product with the highest number of purchases is selected.
3. If there is a tie (multiple products have the same highest count):
   • Sort those product names in alphabetical order (A → Z).
   • Choose the last product in that sorted list.

---

🎯 Task:

Given a list of product names purchased during the day, determine which product will be the featured product.

---

📥 Input Format:

• The first line contains an integer n (number of products).
• The next n lines each contain a product name (string).

---

📤 Output Format:

• Print a single string → the featured product.

---

⚙️ Constraints:

• $1 \leq n \leq 10^4$1≤n≤104

---

📌 Example 1:

Input:

6
redShirt
greenPants
redShirt
orangeShoes
blackPants
blackPants

Explanation:

• redShirt → 2 times
• blackPants → 2 times
• greenPants, orangeShoes → 1 time

Tie between:

• blackPants, redShirt

Sorted:

blackPants
redShirt

👉 Last = redShirt

Output:

redShirt

---

📌 Example 2:

Input:

9
yellowShirt
redHat
blackShirt
bluePants
redHat
pinkHat
blackShirt
yellowShirt
greenPants

Explanation:

• yellowShirt → 2
• blackShirt → 2
• redHat → 2
• greenPants → 2

Sorted:

blackShirt
greenPants
redHat
yellowShirt

👉 Last = yellowShirt

Output:

yellowShirt

C Program

#include <stdio.h>
#include <string.h>

#define MAX 10000
#define LEN 100

int main() {
    int n;
    scanf("%d", &n);

    char products[MAX][LEN];

    for (int i = 0; i < n; i++) {
        scanf("%s", products[i]);
    }

    char unique[MAX][LEN];
    int count[MAX] = {0};
    int uniqueCount = 0;

    // Step 1: Count frequency
    for (int i = 0; i < n; i++) {
        int found = -1;

        for (int j = 0; j < uniqueCount; j++) {
            if (strcmp(products[i], unique[j]) == 0) {
                found = j;
                break;
            }
        }

        if (found != -1) {
            count[found]++;
        } else {
            strcpy(unique[uniqueCount], products[i]);
            count[uniqueCount] = 1;
            uniqueCount++;
        }
    }

    // Step 2: Find max frequency
    int max = 0;
    for (int i = 0; i < uniqueCount; i++) {
        if (count[i] > max) {
            max = count[i];
        }
    }

    // Step 3: Store max frequency products
    char result[MAX][LEN];
    int resCount = 0;

    for (int i = 0; i < uniqueCount; i++) {
        if (count[i] == max) {
            strcpy(result[resCount], unique[i]);
            resCount++;
        }
    }

    // Step 4: Sort alphabetically
    for (int i = 0; i < resCount - 1; i++) {
        for (int j = i + 1; j < resCount; j++) {
            if (strcmp(result[i], result[j]) > 0) {
                char temp[LEN];
                strcpy(temp, result[i]);
                strcpy(result[i], result[j]);
                strcpy(result[j], temp);
            }
        }
    }

    // Step 5: Print last product
    printf("%s\n", result[resCount - 1]);

    return 0;
}