Skip to content

Instantly share code, notes, and snippets.

View raiyansarker's full-sized avatar
💤
Hibernating

Raiyan Sarker raiyansarker

💤
Hibernating
18 followers · 6 following
View GitHub Profile
@raiyansarker
raiyansarker / exp-10.c
Created April 6, 2026 14:39
#include <stdio.h>
#define QUEUE_SIZE 100
#define STACK_SIZE 100
#define MAX_CONN 8
int queue[QUEUE_SIZE];
int front = -1, rear = -1;
int stack[STACK_SIZE];
@raiyansarker
raiyansarker / bfs.c
Created March 31, 2026 04:45
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
typedef struct Node {
int data;
struct Node *next;
} Node;
@raiyansarker
raiyansarker / search-bst.c
Created March 30, 2026 23:59
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *left, *right;
} Node;
Node* createNode(int data) {
Node* n = (Node*)calloc(1, sizeof(Node));
@raiyansarker
raiyansarker / eval.c
Created March 2, 2026 22:50
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <math.h>
#define MAX_SIZE 100
typedef struct Stack {
int arr[MAX_SIZE];
int top;
@raiyansarker
raiyansarker / stack-array.c
Created February 22, 2026 09:20
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct Stack {
int arr[MAX_SIZE];
int top;
} Stack;
@raiyansarker
raiyansarker / stack-linkedlist.c
Created February 22, 2026 09:10
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *next;
} Node;
void push(Node **head, int data);
int pop(Node **head);
@raiyansarker
raiyansarker / doubly-linkedlist-double-pointer-operations.c
Created February 22, 2026 07:18
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *next;
struct Node *prev;
} Node;
void insert_end(Node **head, int data);
@raiyansarker
raiyansarker / linkedlist-double-pointer-operations.c
Last active February 22, 2026 07:07
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *next;
} Node;
void insert_end(Node **head, int data);
void insert_begin(Node **head, int data);
@raiyansarker
raiyansarker / palindrome-linkedlist.c
Created February 10, 2026 04:27
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node *next;
} Node;
Node* init();
void insert_end(Node *head, int data);
@raiyansarker
raiyansarker / linked-list-dynamic-mem-initialization.c
Created January 26, 2026 18:12
#include <stdio.h>
#include <stdlib.h> // this is for calloc
typedef struct node {
int x,y;
struct node *next;
} Node;
int main() {
/*