Goldman Sachs Developer interview questions

Q. Your strengths and weaknesses Q. puzzle - balls, one of different weight. How many tries on a balance scale to find the one ball that weighs more/less Q. merge part of merge sort Q. which sort is feasible in different situations Q. how can you use merge sort for large arrays Q. internal working of hashset in Java Q. why should you implement equals() and hashcode() for custom objects Q. Can you use serialization and deserialization on a Singleton class to break Singleton pattern Q. longest increasing sequence in an array of positive integers Q. buy and sell stock problem Q. Given an array in which every number occurs twice except one number that occurs once, how can you find the number that occurs once? Q. Difference between semaphore and mutex Q. How can you implement defensive security in a Java application Q. What do you know about the kind of work Goldman Sachs does Q. code to find if given string is palindrome or not Q. Query using SQL self joins - find employee with max salary in each dept Q. code to find if given substring is present in a string Q. design patterns that i have used Q. Questions on projects listed in resume Q. your preferred/most proficient programming language Q. project or technical requirement where you overcame some difficulty Q. what are the different steps that happen when you enter a url in the webbrowser Q. difference between browser and OS cache Q. what are cookies? what will happen if you delete them

Kmp algorithm or implement grep