Skip to content

Instantly share code, notes, and snippets.

View jitsceait's full-sized avatar

Sangar Jitendra jitsceait

13 followers · 0 following
View GitHub Profile
@jitsceait
jitsceait / palindrome_list_rec.c
Created December 4, 2015 01:38
#include<stdio.h>
#include<stdlib.h>
#define true 1
#define false 0
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
@jitsceait
jitsceait / findNthNodeIter.c
Last active December 1, 2015 05:08
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * createNode(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / recursiveNthNode.c
Created November 29, 2015 13:31
int findNthNode(Node *head, Node **nthNode, int n){
if(!head) return 1;
int count = findNthNode(head->next, nthNode, n);
//If we have unstack n calls from stack
if(count == n){
*nthNode = head;
return ++count;
}
return ++count;
}
@jitsceait
jitsceait / find_middle_3.c
Last active November 29, 2015 12:43
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * createNode(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / find_middle_2.c
Created November 29, 2015 12:34
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * createNode(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / find_middle_1.c
Created November 29, 2015 12:33
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * createNode(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / DeleteNode.c
Last active November 29, 2015 04:10
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *next;
} Node;
Node * createNode(int val){
Node *temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / reverse_linked_list_rec.c
Last active November 27, 2015 03:50
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * create_node(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / reverse_linked_list_iter.c
Last active November 27, 2015 03:56
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * create_node(int val){
Node * temp = (Node *)malloc(sizeof(Node));
@jitsceait
jitsceait / output.txt
Created November 26, 2015 04:00
Linked list passed :7->6->5->4->3->Null ===========|
Linked list passed :6->5->4->3->Null =========| |
Linked list passed :5->4->3->Null =======| | |
Linked list passed :4->3->Null ======| | | |
Linked list passed :3->Null ====| | | | |
Linked list passed :Null ===| | | | | |
Length returned : 0 <===| | | | | |
Length returned : 1 <======= | | | | |
Length returned : 2 <=============| | | |
Length returned : 3 <=================| | |