- Number of turns to reach from one node to other in binary tree
- Collect maximum points in an array with k moves
- Counting cross lines in an array
- Count all 0s which are blocked by 1s in binary matrix
- Root to leaf path with maximum distinct nodes
- Traveling Salesman Problem (TSP) Implementation
- Print all n digit patterns formed by mobile Keypad
- Longest subsequence having equal numbers of 0 and 1
- Minimum Word Break
- Mirror of matrix across diagonal
- Generate original array from an array that store the counts of greater elements on right
- Find smallest subarray that contains all elements in same order
- Prime Numbers
- Maximum array from two given arrays keeping order same
- Minimum jumps to reach last building in a matrix
- Fermat's little theorem
- Game of replacing array elements
- Reverse bits using lookup table in O(1) time
- WildCard pattern matching having three symbols ( * , + , ? )
- Counting even decimal value substrings in a binary string
- Maximum difference of zeros and ones in binary string | Set 2 (O(n) time)
- Ropes left after every removal of smallest
- Count set bits in an integer using Lookup Table
- Closest Palindrome Number (absolute difference Is min)
- Count special palindromes in a String
- Count binary strings with twice zeros in first half
- Range Queries for Longest Correct Bracket Subsequence Set | 2
- Range query for count of set bits

Nishant_Singh hasn't improved any 'Articles' yet!