really simple ordering and sum price in static data structure
Sr Java Developer Interview Questions
5,563 sr java developer interview questions shared by candidates
1. Multithreading concepts 2. JVM questions 3. Sliding window leet code problem 4. Stocks leet code problem
Low level design and coding exercise of publisher and subscriber model
JVM Architecture. All interfaces in collection. casting hashmap and hashtable diff. in one line. this much only.
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.
Prepare for every topics that are needed.
Analytical Questions related to patterns like If ‘hi abc’ is ‘jk hgsjk’ The what is ‘abc’
Difference between Spring MVC & SpringBoot
What is the name of the Java pet?
Do you know Microservices ?
Viewing 381 - 390 interview questions