Yesterday I was having an interview with a company and they wanted me to write a tree structure and do a traverse on the tree. At first I wrote the following code: 123456789101112131415161718192021222

Intuition binary search on one of the array to find the correct position. Approach Complexity Time complexity: \(O(\log n)\) Space complexity: Code 1234567891011121314151617181920212223242526272

Intuition Use the tendence of the middle element to check either the required index is in the left or right of the middle element. Approach Complexity Time complexity: \(O(\log n)\) Space complexi

Intuition Binary search on the array Approach If current index is less than arr[index], search for the left part, else search on the right part. If we find one, check if there are smaller ons by searc

NFA and DFA are equavelent. The lembda edge can be replaced by a shortcut.

I have tried several video downloading platform, this one works best so far: cobalt

Regular Expression I was wondering if the operation of regular expression (Union, Concatenation, Star) is complete. This question needs further prompt: In what sense do I mean complete? Am I asking: -

I was reading my Professor Richard Cole's note in the halting problem and I was confused on the statement for a while. Understanding the following two examples will help a lot in understanding the Hal

Equivalent Definitions of \(O(n)\) and Proof of Membership In this post, we’ll explore some equivalent definitions for the orthogonal group, \(O(n)\), and prove that any transformation preserving dist