Search results
Given an array of positive integers arr[], return the second largest element from the array. If the second largest element doesn't exist then return -1. Note: The second largest element should not be equal to the largest element.
elif item > second_max and item < max: second_max = item. return -1 if second_max == float("-inf") else second_max. I saw this one on a Visa interview. int second = Integer.MIN_VALUE; for(int value : arr) { if(value > first) { second = first; first = value; } else if(value > second && value != first) { second = value; return second;
Second Largest Digit in a String - Given an alphanumeric string s, return the second largest numerical digit that appears in s, or -1 if it does not exist. An alphanumeric string is a string consisting of lowercase English letters and digits. Example 1: Input: s = "dfa12321afd" Output: 2 Explanation: The digits that appear in s are [1, 2, 3].
In-depth solution and explanation for LeetCode 179. Largest Number in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis. Better than official and forum solutions.
Boost your coding interview skills and confidence by practicing real interview questions with LeetCode. Our platform offers a range of essential problems for practice, as well as the latest questions being asked by top-tier companies.
Given an array arr, return the second largest element from an array. If the second largest element doesn't exist then return -1. Note: The second largest element should not be equal to the first largest. Examples: Input: arr = [12, 35, 1, 10, 34
14 lis 2024 · Given an array of positive integers arr [] of size n, the task is to find second largest distinct element in the array. Note: If the second largest element does not exist, return -1. Examples: Explanation: The largest element of the array is 35 and the second largest element is 34.
