Network profile

Abhijit Sarkar

Reputation

253

253
252
251

May
Aug
Nov
Feb

Top tag

np-complete

Next privilege

300 Rep.

Create new tags

Badges

2

18

Newest

Popular Question

Next badge

3/5

Impact

3 posts edited

3 helpful flags

11 votes cast

5 Questions

Votes Activity Newest Views

2

votes

2

answers

1k

views

What is an efficient data structure for prefix matching?

data-structures search-algorithms strings substrings

Sep 26 '19 at 20:15 smls 163

1

vote

1

answer

1k

views

What Are the Ideas Behind Variations of the Coin Change Problem?

algorithms dynamic-programming coin-change

Jan 19 '19 at 11:22 Abhijit Sarkar 253

1

vote

3

answers

729

views

Which of the following problems can be reduced to the Hamiltonian path problem?

algorithms complexity-theory graphs np-complete hamiltonian-path

Jan 8 '19 at 22:19 ryan 4,166

0

votes

2

answers

2k

views

Which of the following statements are true for the given special cases of the Traveling Salesman Problem?

algorithms complexity-theory np-complete reductions traveling-salesman

Jan 16 '19 at 2:03 Abhijit Sarkar 253

-1

votes

1

answer

488

views

Find the Most Frequent Ordered Word Pair In a Document

algorithms strings information-retrieval

Feb 5 '19 at 8:36 Abhijit Sarkar 253

Computer Science Stack Exchange works best with JavaScript enabled