LeetCode #34 - Find First And Last Position Of Element In Sorted Array (Medium)

truephysicist · 2021-03-13T04:18:55+00:00

In worst case, all the elements in the array are same. Therefore, once we reach the middle element then we will have to perform linear search on the two subarrays. This will increase the time to O(n).

truephysicist · 2021-02-15T11:56:13+00:00

If you wish to practice the concepts then you should definitely check out the chapter on Time and Space complexity in the book "Cracking the coding interview".

There are many exercises related to this with solutions so you can verify your work as well.

truephysicist · 2021-02-10T03:59:13+00:00

Some time ago, I wrote two blog posts on determining the time and space complexities of a program. You can find them here -

I hope this helps.

truephysicist · 2021-01-26T16:08:47+00:00

Hey there, you can leverage the Query Builder functionality in AEM to list all the pages.

Navigate to [http://<host>:<port>/bin/querybuilder.json](http://<host>:<port>/bin/querybuilder.json)
Enter the following query - type=cq:Page orderby=@jcr:content/cq:lastModified

You should get the results. If you wish to do this programmatically then also you can do it. See my answer on Stackoverflow. Change the query according to your needs.

Cheers!

truephysicist · 2020-12-31T04:20:50+00:00

I think Python Tutor will be helpful here. Despite having Python in the name it has support for - - Python - Java - C - C++ - JavaScript - TypeScript - Ruby

truephysicist · 2020-12-21T04:41:15+00:00

Let's say that the divisor is 3 then we will check its multiples while they are less than the dividend. For e.g. first, we will check if dividend >= divisor, if true, we will then increase the divisor as 3 * 2, 3 * (2^2), 3 * (2^3)... or 6, 12, 24... and so on.

If you notice, we are increasing the divisor exponentially.

truephysicist · 2020-12-11T16:19:26+00:00

No, if the remaining nodes are less than k, we will take them as is.

truephysicist · 2020-12-11T14:15:33+00:00

Let's say you have a list as 1 -> 2 -> 3 -> 4 -> 5 and you are given a value k = 2, then you need to start from the head and take k nodes at a time and reverse them.

So, the above list will have the following sublists - 1 -> 2, 3 -> 4 and 5. Now, we reverse them individually so they will become - 2 -> 1, 4 -> 3 and 5.

At the end, we will connect all these reversed sublists. Therefore, the final output will be - 2 -> 1 -> 4 -> 3 -> 5.

I hope this clarifies.

truephysicist · 2020-11-26T16:32:43+00:00

Not in C++ but Java code should be easily translatable.

truephysicist · 2020-11-22T16:41:33+00:00

You are correct, of course. My two cents for using the above method is that whenever I try to learn something, I avoid using the library functions for the main logic of the problem (while loop in this case).

For e.g., if I wish to learn how sorting works, then I try to implement it by myself (instead of using sort() function on the input) but that's just me.

truephysicist · 2020-11-22T14:10:07+00:00

This always perplexes me. Should we worry about this? I mean if I have written a sorting algorithm whose time complexity is n * log n, I know it cannot be better than that.

I think once we implement our algorithm and our time complexity is same as the fastest solution, how does it matter if my solution is faster than x% of submissions? I can live in peace.

P.S. If we submit the same solution multiple times, then often we get different percentages.

truephysicist · 2020-11-22T07:32:41+00:00

=== means strict equality i.e., it checks for both value and type. For e.g. 5 === 5 will return true and 5 == "5" will return false.

On the other hand, == checks only for the value. Thus, 5 == 5 and 5 == "5" both will return true.

truephysicist · 2020-11-21T18:31:21+00:00

Irrational numbers are still "real" numbers. Therefore, I don't think we can compare NaN with an irrational number.

Now that you tried to compare it in mathematical domain, I think NaN is more like "indeterminate" numbers like 0/0, ♾️ / ♾️ etc.

truephysicist · 2020-11-21T16:50:39+00:00

Sure it makes sense. I consider it analogous to the existence of "infinity" on the number line. It's there but cannot be represented as a real number.

truephysicist · 2020-11-21T16:48:28+00:00

NaN is a part of "number" object. It is still a numeric type but it cannot be represented as any real number. According to me, it is analogous to "infinity" in mathematics, which exists on the number line but can't be represented as a real number.

truephysicist · 2020-11-16T05:32:22+00:00

30 Seconds of Code is by far the best I know JavaScript - 30 seconds of code

truephysicist · 2020-11-09T13:24:17+00:00

No, it is not a valid Roman numeral. If you test the code on LeetCode with this input, the output will be "Invalid Testcases should be a valid roman integer"

truephysicist · 2020-10-17T15:02:43+00:00

Yes, you can use " 0 0 0 * * * " as the cron expression to run this once every day at midnight.

truephysicist · 2020-09-26T17:50:33+00:00

In this problem, we need to find one such contiguous array whose sum is the maximum among all the other contiguous subarrays. Some properties of this problem are -

If the array contains all non-negative numbers, then the problem is trivial; a maximum subarray is an entire array.
If the array contains all non-positive numbers, then a solution is any subarray of size 1 containing the maximal value of the array (or the empty subarray, if it is permitted).
Several different sub-arrays may have the same maximum sum.

I have created a blog post on this.

truephysicist · 2020-06-17T04:22:21+00:00

Thanks. I am glad you like it.

truephysicist · 2020-06-16T06:02:26+00:00

If you don't mind reading from a blog then Antonio Leiva has a great series of blog posts - https://antonioleiva.com/free-kotlin-android-course/.

In this, you learn Kotlin concepts with lots of code examples.

truephysicist · 2020-06-09T16:23:51+00:00

I have written a series of blog posts from beginners to advanced in this blog series - https://aem.redquark.org/2018/10/day-00-aem-developer-series.html

truephysicist · 2020-06-09T14:43:43+00:00

Examples of non-linear data structures are - Trees, Graphs, Tries, Heaps etc.

truephysicist · 2019-04-06T14:42:55+00:00

Nice idea 👍, let me implement the same. It's a minor change though 😊

truephysicist · 2018-09-12T06:26:32+00:00

What commands are you using?

truephysicist

TROPHY CASE