TCS NQT 2026 Coding Questions | Day 1: Sort Odd Ascending & Even Descending (In-Place)

Day 1 of our TCS NQT 2026 Series
Today, we tackle a high-frequency coding problem often seen in the TCS Digital and Prime hiring tracks: Sorting Odd numbers in Ascending order and Even numbers in Descending order (In-Place).

Problem Statement:
Given an array of integers, sort all odd numbers in ascending order and all even numbers in descending order. The relative positions of odd and even numbers must remain the same (In-place logic).

In this video, we don't just solve the problem; we break down the logic so you can apply it to ANY array-based question in the exam.
What you will learn today:
✅ How to identify "In-Place" constraints.
✅ Using Custom Comparators vs. Two-Pointer Logic.
✅ Time Complexity Analysis (O(n \log n) vs $O(n^2)).
✅ Dry run of the code with multiple test cases.

Видео TCS NQT 2026 Coding Questions | Day 1: Sort Odd Ascending & Even Descending (In-Place) канала Yellowmatics