- Find Index of 0 to be replaced with 1 to get longest continuous sequence of 1s in a binary array | Set-2
- Minimum Fibonacci terms with sum equal to K
- Largest subarray having sum greater than k
- Even size subtree in n-ary tree
- abs(), labs(), llabs() functions in C/C++
- Number of subarrays with given product
- Insert in sorted and non-overlapping interval array
- Minimum adjacent swaps required to Sort Binary array
- Schedule jobs so that each server gets equal load
- Equal sum array partition excluding a given element
- Number with even sum of digits
- Magical Indices in an array
- Print equal sum sets of array (Partition problem) | Set 1
- Maximum Product Subarray | Added negative product case
- Number of subarrays having sum exactly equal to k
- Split array in three equal sum subarrays
- Count substrings with each character occurring at most k times
- Log based Recovery in DBMS
- Minimize number of unique characters in string
- Longest Common Substring (Space optimized DP solution)
- XOR of a subarray (range of elements)
- Balanced expression with replacement
- fmax() and fmin() in C++
- Maximize array elements upto given number
- Find largest subtree sum in a tree
- Maximum equlibrium sum in an array
- Print equal sum sets of array (Partition Problem) | Set 2
- Find if given vertical level of binary tree is sorted or not
- Sum of cousins of a given node in a Binary Tree
- Count number of pairs in array having sum divisible by K | SET 2
- Print Longest substring without repeating characters
- Word Wrap problem ( Space optimized solution )
- Minimum splits in a binary string such that every substring is a power of 4 or 6.
- Check for balanced parenthesis without using stack
- Infix to Prefix conversion using two stacks
- Sort the biotonic doubly linked list | Set-2
- atol(), atoll() and atof() functions in C/C++
- std::stol() and std::stoll() functions in C++
- Find postorder traversal of BST from preorder traversal
- Find the smallest positive number missing from an unsorted array | Set 2
- Duplicates in an array in O(n) time and by using O(1) extra space | Set-3
- Inorder predecessor and successor for a given key in BST | Iterative Approach
- Check if a binary tree is sorted level-wise or not
- Check if two trees are mirror of each other using level order traversal
- Check if two nodes are cousins in a Binary Tree | Set-2
- Rearrange a Linked List in Zig-Zag fashion | Set-2
- Count number of triplets in an array having sum in the range [a, b]
- Number of n digit stepping numbers | Space optimized solution
- Check if concatenation of two strings is balanced or not
- Number of Counterclockwise shifts to make a string palindrome
- Find maximum vertical sum in binary tree
- Number of subarrays having sum in a given range
- Longest substring with count of 1s more than 0s
- Longest subarray having average greater than or equal to x
- Find k-th character of decrypted string | Set - 2
- Longest subsequence such that adjacent elements have at least one common digit
- Number of special nodes in an n-ary tree
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Number of ways to pair people
- Minimum length substring with exactly K distinct characters
- Find the first maximum length even word from a string
- Minimum number of bracket reversals needed to make an expression balanced | Set - 2
- Longest subarray such that adjacent elements have at least one common digit | Set - 2
- Maximum sum of K consecutive nodes in the given Linked List

- Segregate 0s and 1s in an array
- Segregate even and odd nodes in a Linked List
- Expression Evaluation
- Find a common element in all rows of a given row-wise sorted matrix
- Given a sorted and rotated array, find if there is a pair with a given sum
- Vertical Sum in Binary Tree | Set 2 (Space Optimized)
- Remove all occurrences of duplicates from a sorted Linked List
- Check for Symmetric Binary Tree (Iterative Approach)
- All unique triplets that sum up to a given value
- Find index of closing bracket for a given opening bracket in an expression
- Level order traversal line by line | Set 3 (Using One Queue)
- Number of subarrays with given product
- Maximum Product Subarray | Added negative product case
- Split array in three equal sum subarrays
- Longest substring with count of 1s more than 0s