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

SDE - 1

DTCC
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I kept practicing DSA and CS fundamentals from the 3rd year of Engineering. Along with it, I was also learning web development and I made some good projects.
Application story
This company visited our campus for hiring their only i applied for the same it has many round starting with online assessment at the starting.
Why selected/rejected for the role?
i was rejected because i do not able to give a concise and good solution for the question being asked to me .
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Mention some good projects on resume
Tip 2 : Be confident
Tip 3 : Good with computer science basics and ds and algo

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Good Projects
Tip 2 : Having some achievements is plus point

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date30 Dec 2022
Coding problem2

1. Course Schedule

Easy
15m average time
85% success
0/40
Asked in companies
UberAppleDunzo

You are a student of Netaji Subhas Institute of Technology. You have to take ‘N’ number of courses labelled from 1 to N to complete your B.Tech Degree.

Some courses may have prerequisites, for example, to take course 1 you have to first take course 2, which is expressed as a pair: [1, 2]. Now, your task is to find is it possible for you to finish all courses.

Note: There are no duplicate pairs in the prerequisites array.

For example-
If N = 2 and prerequisite = [[1, 2]]. Then, there are a total of 2 courses you need to take. To take course 1 you need to finish course 2. So, it is possible to complete all courses. 
Problem approach

BFS uses the indegrees of each node. We will first try to find a node with 0 indegree. If we fail to do so, there must be a cycle in the graph and we return false. Otherwise we set its indegree to be -1 to prevent from visiting it again and reduce the indegrees of its neighbors by 1. This process will be repeated for n (number of nodes) times.

Try solving now

2. Word Break

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitExpedia GroupWalmart

You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

Note :
You can use any string of A multiple times.
Examples :
A =[“coding”, ”ninjas”, “is”, “awesome”]  target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Problem approach

The value of a node is the string length. We calculate the number of nodes in the recursion tree for string length=1, 2, ...., n respectively.

For example, when string length=4, the second layer of the recursion tree has three nodes where the string length is 3, 2 and 1 respectively. And the number of subtree rooted at these three nodes have been calculated when we do the mathmatical induction.

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date30 Dec 2022
Coding problem2

1. Number of Islands

Hard
45m average time
55% success
0/120
Asked in companies
UberMakeMyTripHike

You have a 2D grid of ‘N’ rows and ‘M’ columns which are initially filled with water. You are given ‘Q’ queries each consisting of two integers ‘X’ and ‘Y’ and in each query operation, you have to turn the water at position (‘X’, ‘Y’) into a land. You are supposed to find the number of islands in the grid after each query.

An island is a group of lands surrounded by water horizontally, vertically, or diagonally.

Problem approach

1. We will maintain an array called “islands” which will record the no. of islands visited.
2. Traverse through each element of the grid.
3. Check, if it is a land and it has not been visited yet i.e. grid[i][j] == 1, increment islands and change the value of that element to water i.e. 0.
4. Change the adjacent elements to water i.e. '0'.

Try solving now

2. Merge Point of Two Linked Lists

Moderate
0/80
Asked in companies
AdobeMicrosoftChegg Inc.

Given two singly linked lists, 'FIRST_HEAD' and 'SECOND_HEAD'. Your task is to find the 'MERGING POINT' i.e. the data of the node at which merging starts. If there is no merging, return -1.

For example:-

The given Linked Lists are merging at node c1.
In this case, c1 is 'MERGING POINT'.

alt.txt

Problem approach

Traverse once through both the linked lists and find the longer one.
Connect the tail of the longer list to its head.
Now start from the head of the shorter linked list with two pointers as we did in the algorithm to find the cycle.
Find the point where both the pointers meet.
Reset one of the pointer to the head of the shorter linked list.
Now move both the pointers with the same speed (one step at a time).
The place where both the pointers meet is the merge point.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date30 Dec 2022
Coding problem2

1. Basic HR Questions

Can you work under pressure?
Are you willing to relocate or travel?

2. Basic HR Questions

What are your goals?
What motivates you to do good job?

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
SDE - 1
3 rounds | 6 problems
Interviewed by DTCC
869 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by DTCC
1089 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by DTCC
1477 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes