Cvent Software Developer Interview Questions and Answers

Reschedule at most K presentations to maximize longest gap without overlap.

• Iterate through presentations and calculate the gap between each pair of presentations

• Sort the presentations by their start times and keep track of the longest gap

• Reschedule at most K presentations to maximize the longest gap without overlap

The Lowest Common Ancestor (LCA) problem involves finding the lowest node in a tree that is an ancestor of two given nodes.

• LCA is the lowest node in a tree that is an ancestor of both given nodes.

• The tree is rooted at node 1 for each test case.

• Paths from each node to the root are considered to find the LCA.

• Constraints include the number of test cases, nodes, queries, and node values.

• Time limit for the solution is 1 second.

The problem involves finding the number of distinct ways to climb to the N-th stair by taking either one or two steps at a time.

• Use dynamic programming to solve this problem efficiently.

• Define a recursive function to calculate the number of ways to reach each stair.

• Consider base cases for 0 and 1 stairs.

• Use memoization to store and reuse intermediate results to avoid redundant calculations.

• Return the result modulo 10^9+7 to handle large outputs.

Remove duplicate occurrences of characters in a given string.

• Use a hash set to keep track of characters seen so far.

• Iterate through the string and add non-duplicate characters to a new string.

• Return the new string as the result.

To cut a circular cake into 8 pieces using 3 cuts, make two perpendicular cuts through the center of the cake and then make a horizontal cut through the center.

• Make a vertical cut through the center of the cake, dividing it into two equal halves.

• Make a horizontal cut through the center of the cake, dividing it into four equal quarters.

• Make a vertical cut perpendicular to the first cut, dividing the cake into 8 equal pieces.