There are total 3 rounds round 1: coding round level easy they will share a link of qualified.io where they will ask 3 questions like sum of multiples of 3 and 5 upto a given number first non-repeated character in a string roman number to integer
Java Senior Interview Questions
6,023 java senior interview questions shared by candidates
They want to know your projects, skills you used
Kmp algorithm, movement of a robotic arm. Covert a number to base 7
1)Java 8 features, Predicate and some basics on Stream API 2)Multithreading concepts. Thread pool, how do we create it? Based on what thread pool size is taken? 3)Countdownlatch, Cyclicbarrier, Semaphore 4)Given an integer array, write code to know if it is sorted or not 5)@Component,@Qualifier,@Autowired 6)Binary Search and its time complexity 7)In one of the applications design, automatic word search is required. How do we make use of all the words in our dictionary?Are we going to store in a database? In memory? 8)BlockingQueue 9)Array and ArrayList differences 10)Given a sorted array in ascending order with no duplicates. Find pairs of elements which will sum up to a given number?Write the optimal code 11)HibernateTemplate 12)ClassLoader and its types 13)CrudRepository and it's usage
what book I was reading now?
Give me a flow of how your Angular frontend communicates with backend system?
Tell me about a time you disagreed with a team member and how did you handle it?
Perguntas sobre sua trajetória, tecnologias que já utilizou, arquitetura de software, ferramentas de DevOps, sua rotina como desenvolvedor, etc. Sempre há perguntas mais detalhadas para entender o seu nível de exposição e aprofundamento naquela tecnologia.
Experience, technical questions on design patterns, performance, data, APIs. Then a coding challenge about writing code to handle stocks trading.
Code: Q1. Design and implement a distributed cache system in Java, capable of handling high-throughput read and write requests across multiple nodes. The goal is to ensure data consistency and fault tolerance in case of node failures. Implement the following features: 1. Data Partitioning: Use consistent hashing to distribute data across multiple cache nodes. 2. Fault Tolerance: When a node fails, ensure that its data is redistributed to other nodes without losing information. 3. Read and Write Operations: Provide efficient APIs for put(key, value) and get(key) operations. 4. Concurrency: Ensure thread-safe operations for the cache. 5. Scalability: Allow dynamic addition and removal of nodes without affecting system performance. Constraints: • Implement the solution in a single Java class for simplicity. • Do not use third-party libraries for consistent hashing. Deliverables: • A working Java implementation of the distributed cache. • Explanation of your design decisions, including trade-offs.
Viewing 4581 - 4590 interview questions