Skip to contentSkip to footer

Java Senior Interview Questions

Salaries
Interviews

6,013 java senior interview questions shared by candidates

You are given an array of words (strings) and an integer k k k. Your task is to write a function that returns the k k k longest words from the array. If there are fewer than k k k words in the array, return all the words sorted by length in descending order. If there are ties in length, return the words in alphabetical order. Input: An array of strings words[] where each string consists of lowercase and uppercase letters only. An integer k k k (1 ≤ k k k ≤ 100). Output: An array of the k k k longest words, sorted by length (and alphabetically if lengths are equal). Example: plaintextInput: words = ["apple", "banana", "kiwi", "grape", "watermelon"], k = 3 Output: ["watermelon", "banana", "apple"] Input: words = ["cat", "bat", "rat"], k = 5 Output: ["bat", "cat", "rat"] Constraints: The output array should not exceed k k k elements. You may assume that the input will always have at least one word.
avatar

Senior Java Developer

Interviewed at Apple

4.2★
Apr 18, 2025

You are given an array of words (strings) and an integer k k k. Your task is to write a function that returns the k k k longest words from the array. If there are fewer than k k k words in the array, return all the words sorted by length in descending order. If there are ties in length, return the words in alphabetical order. Input: An array of strings words[] where each string consists of lowercase and uppercase letters only. An integer k k k (1 ≤ k k k ≤ 100). Output: An array of the k k k longest words, sorted by length (and alphabetically if lengths are equal). Example: plaintextInput: words = ["apple", "banana", "kiwi", "grape", "watermelon"], k = 3 Output: ["watermelon", "banana", "apple"] Input: words = ["cat", "bat", "rat"], k = 5 Output: ["bat", "cat", "rat"] Constraints: The output array should not exceed k k k elements. You may assume that the input will always have at least one word.

Circuit breaker implementation in Java: The service A calls service B and service C every time. If one service fails 3-times in 10 minutes ( or 20 seconds in the implementation) the next call will be blocked for 5 minutes (10 seconds in the implementation). There was given a simulation of remote method calls, I needed to implement only the execute() which calls the remote service if possible.
avatar

Senior Backend Java Engineer

Interviewed at Wise

3.7★
Feb 19, 2026

Circuit breaker implementation in Java: The service A calls service B and service C every time. If one service fails 3-times in 10 minutes ( or 20 seconds in the implementation) the next call will be blocked for 5 minutes (10 seconds in the implementation). There was given a simulation of remote method calls, I needed to implement only the execute() which calls the remote service if possible.

Viewing 421 - 430 interview questions

Glassdoor has 6,013 interview questions and reports from Java senior interviews. Prepare for your interview. Get hired. Love your job.