Basic Technical screening through a pair programming video chat. This was not very difficult as the spec was clearly defined. This was not an algorithm test. There was no other questions or anything unexpected.
Desarrollador Web Java Senior Interview Questions
98,262 desarrollador web java senior interview questions shared by candidates
Sorting algorithm for a string array
Why you want to join accenture, as this company as same as other IT consulting companies.
First Round - Working of Hashmap, ArrayList Linked List, Java Basic questions Second Round - Coding Exercise - implement SecurityDataServices - Objective 1 1) SecurityServiceImpl - methods a)addSecurity(Security s) b)recordTick(long secID, Tick t), c)getPrice(Security s) d) getHistoricalPrice(Security S, TimeStamp asOfNow) 2)SecurityImpl - methods 1) getSecId() 2)getListTicks() 3)getCurrentPrice() 4)recordTick() 3) Tick Impl - methods 1) getPrice(), 2) getTimeStamp() Implement all these classes in 1.5 hr, Use multithreading, I used ConcurrentHashMap and CopyonwriteArraylist use atomic operations like putifAbsent() CodeReview questions - explain the flow of written code, explain java locks, write it using lambda expression, rewrite the code using locks 3rd round - behavioural questions - why do you want to join Sapient? extra activities apart from work? any technology that you follow?
How to make a global error class for Retrofit errors?
Onsite - 1. You have a computer with seven core cpu, you have a file and you have to read each line of the file, check if it has the word UPS in it, if so , then write it to a file, if there is no word as UPS in it, write that line to a different file. 2. An amount will be given as input. The amount will have some cents in change. So, for example $29.90. For the change, you have to start using the highest denomination and go to the lowest until the change value is completely met.
How to make class as Immutable
Shunting Yard Algorithm
Difference between process/thread, heap/stack. What is JIT?
1st phase 1st technical interview: Problem was that given a positive integer n print all distinct ordered sets of positive integer which have sum equal n. eg:- for n=2 output: { [1, 1] } for n=3 output: { [1, 1, 1], [1, 2], [2, 1] } for n=4 output: { [1, 1, 1, 1], [1, 1, 2], [1, 2, 1], [2, 1, 1], [2, 2], [1, 3], [3, 1] }
Viewing 471 - 480 interview questions