Vaishnavi Laldinani

Hi, I am from Kandoor, UP, and 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 am serving my notice period and looking for opportunities. That's it from my side.

So the current function has a worst case time complexity of O(n into m) because it uses nested loops to compare each element of array one with array two, O(n) for one array and also calls dot includes inside the loop O(n). It can be improved to O(n+m) plus m by storing array two in a set of constant time lookups and using another set to track duplicates which removes the need for a nested loop and repeated dot includes checks. That's how we can improve this code.

So this function, basically, it's using two four loops and one if block. So this function is the time complexity of O(n square) because it uses nested loops to check 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 the target current number exists in the set, allowing constant time lookups instead of comparing every pair.

So as per my understanding, I have read this code. To fully test which service to use function, you need to clear all the season branches by starting with testing when its server service one is down remains true. In this case, the function should always return service two regardless of other inputs. Okay? So next 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 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 the later checks for split load only apply when premium is true. Verify that it returns service one when it returns true and its premium is also true, 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 bugs definitely. And the function has bugs, uses a global variable called ground, causes wrong results across multiple calls, increments by b instead of one, poor variable names such as a and b, and a 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 bare. That's it.

So to determine if two line segments overlap, okay. Then when endpoints are inclusive, take the later of the two start points and the 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 the max of s one, s two is less than or equal to the min of e one, e two. So this works because the max of s one, s two represents a point where both segments have started and the max of e one, e two is the point where at least one segment ends. So if the start is before or exactly at the end, there is an intersection. Otherwise, there are they are separate. That's it.

So to check the query plans with EXPLAIN, then in Target add targeted indexes. Okay. Customer ID is one for the first query. Status is one, total amount is one for the second. Customer ID is one, status is one, and total amount is one for the third to support both filtering and sorting. Also return only the needed fields and monitor index usage regularly. That's it.

The component has several issues. Its useEffect is missing a dependency array, the fetch URL is empty, the way to increment is wrong and it's done twice, there's redundant code and it's done twice, decrement also should use functional updates, and there's no error handling in the fetch data sending format. In short, we need to add a dependency error to useEffect, fix state stale state updates by using the functional form of set count, provide a valid URL, and improve the search request with headers and error handling.