
I am a Full Stack Engineer with over 3 years of experience in building scalable systems, APIs, and automation workflows. My core expertise lies in Python and Django, complemented by strong experience in React, Ruby on Rails, PostgreSQL, MongoDB, Redis, and Sidekiq. I have contributed across fintech and product-based environments, with a focus on system performance, reliability, and real-time communication solutions. One of my most impactful projects is the Content Hub, a centralized platform designed to manage and deliver communication templates across multiple channels. The system supports SMS, WhatsApp, OBD, Email, Push Notifications, and Flash messages, with a flexible architecture that makes integrating future channels seamless. I developed end-to-end flows for WhatsApp, SMS, Push, and Flash, and extended the system to configure event-driven delivery with dynamic delays, ensuring timely and personalized engagement. I have also optimized large-scale messaging workflows by reducing job execution complexity, improving processing speed, and enhancing multi-channel delivery. I am passionate about solving engineering challenges across the stack, designing efficient systems, and leveraging Python, React, and AI-driven automation to create impactful user experiences.
Software Engineer
YabxProduct Development Engineer
Comviva
Postman

PyCharm
Yeah. So hi. I am. I belong from Kandoor, UP, and, uh, I started my journey as a product development engineer in Conviva, and then I switched internally to YevX. So YevX is a fintech product based startup of Commviva. So there, I am working as a senior software engineer since December 24. Currently, I'm serving my notice period and looking for opportunities. Uh, that's it from my side.
So the current, uh, function has a worst case, uh, time. Complexity of, uh, I can yeah. O n into m into n because it uses nested loops to compare each element of array one with array two, uh, o n m and also calls dot includes inside the loop o n. It can be improved to o n m plus m by storing area two in a set of constant time lookups and using another set to track duplicates which removes the need of for nested loop and repeated dot includes checks. That's how we can improve this, uh, code. That's it. Thank you.
So this function, basically, it's it's using two four loops and one if block. So this function is the time complexity of o n square because it because it uses, uh, nested loops to check our every possible pair in the array. It can be improved to o n by using a set to store visited numbers and for each element checking if target current number exist in the set, allowing constant time lookups instead of comparing every pair. Thank you.
So as per my understanding, I have, uh, read this code. So to fully test which service to use function, you need to, uh, uh, you need to clear all the season branches starting by testing when its server service one down remains true. In this case, the function should always return service two regardless of other inputs. Okay? So next test when, uh, basically, next test test is when preferred service is provided both with service one and service two, ensuring the function returns the preferred service directly. Then you can, uh, cover scenarios where should split load returns true, if either is time consuming or is premium is true, it would return service one. Otherwise, it would return service two. Also test when should split load is false to ensure that false to the later checks for split load only for premium. Verify that it when it returns true and its premium is also true, the function return service one. But if its premium is false, it returns service two. Finally, test the default path where none of the above conditions trigger, confirming that service two is returned. This ensures that I have covered every logical path and combination of critical flags. Thank you.
So, yes, there are I can say, yes, there are bugs definitely. And, uh, the function has bugs, uses a global variable global ground, causes wrong results across multiple calls, increments by one, increments by b instead of one, poor variable names that is a and b, redundant empty array check. So you can fix this. Use a local count variable, increment by one for matches, use descriptive names, and prefer let counts over bear. That's it. Thank you.
So to to determine if two line segments overlap okay. Then when endpoints are inclusive, take the later of the two start, uh, points and earlier of the two endpoints if the later start is less than or equal to the earlier end, the segments overlap. Mathematically, for segments e s one, e one, and s two, e two, they overlap if max of s one comma s two is less than equal to min of a one comma a two. So this works because max s one s two represents a point where both segments have started and when even even even e two is the point where at least one segment ends. So if the start is before or exactly at the end, there is a intersection. Otherwise, there are they are separate. That's it.
So to check the query plans with explain, then in target add targeted in indexes. Okay. Customer ID, one for the first query. Status one, total amount one for the second, customer ID one, status one, and total amount one for the third to support both filtering and sorting, also return only needed fields and monitor index users usage regularly. That's it. Thank you.
So, basically, the component has several issues. Its useEffect missing dependency array, fetch URL is empty, wrong way to increment twice, redundant code and increment twice, decrement also should use functional updates, No error handling in fetch data sending format. In short, add a dependency error to useEffect. Fix state stale state updates by using the functional form of set count, provides a valid URL, and improve the search request with headers and error handling. Thank you.