prabuinet

Quick sort have worst-case complexity of O(N^2). The Array Size for the third testcase is 10^5. 
So, it's producing an O(10^10) Complexity. In 1 second only 10^8 instructions can pass. Hence, it's giving a TLE.
Use the inbuilt Sort function in C++/Java/Python. It's optimised enough for most problems.

by Shantanu Sinha - hackerearth/codemonk/binarysearch comments

prabuinet

Lecture 1: Introduction to Research — [📝Lecture Notebooks] [▶️Video]
Lecture 2: Introduction to Python — [📝Lecture Notebooks] [▶️Video]
Lecture 3: Introduction to NumPy — [📝Lecture Notebooks] [▶️Video]
Lecture 4: Introduction to pandas — [📝Lecture Notebooks] [▶️Video]
Lecture 5: Plotting Data — [📝Lecture Notebooks] [[▶️Vide

prabuinet

{
	// Place your snippets for cpp here. Each snippet is defined under a snippet name and has a prefix, body and
	// description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
	// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. Placeholders with the
	// same ids are connected.
	// Example:
	"main function with iostream": {
		"prefix": "main2",
		"body": [
			"#include <iostream>",

prabuinet

        public Result<string> GetOrderMargin()
        {
            string jsonString = $$"""
            {
                "uid":"{{loggedInUser.UserId}}",
                "actid":"{{loggedInUser.UserId}}",
                "exch":"NSE",
                "tsym":"ASHOKLEY-EQ",
                "qty":"1",
                "prc":"0.0",