What was the tough / interesting part in your work. What version of Java are you using, 19? Why? -> What are new features in java 19? What’s virtualGC How do we create a connection pool in java What’s the springBoot version being used, name any few things used in SpringBoot in your app How do you connect to mongo, and how connections are managed and scaled DS: Given a linked list, Head->2->3->4->5->6 and. Given t=2 Count from end t levels and delete the node Told approach of while-> nodeNext !=null get the counter and then get the node at place counter-t, then remove the node Given a list of integers [-3,-1,0,4] find all combinations such that sum=0 [0,[-3,-1,0,4],[-3,-1,4]] Answered brute force method of 2^n also said we can do 2pointer approach but unable fit for all lists While doing this, Answer was to Sort. So asked what’s the best sorting out of all what’s timeComplexity
