cody - HTMLify profile
files of /cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/
ALL PATTERNS.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/ALL PATTERNS.cpp
pattern 1:
* * * * *
* * * * *
* * * * *
* * * * *
* * * * *
void printpatt1(int n) {
* * * * *
* * * * *
* * * * *
* * * * *
* * * * *
void printpatt1(int n) {
Array
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Array/
Binary Search
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/
Linked list
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Linked list/
STEP 1.3 Know the Basic Of Math
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/STEP 1.3 Know the Basic Of Math
Step 1.5 : Learn Basic Recursion.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Step 1.5 : Learn Basic Recursion.cpp
// que 1 :Print GFG n times without the loop. (gfg)
class Solution {
public:
int i = 1;
void printGfg(int N) {
class Solution {
public:
int i = 1;
void printGfg(int N) {
Strings
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Strings/
hash.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/hash.cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for(int i =0; i<n; i++){
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for(int i =0; i<n; i++){