Given an array, rotate the array to the right by k steps, where k is non-negative. For example, if array is [1,2,3,4,5,6,7] and k=3, the output should be [5,6,7,1,2,3,4].

Given the head of a singly linked list, determine if it has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer.

Describe the architecture of the Spring Model-View-Controller (MVC) framework, including its core components like DispatcherServlet, Controller, Model, View, and View Resolver, and how they interact to handle a web request.

Discuss strategies and architectural considerations for scaling a web application or project to effectively handle a workload of a million concurrent users. Cover aspects like load balancing, database scaling, caching, microservices, etc.

Explain the concept of Java Streams API introduced in Java 8. Discuss its features, common operations (filter, map, reduce), intermediate and terminal operations, and benefits over traditional collections processing.

Explain the fundamental principles of Object-Oriented Programming (OOPS): Encapsulation, Inheritance, Polymorphism, and Abstraction. Provide real-world examples or code snippets to illustrate each concept.

Explain what database indexing is, why it's used, and how it improves query performance. Discuss different types of indexes (e.g., clustered vs. non-clustered) and their trade-offs.

Given a completed Tic Tac Toe board of size NxN, determine if there is a winner. A winner is defined as N consecutive marks (either 'X' or 'O') in any row, column, or diagonal.

Explain multithreading in Java, including how threads are created and managed. Discuss the concept of a race condition, how it occurs, and various mechanisms (e.g., synchronized blocks, locks, volatile keyword) to prevent or handle them.

Explain the different bean scopes available in the Spring Framework (e.g., singleton, prototype, request, session, global session, application, websocket) and when to use each.

Explain the Singleton design pattern, its purpose, and provide a Java implementation. Discuss common challenges (e.g., thread safety, reflection, serialization) and ways to address them.

Explain the concept of B-trees and B+ trees, and how they are fundamental data structures used for indexing in most relational databases. Discuss their advantages in disk-based storage and query performance.

Provide pseudocode or a high-level explanation for implementing the Depth-First Search (DFS) algorithm for traversing a graph or tree. Discuss its typical applications.

Discuss the basic concepts of anomaly detection. What are anomalies, why is their detection important, and what are some general approaches or techniques (e.g., statistical, machine learning-based) used to identify them?

Explain the 'Diamond Problem' in the context of multiple inheritance and how Java addresses this issue, particularly with interfaces and default methods.

Design the core components and interactions for a Snake and Ladder game. This includes designing classes for Player, Board, Dice, Snake, Ladder, and the Game itself, along with their attributes and methods.

Discuss strategies and architectural considerations for scaling a web application or project to effectively handle a workload of a million concurrent users. Cover aspects like load balancing, database scaling, caching, microservices, etc. (Asked again in a different round).