No code (Question:324264.0)

Online Courses

Offline Courses

Test Series

Resources

Join Us

+91 7676564400

support@toprankers.com

Mobile App

Mock Tests

Practice

Assignment

Study Notes

SSC Articles

Discussions

Online Coaching

GK- Current Affairs

Bookmarked Questions

Descriptive Papers

Discussions

Select Date

Tags:

Submit Discussion

Deepak

· started a discussion

· 1 Months ago

No code (Question:324264.0)

Code is not here

Deepak

· started a discussion

· 1 Months ago

No code (Question:324264.0)

Code is not here

Question:

What is the time complexity of the above code?

Options:

O(logn)

O(n)

O(1)

O(nlogn)

Solution:

Ans: (b)

All the characters in the string have to be processed, hence the complexity is O(n).

We at aim to provide most comprehensive content & test for practice which is carefully divided into various chapters and topics to help you focus on your weak areas.Our Practice mock test gives you unmatched analytics to help you realize your strong areas,time management and improvement areas.Our Short & Crisp notes on each topic will help you to quickly revise the topic along with the tips & tricks of the exams.

More About