💡 Day 1 Hey everyone! Let’s learn 1 Java program daily for the next 90 days. 🚀 👉 Problem: Find the second highest number from a list of integers. import java.util.*; public class SecondHighestNumber { public static void main(String[] args) { List<Integer> numbers = List.of(30, 20, 40, 90, 80, 60, 30); numbers.stream() .distinct() // remove duplicates .sorted(Comparator.reverseOrder()) // sort in descending order .skip(1) // skip the highest .limit(1) // take second highest .forEach(n -> System.out.println("Second Highest Number: " + n)); } } 🧠 Explanation: distinct()→ removes duplicates sorted(reverseOrder())→ sorts numbers in descending order skip(1) → skips the highest number limit(1)→ gets the second highest 📌 Output: Second Highest Number: 80 #Java #JavaStreams #CodingInterview #90DaysOfCode
Nice use of streams 👌 though for interviews, an O(n) approach without sorting can be even better.
This is really cool Sandeep! Hope you’ve been well and wishing you all the best!
Impressive..
Stream is fine..easy to use.... But what about performance??