Official engineering progress ledger of Ajit Dev. Real-time problem solving, time complexity optimization, and live logs across LeetCode, NeetCode, and GitHub.
Achieved 200+ active practice days in 2026
Maintained continuous daily coding streak
Resolved 518 LeetCode + 123 NeetCode problems
478 problems solved with optimized C++ STL
Global Rank #192,927 across 3 contests
123 NeetCode problems solved with 121d streak
Personal portfolio live website built with Next.js 16, TypeScript, and Tailwind CSS.
Structured Data Structures and Algorithms practice with clean, optimized solutions.
My NeetCode.io problem submissions, pointer algorithms, and tree guides.
TypeScript learning journey from beginner to advanced level with structured examples.
Python core data structures, OOP patterns, and recursion scripting algorithms.
Full-stack LAMP Web Application using Linux, Apache, MySQL, and PHP.
Active practice days logged: 242 Days
Filter algorithms by domain or search for specific data structures
// C++ Binary Search on Solution Bounds
int splitArray(vector<int>& nums, int k) {
int low = *max_element(nums.begin(), nums.end());
int high = accumulate(nums.begin(), nums.end(), 0);
int ans = high;
auto isValid = [&](int targetSum) {
int count = 1, currentSum = 0;
for (int num : nums) {
if (currentSum + num > targetSum) {
count++; currentSum = num;
} else currentSum += num;
}
return count <= k;
};
while (low <= high) {
int mid = low + (high - low) / 2;
if (isValid(mid)) { ans = mid; high = mid - 1; }
else low = mid + 1;
}
return ans;
}