1. Given a linked list, find the length/k the node in one iteration. 2. Given an array of characters and their priority and a number n(n<=length of character array) 2.1. Find the character whose length is n and characters are in order of their probability, character which has equal priority has equal probability of coming first. 2.2 This time characters are associated with weights, which means characters with same priority has unequal probability of coming first according to their weights.
1. What is singleton pattern, write the code for the same. 2. Write the code for LFU cache.
Low-level programming, Linux, C++, mathematical problems
Final, finally Bean Scopes in spring Old Java Design patterns: Proxy, Adapter, Facade How would you implement a singleton? Gotcha Snippets ( == / equals / instanceof and other quirky, autoboxing and unboxing gotcha questions) What would you say if your manager turns your proposal down, says simply "this is not how we used to do things", then refuses to elaborate.
Given a product, which KPIs would I present to an investor.
What are the potential issues or limitations when migrating from Hibernate to JPA?
Design interview - google typeahead
You have a binary tree, each node has some data (say price to it). Identify which path of the tree has the maximum sum of price.
Spring exception mapping question - how to turn an exception into a certain api response code
Asked a coding question: when I asked for explanation she went in mute and after sometime she read the coding question again.
Viewing 1681 - 1690 interview questions