Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Aishgadol's user avatar
Aishgadol's user avatar
Aishgadol's user avatar
Aishgadol
  • Member for 2 years, 1 month
  • Last seen more than a month ago
3 votes
2 answers
787 views

Count number of non-contiguous occurrences in string

2 votes
1 answer
111 views

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

2 votes
1 answer
701 views

Deciding if a graph is "Single Connected"

2 votes
1 answer
56 views

For a regular bipartite graph with vertices $X\cup Y$, prove that $|S|\leq|n(S)|$ $\forall S\subseteq X$

2 votes
1 answer
234 views

Min-cut with maximal number of edges

2 votes
0 answers
120 views

Proving a maximal bottleneck for all pairs of vertices in maximal spanning tree

1 vote
3 answers
2k views

Decide whether a flow graph has a single min-cut

1 vote
1 answer
284 views

Finding existence(or non existence) of spanning tree with a specific degree on a specific vertex

1 vote
3 answers
188 views

Algorithm to find Minimal Spanning Subgraph

1 vote
1 answer
376 views

Checking if there exists a 'source' vertex

1 vote
2 answers
160 views

A graph is strongly connected iff every non-trivial cut contains an edge

1 vote
4 answers
609 views

Stable sort an array with k distinct elements, each appearing double the times the previous one appears

1 vote
1 answer
135 views

Finding a family of graphs that displays a certain characteristic

1 vote
1 answer
787 views

Minimal number of positive intervals to cover all positive elements

1 vote
1 answer
230 views

Single machine scheduling with profit and deadline constraints

1 vote
2 answers
166 views

Prove a language created by applying a function on a regular language is regular

1 vote
1 answer
49 views

Reduction from $ALL$ to $DECIDE$

0 votes
0 answers
18 views

General rules to tell if a language is regular/CFL/decidable/recognizable

0 votes
1 answer
73 views

Deciding if a language is CFL or in $P$

0 votes
0 answers
35 views

Proving existence of NFA with specific amount of vertices

0 votes
1 answer
59 views

Determining the language of a DFA

0 votes
1 answer
57 views

Maximal Profit of 'legal' cutting of a board

0 votes
0 answers
68 views

Finding the diameter of a N-ary tree graph, without using BFS

0 votes
2 answers
395 views

Finding minimal amount of coins to reach n

0 votes
2 answers
207 views

Proving $L=\{wvw|v\in \{0,1\}^*, w\in \{0,1\}^+\}$ is not regular using the myhill-nerode and pumping lemma [duplicate]

-1 votes
1 answer
92 views

Modified Quickselect - Proving linear time

-1 votes
2 answers
61 views

Context free grammar for $L=\{a^nb^m : 2m<n<4m\}$

-1 votes
2 answers
101 views

Is $L=\{a^nb^m : n\neq 7m, \ n,m\in \mathbb{N}\}$ context free?

-2 votes
1 answer
33 views

Is this considered a vertex cover?