Cvent Software Engineer Interview Questions, Process, and Tips

About technical skills regarding core subjects like java sql manual and selenium

Q1. Work place,salary, experience
Add your answer
Q2. About job location
Add your answer

Q1. About shifts and location
Add your answer
Q2. Abouts shiftss and locations
Add your answer

45 min simple technical oops java based and aptitude

30 min coding test 1 question on dp

Q1. Dsa question + resume
Add your answer

Q1. One dsa question
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA and Compiler Design.

Q1. 
Detect Cycle in Undirected Graph Problem Statement
You are provided with an undirected graph composed of 'N' vertices and 'M' edges, where vertices are labeled from 1 to 'N'.
Your task is to determine if...read more
Ans. 
DFS can be used to detect cycle in an undirected graph. Do a DFS traversal of the given graph. For every visited vertex ‘v’, if there is an adjacent ‘u’ such that u is already visited and u is not parent of v, then there is a cycle in graph.
If we don’t find such an adjacent for any vertex, we say that there is no cycle.
Pseudocode :
 
DetectCycle(graph, v, visited[], parent)
{
	// mark the current node as visited
...read more
Answered Anonymously
Add your answer
Q2. 
Implement Three Stacks Using a Single Array
You are given a sequence of queries for insertion and deletion operations on 3 separate stacks. Your task is to implement these three stacks using a single arra...read more
Ans. 
One method could be to divide the array in slots of size n/3. A simple way to implement 3 stacks is to divide the array in 3 slots of size n/3 each, and fix the slots for different stacks, i.e., use arr[0] to arr[n/3-1] for first stack, and arr[n/3] to arr[2n/3-1] for stack2 where arr[] is the array to be used to implement 3 stacks and size of array be n. The problem with this method is inefficient use of array space. ...read more
Answered Anonymously
Add your answer
Q3. What is the difference between compiled and interpreted languages?
Ans. 
1. A compiled language is a programming language whose implementations are typically compilers and not interpreters. An interpreted language is a programming language whose implementations execute instructions directly and freely, without previously compiling a program into machine-language instructions.

2. In compiled language, once the program is compiled it is expressed in the instructions of the target machine. Whil...read more
Answered Anonymously
Add your answer

Online coding

Q1. Face to face technical technical questions including coding
Add your answer

Basic questions quite easy

Q1. Face to face technical round
Add your answer
Q2. Face to face technical round with senior manager
Add your answer