|
Maximum Circular Sum
|
3
|
November 18, 2019
|
|
Math day problem doubt
|
3
|
November 18, 2019
|
|
Not so easy maths
|
3
|
November 18, 2019
|
|
Game theory 3 wa doubt
|
3
|
November 18, 2019
|
|
I could not understand what is the problem with the code , inspite of applying the right logic
|
3
|
November 18, 2019
|
|
What is wrong in my code (MAX-QUERY 1)
|
3
|
November 18, 2019
|
|
Solved question correctly,but didn't got points for same
|
4
|
November 18, 2019
|
|
No Output Coming Generate Parentheses
|
4
|
November 18, 2019
|
|
Mail Id Moving across
|
3
|
November 18, 2019
|
|
Not Enough Information
|
3
|
November 18, 2019
|
|
Recursive case idea
|
8
|
November 18, 2019
|
|
Wrong arrangement
|
8
|
November 18, 2019
|
|
Previous Video query
|
3
|
November 18, 2019
|
|
Problem in api key
|
2
|
November 18, 2019
|
|
One test case gone wrong
|
2
|
November 17, 2019
|
|
Dequeue efficient queue using stack
|
2
|
November 17, 2019
|
|
Stock Span One Test-case gone wrong
|
2
|
November 17, 2019
|
|
Arrays-Insertion-sort
|
2
|
November 17, 2019
|
|
MCQ Pointers - Question 3
|
7
|
November 17, 2019
|
|
#include<bits/stdc++.h> using namespace std; #define ll long long int int main() { ll n,m,x,y; ll t; cin>>n>>m>>x>>y; t=m+y; ll s; if((t/x)>n) cout<<n; else cout<<t/x; return 0; }
|
3
|
November 17, 2019
|
|
Catalan Numbers
|
2
|
November 17, 2019
|
|
Minimum Money Needed
|
2
|
November 17, 2019
|
|
Dp minimum number of steps
|
2
|
November 17, 2019
|
|
Simple timer app using asncTask class
|
1
|
November 17, 2019
|
|
Doubt in pattern 21
|
3
|
November 17, 2019
|
|
Piyush and Magical Park
|
4
|
November 17, 2019
|
|
Cycle detection using dfs
|
2
|
November 17, 2019
|
|
Please tell me the problem in my logic
|
4
|
November 17, 2019
|
|
Deepak and Primes Problem
|
2
|
November 17, 2019
|
|
Pythagorean's Challenge
|
8
|
November 17, 2019
|