Bristle Cone interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Bristle Cone
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Core Java, Java 8 features, Collections framework, Lambda Expressions, Stream API, Functional Interfaces, Design Patterns, Data Structures, Algorithms, High Level Design(HLD), OOPS Concepts, Spring Core, Spring Boot, Hibernate, Oracle DB, Previous Projects, Agile Methodology, Git versioning tool, Branching strategies, Behavioural questions, Managerial questions, Core CS fundamentals, SQL vs NoSQL DB
Tip
Tip

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.

Application process
Where: Naukri
Eligibility: Computer Science field
Resume Tip
Resume tip

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

Interview rounds

01
Round
Easy
Video Call
Duration45 minutes
Interview date15 Jan 2022
Coding problem2

Online technical interview round

1. Rotated Array

Moderate
10m average time
90% success
0/80
Asked in companies
OlaAmazonMorgan Stanley

You are given an array 'arr' of size 'n' having unique elements that has been sorted in ascending order and rotated between 1 and 'n' times which is unknown.


The rotation involves shifting every element to the right, with the last element moving to the first position. For example, if 'arr' = [1, 2, 3, 4] was rotated one time, it would become [4, 1, 2, 3].


Your task is to find the minimum number in this array.


Note :
All the elements in the array are distinct. 


Example :
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.


Problem approach

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)

Try solving now

2. Sort An Array of 0s, 1s and 2s

Easy
10m average time
90% success
0/40
Asked in companies
DelhiveryInfo Edge India (Naukri.com)IBM

You have been given an array/list 'arr' consisting of 'n' elements.


Each element in the array is either 0, 1 or 2.


Sort this array/list in increasing order.


Do not make a new array/list. Make changes in the given array/list.


Example :
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.
Problem approach

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.

Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date17 Jan 2022
Coding problem1

Online Problem Solving Round

1. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80
Asked in companies
GrabThalesSterlite Technologies Limited

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.


A cycle occurs when a node's next points back to a previous node in the list.


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

Sample Example 1

Problem approach

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.

Try solving now
03
Round
Easy
Video Call
Duration45 minutes
Interview date19 Jan 2022
Coding problem1

Online System Design Round

1. URL Shortener

Easy
10m average time
90% success
0/40
Asked in companies
AdobeMakeMyTripShareChat

You have to design a URL shortening service

Problem approach

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.

Try solving now
04
Round
Easy
HR Round
Duration30 minutes
Interview date23 Jan 2022
Coding problem1

Online HR Round

1. Basic HR Questions

Why you are looking for a change?

Why Bristlecone?

What are your expectations from the organisation?

What is your location preference?

 

Problem approach

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Senior Software Engineer
4 rounds | 6 problems
Interviewed by Bristle Cone
1412 views
0 comments
0 upvotes
SDE - Intern
4 rounds | 4 problems
Interviewed by Bristle Cone
954 views
0 comments
0 upvotes
Associate Enginner
2 rounds | 2 problems
Interviewed by Bristle Cone
141 views
0 comments
0 upvotes
Associate Engineer
1 rounds | 1 problems
Interviewed by Bristle Cone
115 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes