Pythagorean triplet coding problem — given an array, find if it contains a Pythagorean triplet. Walk me through the architecture of a recent project. What is the final keyword used for? What is volatile in Java? Can a HashMap contain null? How would you handle increased load in an asynchronous messaging system like Kafka? What Java version have you used? What CI tools have you used?

Stage1(CV review): 1. diff btw final, finally, and finalize 2.how to make a class immutable 3.diff btw == operator and .equals method and how to use .equals method to compare two objects 4.what is ThreadLocal 5.diff btw Heap and Stack 5. what is Garbage collection Stage2(coding and technical questions): 1. coding was about to find whether the array contains Pythagorean Triplet 2. what happens if your class implements two interfaces with a default method with same signature 3. what are SOLID principles, can you define them 4. diff btw Heap and Stack 5. Is java pass by value or pass by reference 6. diff btw Inheritance and composition 7. diff btw overriding and overloading 8. the coding problem method has a param Collections you need to know how to deal with this param solving the problem, do not assume you are always getting list, it might be Set as well