Filter interviews by
I appeared for an interview in Jan 2022.
Round duration - 30 Minutes
Round difficulty - Hard
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.
The loss function of YOLO is a combination of localization loss, confidence loss, and classification loss.
YOLO uses a sum-squared error loss function to calculate the localization loss, which penalizes the difference between the predicted bounding box and the ground truth bounding box.
The confidence loss penalizes the model for incorrect objectness predictions and no object predictions in grid cells.
The classification ...
Round duration - 60 Minutes
Round difficulty - Easy
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
Create a recursive function to match the pattern with the text character by character.
Handle cases for '?' and '*' characters in the pattern.
Use dynamic programming to optimize the solution.
Check for edge cases like empty pattern or text.
Iterate through the pattern and text to determine if they matc
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
The task is to color a graph with two colors in a way that no two adjacent vertices share the same color.
Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.
Use graph coloring algorithms like Greedy Coloring or Backtracking to solve the problem.
Consider connected components in the graph while coloring.
If a vertex has an odd cycle, it is not possible to color the graph
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.
Tip 1 : Simple and short resume with details, projects, and education
Tip 2 : Prepare resume based on the profile
Top trending discussions
I applied via Company Website and was interviewed before Sep 2021. There were 4 interview rounds.
Logical Aptitude, Verbal, Numerical
2 codes one small and easy , another big and medium difficultly
I applied via LinkedIn and was interviewed before Sep 2021. There were 3 interview rounds.
Good problemtic Skills and knowledge check and sharpness
C Language use for programs and Oracle and Java in learning process
Yes, there are many operators and logical programs used in various fields.
Operators like +, -, *, / are used in mathematical calculations.
Logical programs like if-else, switch-case are used in programming.
Operators like AND, OR, NOT are used in boolean logic.
Operators like >, <, == are used in comparisons.
Examples of logical programs include sorting algorithms, search algorithms, etc.
I applied via Referral and was interviewed in Nov 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
TCS
Accenture
Wipro
Cognizant