Merge two sorted linked lists into one
Write a function that takes two lists, each of which is sorted in increasing order, and merges the two into a single list in increasing order, and returns it.
Tag: Recursive
Construct a linked list by merging alternate nodes of two given lists
Given two linked lists, merge their nodes to make one list, taking nodes alternately between the two lists. If either list runs out, all the nodes should be taken from the other list.
Split a linked list into two lists where each list contains alternating elements from it
Given a linked list, split it into two lists containing alternating elements from the original list. The elements in the new lists may be in any order.
Delete a linked list in C/C++
Write a function that takes a linked list, deallocates all of its memory, and sets its head pointer to NULL (the empty list).
Clone a Linked List
Write a function that takes a singly linked list and returns a complete copy of that list.
Word Break Problem – Dynamic Programming
Given a string and a dictionary of words, determine if the string can be segmented into a space-separated sequence of one or more dictionary words.
Find optimal cost to construct a binary search tree
Find the optimal cost to construct a binary search tree where each key can repeat several times. We are given each key’s frequency in the same order as corresponding keys in the inorder traversal of a binary search tree.
Collect maximum points in a matrix by satisfying given constraints
Given an M × N matrix where each cell can have a value of 1, 0, or -1, where -1 denotes an unsafe cell, collect the maximum number of ones starting from the first cell and by visiting only safe cells (i.e., 0 or 1).
Count the number of times a pattern appears in a given string as a subsequence
Given a string, count the number of times a given pattern appears in it as a subsequence.
Longest Alternating Subsequence Problem
The longest alternating subsequence is a problem of finding a subsequence of a given sequence in which the elements are in alternating order and in which the sequence is as long as possible.
Coin Change Problem
Given an unlimited supply of coins of given denominations, find the total number of distinct ways to get the desired change.
Coin change-making problem
Coin change-making problem: Given an unlimited supply of coins of given denominations, find the minimum number of coins required to get the desired change.