Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
185 changes: 185 additions & 0 deletions Hackerrank/Time-Conversion
Original file line number Diff line number Diff line change
@@ -0,0 +1,185 @@
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char* readline();
char* ltrim(char*);
char* rtrim(char*);
char** split_string(char*);

int parse_int(char*);

/*
* Complete the 'birthdayCakeCandles' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER_ARRAY candles as parameter.
*/

int birthdayCakeCandles(int candles_count, int* candles) {
int tall = 0, i;
int count=0;
for(i=0; i<candles_count; i++)
{
if(candles[i] > tall)
tall = candles[i];
}
for(i=0; i<candles_count; i++)
{
if(candles[i]==tall)
count++;
}
return count++;
}

int main()
{
FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");

int candles_count = parse_int(ltrim(rtrim(readline())));

char** candles_temp = split_string(rtrim(readline()));

int* candles = malloc(candles_count * sizeof(int));

for (int i = 0; i < candles_count; i++) {
int candles_item = parse_int(*(candles_temp + i));

*(candles + i) = candles_item;
}

int result = birthdayCakeCandles(candles_count, candles);

fprintf(fptr, "%d\n", result);

fclose(fptr);

return 0;
}

char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;

char* data = malloc(alloc_length);

while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);

if (!line) {
break;
}

data_length += strlen(cursor);

if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}

alloc_length <<= 1;

data = realloc(data, alloc_length);

if (!data) {
data = '\0';

break;
}
}

if (data[data_length - 1] == '\n') {
data[data_length - 1] = '\0';

data = realloc(data, data_length);

if (!data) {
data = '\0';
}
} else {
data = realloc(data, data_length + 1);

if (!data) {
data = '\0';
} else {
data[data_length] = '\0';
}
}

return data;
}

char* ltrim(char* str) {
if (!str) {
return '\0';
}

if (!*str) {
return str;
}

while (*str != '\0' && isspace(*str)) {
str++;
}

return str;
}

char* rtrim(char* str) {
if (!str) {
return '\0';
}

if (!*str) {
return str;
}

char* end = str + strlen(str) - 1;

while (end >= str && isspace(*end)) {
end--;
}

*(end + 1) = '\0';

return str;
}

char** split_string(char* str) {
char** splits = NULL;
char* token = strtok(str, " ");

int spaces = 0;

while (token) {
splits = realloc(splits, sizeof(char*) * ++spaces);

if (!splits) {
return splits;
}

splits[spaces - 1] = token;

token = strtok(NULL, " ");
}

return splits;
}

int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);

if (endptr == str || *endptr != '\0') {
exit(EXIT_FAILURE);
}

return value;
}
39 changes: 39 additions & 0 deletions Hackerrank/leftRotation
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
#include<stdio.h>
void rotate(int [], int, int);
void rot(int [], int);
void print(int [], int);
int main()
{
int a[1000000], i, n, d;
scanf("%d",&n);
scanf("%d",&d);
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
}
rotate(a, n, d);
print(a, n);
}
void rotate(int a[1000000], int n, int d)
{
int i;
for(i=0; i<d; i++)
rot(a,n);
}
void rot(int a[1000000], int n)
{
int temp=a[0], i;
for(i=0; i<n-1; i++)
{
a[i]=a[i+1];
}
a[i]=temp;
}
void print(int a[1000000], int n)
{
int i;
for(i=0; i<n; i++)
{
printf("%d ",a[i]);
}
}