Here we go

```#include
#include
#include
struct Node
{
char * value;
struct Node *next;
};
struct Node *last = NULL;
char* substr(char*str, int start, int length)
{
const char* from = str;
char *to = (char*) malloc(sizeof(str)/sizeof(char));
strncpy(to, from+start, length);
}

{
struct Node *curr_node = malloc(sizeof(struct Node));
char * newtemp = malloc(strlen(value));
strncpy(newtemp, value, strlen(value));
curr_node->value = newtemp;
curr_node->next = NULL;
{
}
else
{
last->next = curr_node;
last = curr_node;
}

}

{
struct Node * curr_node = head;
while (curr_node !=NULL)
{
printf("%sn", curr_node->value);
curr_node = curr_node->next;
}
}
void main()
{
int delimiter_size = 3, i=0, j=0;
char* delimit = "abc";
char* text = "someabccodingabctoabcparseab";
int length = strlen(text);
char* temp = (char*)malloc(length);
while(i < length)
{
if (text[i] == delimit[0]) //check if the begin
{
//check if the
if (strcmp(substr(text, i, delimiter_size), delimit) == 0)
{
i+=delimiter_size;
j=0;
memset(temp, '', strlen(temp));
continue;
}
}
temp[j] = text[i];
i++;
j++;
}
if (strlen(temp))
{
}
}
```

### See how you would solve these known algorithm problems

String Ordered Permutation Algorithm Problem

Get maximum occurring character

Changing decimal number to its binary equivalent

testing k complementary pairs algorithm with junit

Kadane’s algorithm in C – Dynamic Programming

Find the first occurence of number in the sorted array

Check if there are three numbers a, b, c giving a total T from array A

binary tree problems with solution

Check if two strings are anagrams or not

Finding missing numbers from billion sequential number list file