- XOR of all subarray XORs
Explanation :- Bitwise XOR of all sub-arrays of an integer array in O(n) - Iterative function to check if two trees are identical
- Count all distinct pairs with difference equal to k
- Given two unsorted arrays, find all pairs whose sum is x
- Union and Intersection of two Linked Lists
- Trapping Rain Water
Explanation :- Trapping Rain Water between Towers - Tree Isomorphism Problem
- Largest subarray with equal number of 0s and 1s
- Dynamic Programming | 0-1 Knapsack Problem
Explanation :- Solving 0/1 Knapsack problem using Dynamic Programming - Submatrix Sum Queries
- Maximum difference between two elements such that larger element appears after the smaller number
- Stock Buy Sell to Maximize Profit
- Sorted insert for circular linked list
- Sorted Array to Balanced BST
- Find the element that appears once
- Converting Decimal Number lying between 1 to 3999 to Roman Numerals
- Converting Roman Numerals to Decimal lying between 1 to 3999
- Program to generate all possible valid IP addresses from given string
- Find if there is a rectangle in binary matrix with corners as 1
- Insertion Sort for Singly Linked List
- Simplify the directory path (Unix like)
- Find the Rotation Count in Rotated Sorted array
- Find the nearest smaller numbers on left side in an array
- Candy Distribution
- Shuffle a given array using Fisher–Yates shuffle Algorithm
Sharing is Caring !
Subscribe
0 Comments
Most Voted