Category: ACM

Youtube Video: Analaysis though it seems little bit tough to me: HackerRank video: MIT video: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-4-quicksort-randomized-algorithms/ Pseudo Code…

code i have understand for last 6 hours: problem statement was little bit clumsy but understood atlast:…

My code: didn’t passed all testcase: #include<bits/stdc++.h> using namespace std; int main() { int n,k; int a[100];…

I am implementing the solution after seeing the code: #include<iostream> #include<bits/stdc++.h> using namespace std; int main() {…

code: #include<bits/stdc++.h> using namespace std; int main() { char x[1000]; int k; scanf(“%s %d”,x,&k); for(int i=0; i<k;…

code: import java.math.BigInteger; import java.util.Scanner; /** * Created by Zaki on 6/11/2017. */ public class Uva_Fibonacci {…