The questions asked in the technical interview were of medium complexity: Method overriding, SOLID Principle, Steps to create an Immutable Class, Questions related to collections (e.g. ArrayList vs LinkedList, when to use what time complexity of deletion from an ArrayList (deletion is very easy but the right shifting of remaining list elements is what makes it complex) vs LinkedList, How HashSet stores values, TreeMap vs LinkedHashMap and when to use what, Question on transient and volatile variables, How to create your own effectively final variable?
Print the numbers from a list whose 2nd digit is ONE(”1”). e.g. i/p [1, 8, 2123, 612, 51] o/p [2123, 612, 51]
Find the maximum frequency of a character in the string and print true if the frequency is even else print false. e.g. i/p “aaavvvvvbb” o/p false (since v occurs 5 times(max freq) and its odd)
IN JAVA 8 only.
