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

Software Engineer

ConsultAdd Inc

1 rounds | 1 Coding problems

divyanshu khandelwal

Experienced | Mar 2025

Rejected

Interview preparation journey

Journey

I applied through the Coding Ninjas Virtual Hiring Drive in March. To prepare, I strengthened my DSA skills using the Coding Ninjas DSA course and studied core subjects like DBMS and Operating Systems through Love Babbar’s notes.

Preparation

Topics: DSA, OS, DBMS

Application process

Where: Coding Ninjas Placement Cell

Eligibility: B.Tech CS/IT (Grad Year-2025 & 2024)

Interview rounds

Round

Medium

Online Coding Interview

Duration

Interview date7 Mar 2025

Coding problem1

1. Longest Wiggle Subsequence

Given an integer array nums, return the length of the longest wiggle subsequence. A wiggle sequence is defined as a sequence where the differences between consecutive numbers strictly alternate between positive and negative. Implement an efficient algorithm to determine this length.

Problem approach

int wiggleMaxLength(vector<int>& nums) {
int n = nums.size();
if (n == 0) return 0;

int up = 1, down = 1;

for (int i = 1; i < n; i++) {
if (nums[i] > nums[i - 1]) {
up = down + 1;
} else if (nums[i] < nums[i - 1]) {
down = up + 1;
}
}

return max(up, down);
}