Problem Description

Given an array of strings, strArr, where the array's length is guaranteed to be at least 3, the task is to identify and return the third largest word based on its string length.

Ranking Rules

Words are ranked in descending order of their string length. Specific rules apply:

1. Length Priority: A word with a greater length is considered to have a higher rank.
2. Tie-breaking (Stability): If two or more words share the same length, their original relative order from the input array must be preserved. This implies a stable sort by length in descending order.
3. Target: After ranking, the word at rank 3 (i.e., the third element in the sorted sequence) should be returned.

Assumptions and Constraints

• Each string within strArr will consist solely of letters.
• The input array strArr will always contain at least 3 strings.

Examples

• Input: ["hello", "world", "before", "all"]
  • Output: "world"
• Input: ["hello", "world", "after", "all"]
  • Output: "after"
• Input: ["coder", "byte", "code"]
  • Output: "code"
• Input: ["abc", "defg", "z", "hijk"]
  • Output: "abc"