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

Software Trainee

Titan
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I started my coding journey on YouTube, where I first learned the data structure and Algorithm. Then I started my preparation of Data Structure on the LinkedIn.
Application story
This company visited our campus for placements. First, they conducted an online test that contained 3 coding questions.
Why selected/rejected for the role?
I was rejected because I was not able to answer the fundamental questions that were asked in between the interviews.
Preparation
Duration: 6 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Focus on Programming Languages: Master the languages commonly used in the field, such as Python, Java, C++, and JavaScript. Understand fundamental data structures (arrays, linked lists, trees, graphs) and algorithms (sorting, searching, dynamic programming) and their complexities.

Tip 2: Practice Coding Challenges: Regularly solve coding problems on platforms like CodeStudio to enhance problem-solving skills.

Tip 3: Code Reviews: Participate in code reviews with peers to learn different approaches and coding best practices.

Tip 4: Projects: Work on personal or open-source projects to apply your skills to real-world scenarios and build a portfolio.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1: Make it in a clear and organized format.
Tip 2: Add contact information (name, phone, email).
Tip 3: Add a professional summary/objective (tailored).
Tip 4: Add key skills (relevant to the job).
Tip 5: Add work experience (reverse chronological, achievements with quantifiable results).

Interview rounds

01
Round
Medium
Video Call
Duration45 minutes
Interview date8 Nov 2022
Coding problem4

The interviewer was a good person. He first helped me to relax and then started the interview. The time of the interview is 10 AM.

1. Anagram Pairs

Moderate
30m average time
60% success
0/80
Asked in companies
NearbuyAppleAmerican Express

You are given two strings 'str1' and 'str1'.


You have to tell whether these strings form an anagram pair or not.


The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'
Note:
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 
Problem approach

Use 2 frequency array first add all element ASCII code to the array then remove the ascii code for the second string.

Try solving now

2. Reverse Stack Using Recursion

Easy
21m average time
80% success
0/40
Asked in companies
AmazonNoBrokerIBM

Reverse a given stack of 'N' integers using recursion. You are required to make changes in the input parameter itself.


Note: You are not allowed to use any extra space other than the internal stack space used due to recursion.


Example:
Input: [1,2,3,4,5] 
Output: [5,4,3,2,1]

add image

Problem approach

You are not allowed to use any extra space other than the internal stack space used due to recursion.

Try solving now

3. Clone Graph

Moderate
25m average time
75% success
0/80
Asked in companies
MicrosoftGrabUber

You are given a reference/address of a node in a connected undirected graph containing N nodes and M edges. You are supposed to return a clone of the given graph which is nothing but a deep copy. Each node in the graph contains an integer “data” and an array/list of its neighbours.

The structure of the graphNode class is as follows:

class graphNode 
{  
    public:
        int data;
        vector<graphNode*> neighbours;
}
Note :
1. Nodes are numbered from 1 to N.

2. Your solution will run on multiple test cases. If you are using global variables make sure to clear them.
Try solving now

4. Java Question

What is a Thread? (Learn)

Problem approach

A thread is a single sequence stream within a process. Because threads have some of the properties of processes, they are sometimes called lightweight processes. Threads are a popular way to improve the application through parallelism. For example, in a browser, multiple tabs can be different threads.

02
Round
Medium
Video Call
Duration45 minutes
Interview date9 Nov 2022
Coding problem3

This round occurred on the next day of the first round. It also started nearly after 10 AM only.

1. Next Greater Element

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

You are given an array 'a' of size 'n'.



The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.


If no greater elements exist to the right of 'x', consider the next greater element as -1.


For example:
Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.
Problem approach

Use stack till st.top()

Try solving now

2. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach

Use of kadanes algorithm
if(curr_sum<=){
curr_sum=0;
}

Try solving now

3. Java Question

What are the differences between process and thread? (Learn)

Problem approach

A thread has its own program counter (PC), a register set, and a stack space. Threads are not independent of one another, like processes. As a result, threads share with other threads their code section, data section, and OS resources like open files and signals.

03
Round
Easy
HR Round
Duration10 minutes
Interview date9 Nov 2022
Coding problem1

This round happens just after 2nd round, my second round did not go as expected.

1. Basic HR Questions

What are your strengths and weaknesses? .

Why do you want to work at our company? 

What is the difference between confidence and overconfidence?

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
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4656 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Titan
997 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes