#include <stdio.h>
#include <stdlib.h>
 
#define SIZE 10
struct node {
   int data;
   struct node *next;
};
 
// Initialize the hash table
void initialize(struct node **table) {
   int i;
   for (i = 0; i < SIZE; i++) {
       table[i] = NULL;
   }
}
 
// Hash function
int hash(int key) {
   return key % SIZE;
}
 
// Insert a key into the hash table
void insert(struct node **table, int key) {
   int index = hash(key);
   struct node *new_node = (struct node *)malloc(sizeof(struct node));
   new_node->data = key;
   new_node->next = NULL;
 
   if (table[index] == NULL) {
       table[index] = new_node;
   } else {
       // Collision handling using separate chaining
       struct node *temp = table[index];
       while (temp->next != NULL) {
           temp = temp->next;
       }
       temp->next = new_node;
   }
}
 
// Display the hash table
void display(struct node **table) {
   int i;
   for (i = 0; i < SIZE; i++) {
       printf("[%d] -> ", i);
       struct node *temp = table[i];
       while (temp != NULL) {
           printf("%d -> ", temp->data);
           temp = temp->next;
       }
       printf("NULL\n");
   }
}
 
int main() {
   struct node *hash_table[SIZE];
   initialize(hash_table);
 
   insert(hash_table, 5);
   insert(hash_table, 15);
   insert(hash_table, 25);
   insert(hash_table, 35);
   insert(hash_table, 6);
   insert(hash_table, 16);
   insert(hash_table, 26);
   insert(hash_table, 36);
 
   display(hash_table);
   return 0;
}