added more coding problem

Author: sunilmaurya

.DS_Store

@@ -0,0 +1 @@
+{"name":"Local: 3","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/3.c","tests":[{"id":1657730988351,"input":"4\n4\n1 3 2 4\n3\n3 2 1\n2\n2 1\n3\n2 1 3\n","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/3.c","group":"local","local":true}

codechef-solution/.cph/.3.c_67e6f3b48b0c3202f33947253a74f702.prob

@@ -0,0 +1 @@
+{"name":"Local: zigzagTraversal","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/zigzagTraversal.cpp","tests":[{"id":1659191998775,"input":"2\n3 3 1\n1 2 3\n4 5 6\n7 8 9\n3 3 2\n1 2 3 \n4 5 6\n7 8 9","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/zigzagTraversal.cpp","group":"local","local":true}

codechef-solution/.cph/.zigzagTraversal.cpp_1920726a23e486e737473c1083cf9a02.prob

@@ -0,0 +1,52 @@
+#include<stdio.h>
+int test(){
+ int n1,n2;
+ while(n1!=n2)
+ {
+ if(n1 > n2)
+ n1 -= n2;
+ else
+ n2 -= n1;
+ }
+ return 20;
+}
+int main()
+{
+ test();
+ int t;
+ scanf("%d",&t);
+ for(int xx=0;xx<t;xx++){
+ int n;
+ scanf("%d",&n);
+ int a[n];
+ int k=0;
+ while(k<n){
+ scanf("%d",&a[k]);
+ k=k+1;
+ }
+ int count=0;
+ k=0;
+ while(k<n){
+ if(a[k]==1){
+ count = k;
+ break;
+ }
+ k++;
+ }
+ k=count;
+ while(k>0){
+ a[k] = a[k-1];
+ k=k-1;
+ }
+ a[0]=1;
+ k=0;
+ while(k<n){
+ if(a[k]==n){
+ count = count+ (n-1-k);
+ }
+ k++;
+ }
+ printf("%d\n",count);
+ }
+return 0;
+}

codechef-solution/3.bin

@@ -0,0 +1 @@
+{"name":"Local: 2journeyKnight","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/2journeyKnight.cpp","tests":[{"id":1657302035881,"input":"3\n1 1 1 1\n8 8 7 6\n8 8 8 6\n","output":"YES\nNO\nYES\n"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/2journeyKnight.cpp","group":"local","local":true}

codechef-solution/3.c

@@ -0,0 +1 @@
+{"name":"Local: 3gameofPill","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/3gameofPill.cpp","tests":[{"id":1657302819147,"input":"3\n2\n2 2\n1\n10\n3\n1 5 6","output":"CHEFINA\nCHEFINA\nCHEF"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/3gameofPill.cpp","group":"local","local":true}

codechef-solution/july 2022/.cph/.2journeyKnight.cpp_96e4325270b1175ece04bad342151ccc.prob

@@ -0,0 +1 @@
+{"name":"Local: 4Largest Square in the garden","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/4Largest Square in the garden.cpp","tests":[{"id":1657366466839,"input":"3\n1 1\n0 2\n1 2\n","output":"2"},{"id":1657366472802,"input":"8\n2 4\n2 4\n1 4\n0 7\n0 3\n1 2\n1 2\n1 1","output":"3"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/4Largest Square in the garden.cpp","group":"local","local":true}

codechef-solution/july 2022/.cph/.3gameofPill.cpp_2ebf28df4e509978c03f0faa7e890fa8.prob

@@ -0,0 +1 @@
+{"name":"Local: 5xor","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/5xor.cpp","tests":[{"id":1657456690852,"input":"3\n2\n0 3 6\n2\n4 7 2\n5\n9 6 11 8 13 10\n","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/5xor.cpp","group":"local","local":true}

codechef-solution/july 2022/.cph/.4Largest Square in the garden.cpp_ea20b1907264cf8930bb4773d4e423c4.prob

@@ -0,0 +1 @@
+{"name":"Local: slowsolution","url":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/slowsolution.cpp","tests":[{"id":1657300377886,"input":"4\n10 100 200\n3 10 100\n1000 1000 2200\n100 100 100","output":"20000\n300\n2040000\n10000"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/sunilkumarmaurya/Desktop/solution-leedcode-codechef-codeforces-gfg-interviewbits-hackerEarth-HackerRank/codechef-solution/july 2022/slowsolution.cpp","group":"local","local":true}