Kth smallest element in a row-wise and column-wise sorted 2D array

Kth smallest element in a row-wise and column-wise sorted 2D array Kth-smallest-element #include<iostream> #include<stdio.h> #include<climits> using namespace std; typedef struct HeapNode {     int value;     int row;     int...

Compare two strings represented as linked lists

Compare two strings represented as linked lists Compare Strings #include<iostream> #include<stdio.h> using namespace std; typedef struct Node {     char data;     struct Node *next; }node; node *CreateList(node* head, char d); void display(node...

Find merge point of two linked list

Find merge point of two linked list Find merge point of two linked list #include<iostream> #include<stdio.h> using namespace std; typedef struct Node {     int data;     struct Node *next; }node; int find_count(node *head); int Get_insection_point(int...

Merge Two link List( 1: Normal Approach 2: Recursion Approach)

Merge Two link List( 1; Normal Approach 2: Recursion Approach) Merge-Link-list #include <stdio.h> #include<stdlib.h> using namespace std; // defining structure for the link list typedef struct node_list {     int data;     struct...