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

Software Engineer

Cvent
upvote
share-icon
4 rounds | 12 Coding problems

Interview preparation journey

expand-icon
Journey
It all started in my second year of college when I studied data structures and algorithms. I always knew that it was required for interviews. I found this subject very challenging, but I kept practicing. I started by studying data structures first and their implementations, repeating this process multiple times. Once I gained confidence, I began studying algorithms and their implementations. At that point, I did not start practicing on coding platforms. Once I covered major algorithms, I started practicing. Since then, I have religiously kept practicing until the day of my interview, and what do you know, I found the interview very easy. That's all about my journey. Thank you.
Application story
I was given this opportunity through my college and It was pool placement i.e. multiple colleges were participating in that.
Why selected/rejected for the role?
I was selected because my DSA skills were top notch and my computer science fundamentals were up to the mark.
Preparation
Duration: 12 Months
Topics: Linked List, Arrays, Tree, Graphs, Binary Search Patterns, Union - find, Trie.
Tip
Tip

Tip 1: Start with data structures first.
Tip 2: Once data structures are covered, then cover some common patterns of algorithms of all data structures.
Tip 3: Practice Leetcode in cycles and keep track of all your mistakes.

Application process
Where: Campus
Eligibility: GPA - 7 or above, Degree: B.TECH
Resume Tip
Resume tip

Tip 1:Keep all your projects with links.
Tip 2:Mention all the achievements and extra activities.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration30 mins
Interview date22 Jan 2024
Coding problem3

Easy computer science questions and aptitude questions.

1. DBMS

Which join refers to join records from the write table that have no matching key in the left table and are included in the result set? (Link)

2. Operating System

For an effective operating system, when to check for deadlock?

3. Probability of non-divisibility by 7 among 2-Digit Integers

Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be selected at random. What is the probability that the selected number is not divisible by 7? (Link)

02
Round
Medium
Online Coding Test
Duration30 mins
Interview date22 Jan 2024
Coding problem1

One coding question was posted on the online platform.

1. Minimum Jumps to Reach End of Array

Moderate
15m average time
85% success
0/80
Asked in companies
GoogleFlipkartDeutsche Bank

Given an array arr[] where each element represents the maximum number of steps that can be made forward from that index. The task is to find the minimum number of jumps to reach the end of the array starting from index 0.

Problem approach

Create memo[] such that memo[i] indicates the minimum number of jumps needed to reach memo[n-1] from memo[i] to store previously solved subproblems.
During the recursion call, if the same state is called more than once, then we can directly return the answer stored for that state instead of calculating again.
Otherwise, In each recursive call get all the reachable nodes from that index.
For each of the indexes call the recursive function.
Find the minimum number of jumps to reach the end from the current index.

Try solving now
03
Round
Medium
Face to Face
Duration60 mins
Interview date25 Jan 2024
Coding problem4

The interview was held in the afternoon. The environment was calm and the Interviewer was very supportive.

1. 3sum

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

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Problem approach

1. Sorted the array.
2. Used hash table with a pointer pattern to solve the problem in O(n2) time.

Try solving now

2. Features of OOPs

What are the main features of OOPs?

Problem approach

Encapsulation
Data Abstraction
Polymorphism
Inheritance

3. Polymorphism

What is Polymorphism and Explain its types

4. Normalization

What is Normalization?

Problem approach

Normalization is the process of organizing the data in the database.

04
Round
Hard
Face to Face
Duration60 mins
Interview date26 Jan 2024
Coding problem4

Discussion around Computer Science problems.

1. ACID Properties

What acid properties and how Integrity is implemented? (Link)

2. Semaphores in OS

What are semaphores and how are they used in os?

3. Computer Networks

How do packets travel on the internet? (Link)

4. URL

How is the URL resolved? (Link)

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
Software Engineer
1 rounds | 3 problems
Interviewed by Cvent
2105 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Cvent
0 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 6 problems
Interviewed by Cvent
756 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Cvent
704 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11082 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7001 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
8503 views
1 comments
0 upvotes