Given two sorted arrays, X[] and Y[] of size m and n each, merge elements of X[] with elements of array Y[] by maintaining the sorted order, i.e., fill X[] with the first m smallest elements and fill Y[] with remaining elements.
#Data_structure

The idea is to traverse both trees and compare values at their root node. If the value matches, recursively check if the first tree’s left subtree is identical to the left subtree of the second tree and the right subtree of the first tree is identical to the right subtree of the second tree. If the value at their root node differs, the trees violate data property. If at any point in the recursion, the first tree is empty and the second tree is non-empty, or the second tree is empty and the first tree is non-empty, the trees violate structural property, and they cannot be identical.
#Data_structure
#Source_code

Insertion Sort Algorithm - Iterative & Recursive
#Source_code
#Data_structure

Check if a string is a rotated palindrome or not
A naive solution is to consider all rotations of the given string and check if any rotation is a palindrome or not. If we have found a rotation that is a palindrome, return true; otherwise, return false.
#Source_code
#Data_structure

Determine whether a string matches with a given pattern.
Given a string and a pattern, determine whether a string matches with a given pattern. The solution should not use any regex.
#Source_code
#Data_structure
#84

#Data_structure
#Output
#84
Example inputs for a given Data Structure:

Input:
string: codesleepcode
pattern: XYX

Output:
X: code
Y: sleep


Input:
string: codecodecode
pattern: XXX

Output:
X: code

Bit Hacks – Playing with the rightmost set bit of a number
#Source_code
#Data_structure
#91

Single linked list Example in Java
#Source_code
#Data_structure
#92

Singly Linked List Example in Java
Example 2
#Source_code
#Data_structure
#93