Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Cvent interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Cvent
upvote
share-icon
4 rounds | 5 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 8 months
Topics: OOPS, DBMS, OS, Data Structures, System Design, Algorithms
Tip
Tip

Tip 1 : Revise everything you have written on your resume, Specially projects and skills.
Tip 2 : Do not rush into the optimal solution (unless directly asked) if you have already solved
the question, always give a quick brute force approach followed by optimizations.
Tip 3 : While coding, use meaningful variable names and write modular code.

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

Tip 1 : Mention only those things which you actually know and have worked on the same.
Tip 2 : Mention project links in the resume.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date8 Oct 2020
Coding problem1

It was an Aptitude Round, conducted in the morning.
The time given was more than enough. Most of the questions were easy, just basic knowledge
is enough. There was no negative marking in this round.

1. MCQ Question

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then
a. deadlock can never occur
b. deadlock may occur
c. deadlock has to occur
d. None of these

Problem approach

Tip 1 : Do a thorough practice of the topics like OS, DBMS, System Design and DSA.
Tip 2 : Practice questions from the internet.

02
Round
Hard
Online Coding Interview
Duration60 Minutes
Interview date9 Oct 2020
Coding problem1
1. Smallest Window
Moderate
10m average time
90% success
0/80
Asked in companies
GoogleHSBCSnapdeal

You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the characters present in X.

Example:

View more
Problem approach

Step 1 : I had first taken two pointers, left and right initially pointing to the first element of the string s.
Step 2 : Then I used the right pointer to expand the window until I got a desirable window i.e. a window that contained all of the characters of t.
Step 3 : Once I had a window with all the characters, I moved the left pointer ahead one by one. If the window was still a desirab...

View more
Try solving now
03
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date10 Oct 2020
Coding problem1
1. LCA Of Binary Tree
Moderate
10m average time
90% success
0/80
Asked in companies
MyntraAmerican ExpressAmazon

You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.


View more
Problem approach

Step 1 : I started with brute force and then gave him the optimal approach. Time and space complexities
were discussed for each solution. He asked me to code the optimal one.
Step 2 : So here is the algorithm I used to solve the question.
1. I started traversing the tree from the root node.
2. If the current node itself was one of p or q, I marked a variable mid as True and continue...

View more
Try solving now
04
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date13 Oct 2020
Coding problem2
1. Set Matrix Zeros
Easy
30m average time
65% success
0/40
Asked in companies
QualcommGartnerSlice

Given an ‘N’ x ‘M’ integer matrix, if an element is 0, set its entire row and column to 0's, and return the matr...

View more
Problem approach

Step 1 : I used the intuition that if any cell of the matrix has a zero we can record its row and column number. All the cells of this recorded row and column can be marked zero in the next iteration.
Step 2 : Then I applied this intuition to find the index of all the zeros present in the matrix and stored them in an array. Then converted all the required elements to zero accordingly.
Ste...

View more
Try solving now
2. Duplicate Characters
Easy
25m average time
70% success
0/40
Asked in companies
Tata Consultancy Services (TCS)Goldman SachsThales

You are given a string ‘S’ of length ‘N’. You have to return all the characters in the string that are duplicated and their frequency.

Example:-
View more
Problem approach

Step 1 : Firstly I approached by brute force. I ran 2 loops with variables i and j. Compared str[i] and str[j]. If they became equal at any point, returned false. The time complexity of this approach was O(n2) (i.e. n squared).
Step 2 : Then I optimized it using sorting. In this I sorted the string with respect to the ASCII values of the characters. The time complexity in this case came out ...

View more
Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 10 problems
Interviewed by Cvent
671 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Cvent
495 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Cvent
487 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 7 problems
Interviewed by Cvent
543 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
96450 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
45047 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
28186 views
6 comments
0 upvotes