Dubverse interview experience Real time questions & tips from candidates to crack your interview
Deep Learning Engineer
Dubverse
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 month
Topics: Stats, ML(basic algorithms), Deep Learning(some advanced algorithms based on the role NLP, CV, Speech, etc), Python, Problem Solving (DSA)
Tip 1 : Know the profile, prepare for that profile.
Tip 2 : Don't just prepare ML algorithms, know some classical algorithms as well.
Tip 3 : Should have at least 2 Projects for that profile.
Tip 4 : Know some deployment as well.
Application process
Where: Other
Eligibility: No criteria
Tip 1 : Simple and short resume with details, projects, and education
Tip 2 : Prepare resume based on the profile
Interview rounds
01
Round
Hard
Telephonic
Duration30 Minutes
Interview date10 Mar 2020
Coding problem2
The current company had no such interview process, The founder and I have worked previously together and were contributing. We had worked previously on the ML domain, and I had also worked on Speech processing which is the core tech of the startup.
So here I'm describing my interview experience with Precily.ai for the Data Science Internship (this experience is aligned with most of the ML profiles be it CV, Speech, NLP, or data science)
The profile was based on Deep Learning and NLP.
I was asked about Simple DL architectures, Loss Functions, some stats concepts, and mathematics of backpropagation.
these were fairly easy if you are in the ML/DL domain.
Some of the hard questions were based on advanced models/concepts like attention, Bert, Seq2Seq, and YOLO (surprisingly).
The timing of the interview was around 2pm and it was like a normal call and the interviewer also helped me wherever I was stuck.
1. Deep Learning Question
Why is attention needed? how do we evaluate attention for Seq2Seq models? Is the attention evaluated at once?
2. Deep Learning Question
What is the Loss function of YOLO?
0
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date28 Jan 2022
Coding problem2
1. Colour The Graph
Moderate
20m average time
80% success
0/80
Asked in companies
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. You have to colour this graph in two different colours, say blue and red such that no two vertices connected by an edge are of the same colour.
Note :
The given graph may have connected components.
2. Wildcard Pattern Matching
Hard
50m average time
30% success
0/120
Asked in companies
Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.
The wildcard pattern can include the characters ‘?’ and ‘*’
‘?’ – matches any single character
‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
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
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
Selected 907 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3319 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2580 views
0 comments
0 upvotes