Problems
Contest
Discuss
Interview
Online Interview
Assessment
Store
Redeem
Premium
For you
For you
Create
Most Votes
All Time
Newest
No search result
Create
What is Big O of this Algorithm?
Shashank M
78
BIGO
Algorithm
Interview
void fun(int n){
for(i=1 to i^2 <= n){
i++;
print(“coding ninjas”);
}
}
0
0
Comments (0)
Sort by:
Best
Comment
Explore
Download App
Support
Terms
Privacy Policy
More
Copyright © 2026 LeetCode
United States