Apptio Interview Experience | SDE-1 for 2.3 years experienced
Round 1: Coding Round :
4 Coding Questions that need to be answered on pen and paper, 3 correct solution is selection criteria in this round
Question 1 : https://www.geeksforgeeks.org/merge-two-sorted-arrays-o1-extra-space/
Question 2 : https://www.geeksforgeeks.org/add-two-numbers-represented-by-linked-lists/
Question 3 : https://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/
Question 4 : Some question related to 26 alphabets and their counts
Round 2: 1st F2F Technical Round
Question on Projects, SpringBoot and Data Structures, Internal working of HashMap and Hashset in Java, Question on String Literal, difference in HTTP PUT and POST,
Can we write put logic in get and get logic in put ?
What is Singleton Class ? Can we break Singleton Class ?
https://www.geeksforgeeks.org/equilibrium-index-of-an-array/
https://www.geeksforgeeks.org/find-missing-element-in-a-sorted-array-of-consecutive-numbers/
https://www.geeksforgeeks.org/find-two-missing-numbers-set-1-an-interesting-linear-time-solution/
Round 3: 2nd F2F Technical Round
Toughest Round, Question on Projects, Transaction Management in Spring, Spring Mechanism, @Autowired, @Qualifier, @Query Annotations, basic question on SpringBoot, @OneToMany and @ManyToMany in SpringBoot
Question on Java Memory Allocation, Garbage Collection, Errors coming in API, difference in Error and Exceptions, String Literal vs String created by new keyword, Methods of Object class, Question on Hashcode and equals, Contract of Hashcode and equals, Thread management, Questions on wait and notify, Builder, Factory and Singleton Pattern
Print Even and Odd Numbers Using 2 Threads | https://www.baeldung.com/java-even-odd-numbers-with-2-threads
Round 4 : Hiring Manager Round – F2F
Easier than previous rounds, Director of Technology took the interview, Asked in detail about every project i’ve written in my resume and told details of organisation and future works.
After one day i got the call from HR that i was selected. Thanks to GeeksForGeeks for all Help 🙂
Please Login to comment...