With great success on Chess (Chess – #CodingOf208), I was now looking for a new project to work on. My friend Luyando Chikandula from Zambia got me engaged on making Quiz – Master! I got very much interested in the project. A lot of thanks to him! So here I am now with successfully completing…
Here is the solution for Program Time!! CamelCase : #include<stdio.h> #include<string.h> #include<stdlib.h> int main(void) { char* str = (char*)malloc(10240*sizeof(char)); scanf(“%s”,str); int words = 1; for(int i=0,n=strlen(str);i<n;i++) { if(str[i] >= ‘A’ && str[i] <= ‘Z’) { words++; } } printf(“%d\n”,words); return 0; } 2. Super Reduced String : #include<stdio.h> #include<stdlib.h> #include<string.h> int main(void) { char* a =…
It’s program time! So here are two problems from HackerRank on strings which I found interesting these are easy level difficulty…… Enjoy!! CamelCase Super Reduced String The solution will be given after 3 days! My progress so far with the HackerRank has been reached to earning 1821.27 points with reaching 7766 rank! A lot of…
Here is the solution for last Program Time!! Caesar Cipher : #include<stdio.h> #include<ctype.h> #include<stdlib.h> int main(void) { int len; scanf(” %d”,&len); char* plain_text = (char*)malloc(len*sizeof(char) + 1); scanf(” %[^\n]s”, plain_text); int key; scanf(” %d”,&key); while(key > 26) { key = key – 26; } for(int i=0; i < len; i++) { if(isalpha(plain_text[i])) { if(isupper(plain_text[i])) {…
So its Valentine’s Day! If you have to send a secret love letter to your crush, such that no one else will be able to read, here is a program to help you with it! Caesar Cipher: Caesar Cipher is an encryption technique in which the input text is encrypted according to a simple rule.…
Last Under #CodingOf208, I made a simple hit and try game called “Battleship” (BattleShip – #CodingOf208), Battleship helped me a lot to learn about random numbers, file handling. But after after making it, I was kind of out of ideas on what to make next, so I turned over to HackerRank and earned Level – 4…
In the last post, we discussed about Arrays, which are an ordered block of memory of same data type. So when we talk about strings, strings are an array of characters which are terminated by NULL characters {‘\0’}. Strings can be declared in two ways : Using Arrays : char str[] = “Hello!”; or…
Here Is the solution for the last Program Time!! /** * Last Non-Zero Digit Of Factorial * Program Time!! * * By – Jatin Kumar Mandav * Mandav’s Blog * * Input : Any Integer * Output : Last Non-Zero Digit Of Factorial * */ #include<stdio.h> #include<stdbool.h> unsigned long long int fact(unsigned long long int); int…
Its time for some programming!!!!! I met this friend for Bangladesh on Facebook and he told me about a simple problem, I don’t know what is so charming about the question but I liked it (maybe its simplicity)!! So here is the first problem : Write a Program to find the last non-zero number of…
So here is the solution for : /** * *Program Time!! *Library Fine * * Mandav’s Blog * By- Jatin Kumar Mandav * */ #include<stdio.h> #include<stdlib.h> int main(void) { int d1,m1,y1; scanf(“%d %d %d”,&d1,&m1,&y1); int d2,m2,y2; scanf(“%d %d %d”,&d2,&m2,&y2); unsigned long long int fine = 0; if(d1 <= d2 && m1 <= m2 && y1…
Mandav's Blog 