..:: Trie on Data Structure and Algorithms related Questions and Answers

Trie on Data Structure and Algorithms related Questions and Answers

Question : What is a time complexity for finding the longest prefix that is common between suffix in a string?
1. Ɵ (n)
2. Ɵ (n!)
3. Ɵ (1)
4. O (log n!)
Answer : 3 - Ɵ (1)

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Trie on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Trie on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe