Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Russel's user avatar
Russel's user avatar
Russel's user avatar
Russel
  • Member for 4 years, 1 month
  • Last seen this week
  • Philippines
24 votes

How can a Turing machine compare two strings without modifying them?

15 votes
Accepted

In a directed acyclic graph, what do you call the nodes with in-degree zero?

6 votes

False proofs that look correct

6 votes
Accepted

What does empty string ε actually mean?

5 votes

Efficient data structure for insertion, deletion and smallest-not-in-range query on an array of integers

4 votes

Is there a reason Depth-First Search and Breadth-First search commonly called "Search" instead of "Traversal?"

4 votes
Accepted

Finding Median value given a tuple (value, frequency) in O(n) worst case time complexity

4 votes

Linear-time algorithm for determining the presence of incomparable pairs in a directed acyclic graph (DAG)

4 votes

How do XFast and Y Fast Tries compare to B trees in performance?

4 votes
Accepted

Is pumping lemma not applicable for every 'long enough' string in the language?

3 votes
Accepted

Finding the Equation for Potential Method and Amortization Analysis

3 votes

Why does a lock ordering prevent deadlocks?

3 votes
Accepted

Topological sort of minimum costs to finish interdependent tasks

3 votes
Accepted

Retreive farthest value to the right of element

3 votes

How does a text file distinguish a letter and number in binary

3 votes
Accepted

Getting all vertices with fixed index in their topological ordering of a DAG

3 votes
Accepted

Why DFS transversal without the duplicates is a valid cycle?

2 votes
Accepted

Prove a greedy algorithm that obtains the minimum integer with at most k adjacent swaps is correct

2 votes
Accepted

Unique combinations of growing collection elements

2 votes

Turing machine accepting mirrored words

2 votes
Accepted

How to use the step count method correctly for binary search?

2 votes

Sorted degrees and maximal degree in dynamic graphs

2 votes

Remove number after duplicated number

2 votes
Accepted

Efficient data structure to maintain a set of postal codes and mailbox numbers

2 votes
Accepted

Why do hash tables have no access/indexing complexity but have $O(1)$ search complexity?

2 votes
Accepted

Turing Machine for the Language $L=\{(a^n)b(a^n)b(a^n) | n\geq0\}$

2 votes

"Guess the number" Problem on Turing machines

2 votes
Accepted

How to (Efficiently) Sort a List of Items with Parent/Child Relationship

2 votes
Accepted

Approximating the median of the complement of a set

2 votes

Maximum, delete and insert fastest data structure