Create 1498-number-of-subsequences-that-satisfy-the-given-sum-conditi… #2604
Conversation
…on.js Solved number-of-subsequences-that-satisfy-the-given-sum-condition in JS.
| } | ||
|
|
||
| // we are subtracting 1 from right because we would have gone over the subsequance by 1 // think about it. | ||
| total += (BigInt(2)**BigInt(right - 1 - left)); |
There was a problem hiding this comment.
BigInt will increase Time complexity
There was a problem hiding this comment.
I don't get how BigInt will increase the time complexity. I'm using BigInt because the value was overflowing. However, I realized that the time complexity should be n*log(n) because of the sorting. I updated that time complexity.
There was a problem hiding this comment.
Numbers is a primitive data type that operates in binary and Time O(1). BigInt is a string, that gets converted to Number at Time(N).
There was a problem hiding this comment.
Ok, so the Time complexity should be nlog(n) * (the time it takes to convert BigInt to a number which is O(n) if it's converted from the string). so it should be nlog(n)*k where k is equal to the time it takes to convert a BitInt to a Number right?
There was a problem hiding this comment.
Waiting for an update...
There was a problem hiding this comment.
@aakhtar3, Is the reasoning correct for this one? Waiting for an update.
Ok, so the Time complexity should be n_log(n) * (the time it takes to convert BigInt to a number which is O(n) if it's converted from the string). so it should be n_log(n)*k where k is equal to the time it takes to convert a BitInt to a Number right?
…on.js updating time complexity.
2 participants
Solved number-of-subsequences-that-satisfy-the-given-sum-condition in JS.
File(s) Added: 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js
Language(s) Used: JavaScript
Submission URL: https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/submissions/947074363/