Tip 1 : Prepare well on the Java 8 features, Collections Framework(esp. Lambda Expressions, Stream API and Functional Interface), Core Java concepts, Design Patterns, Spring Boot Framework
Tip 2 : Practice basic data structures(Array, LinkedList, Tree) and algorithms(searching, sorting) on online compiler.
Tip 3 : Prepare well on the previous projects along with personal projects (if any) regarding the architecture, tools and technologies used along with the High Level Design.
Tip 1 : Make single page resume mentioning the relevant experience, skills, personal details, achievements in brief.
Tip 2 : Make sure to add the relevant coding or professional profiles on the top section and also include the impact of the code/work done in terms of percentage improvement in the final output/application
Online technical interview round



All the elements in the array are distinct.
Input: arr = [3,4,5,1,2]
Output: 1
Explanation: The original array was [1,2,3,4,5] and it was rotated 3 times.
Step 1 : Traverse the complete array and find a minimum. This solution requires O(n) time.
Step 2 : I was asked to optimise the solution
Step 3 : I applied Binary Search to optimise. The time complexity now becomes O(logn)



Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]
Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]
Explanation: The array is sorted in increasing order.
Step 1 : Count the number of 0s, 1s and 2s in the given array. Then store all the 0s in the beginning followed by all the 1s then all the 2s.
Step 2 : Time Complexity: O(n).
Only two traversals of the array is needed.
Space Complexity : O(1).
As no extra space is required.
Online Problem Solving Round



In the given linked list, there is a cycle, hence we return true.

Step 1 : Marking visited nodes without modifying the linked list data structure
Step 2 : A temporary node is created. The next pointer of each node that is traversed is made to point to this temporary node.
Step 3 : Time complexity: O(n).
Only one traversal of the loop is needed.
Auxiliary Space: O(1).
There is no space required.
Online System Design Round



You have to design a URL shortening service
Tip 1 : Have knowledge about Requirement, Traffic, URL Length, Encoding, Database
Tip 2 : Have sound knowledge of NoSQL databases, how NoSQL can be used in the given situation
Tip 3 : Have knowledge about encoding through MD 5 algorithm.
Online HR Round
Why you are looking for a change?
Why Bristlecone?
What are your expectations from the organisation?
What is your location preference?
Tip 1 : Be genuine and express the honest opinions in terms of reason to look for change.
Tip 2 : Read about the organization from various sources, to get a better understanding of the domain.
Tip 3 : Ask genuine questions to the HR at the last as well.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?