Kartik Sapra | CommonLounge

Follow

KS

Kartik Sapra

Tutorials

Discussions

Comments

Followers

Course Completions

Active In

Competitive Programming

2 replies. Member

Featured Contributions

NaN.

discussion

[LEADGAME] Lead Gameby Keshav Dhandhania

Problem statement clarification:

Now I get it, I was misinterpreting question all thi...

Read more…(49 words)

Category: Indian Computing Olympiad (ICO)

comment in this discussion

this is my solution to this question.I want to know more advantages of advanced while loop.please explain.thank you.According to my analysis time complexity is O(1).Any suggestion how to improve the code !

Read more… (32 words)

NaN.

quiz

Quiz: Analyzing code complexity, estimating runtime and memory usageby Keshav Dhandhania

The quiz consists of 5 sets of questions, each set consisting of 2-7 questions. Each question set starts off with a piece of code, and then you are asked several questions about the codes runtime and memory complexity. Enjoy!

Read more…(39 words)

Category: Competitive Programming

comment in this discussion

sir in iterative dynamic programming version of fibonnaci can you please explain how the time complexity will be O(1) if declare fibo array in global scope.

Read more… (26 words)

Load More