Topic -3
SEARCHING AND SORTING
- Find first and last positions of an element in a sorted array
- Find a Fixed Point (Value equal to index) in a given array
- Optimum location of point to minimize total distance
- Find the repeating and the missing
- find majority element
- Searching in an array where adjacent differ by at most k
- find a pair with a given difference
- find four elements that sum to a given value
- maximum sum such that no 2 elements are adjacent
- Count triplet with sum smaller than a given value
- Search in a rotated sorted array
- square root of an integer
- Maximum and minimum of an array using minimum number of comparisons
- merge 2 sorted arrays
- print all subarrays with 0 sum
- Product array Puzzle
- Job Scheduling Algo
- Missing Number in AP
- Smallest number with atleast trailing zeroes in factorial
- Painters Partition Problem:
- Sort array according to count of set bits
- minimum no. of swaps required to sort the array
- Bishu and Soldiers
- Rasta and Kheshtak
- Kth smallest number again
- Find pivot element in a sorted array
- K-th Element of Two Sorted Arrays
- Aggressive cows
- Book Allocation Problem
- Subset Sums
- Find the inversion count
- Implement Merge-sort in-place
- Partitioning and Sorting Arrays with Many Repeated Entries
Topic -4
STRINGS
- Reverse a String
- Check whether a String is Palindrome or not
- Find Duplicate characters in a string
- Why strings are immutable in Java?
- Write a Code to check whether one string is a rotation of another
- Write a Program to check whether a string is a valid shuffle of two strings or not
- Count and Say problem
- Write a program to find the longest Palindrome in a string.
- Find Longest Recurring Subsequence in String
- Print all Subsequences of a string.
- Write a program to find the smallest window that contains all characters of string itself.
- Rearrange characters in a string such that no two adjacent are same
- Minimum characters to be added at front to make string palindrome
- Print all the permutations of the given string
- Split the Binary string into two substring with equal 0’s and 1’s
- Word Wrap Problem .
- EDIT Distance
- Find next greater number with same set of digits.
- Balanced Parenthesis problem.
- Convert a Sentence into its equivalent mobile numeric keypad sequence.
- Minimum number of bracket reversals needed to make an expression balanced.
- Count All Palindromic Subsequence in a given String.
- Count of number of given string in 2D character array
- Search a Word in a 2D Grid of characters.
- Boyer Moore Algorithm for Pattern Searching.
- Converting Roman Numerals to Decimal
- Longest Common Prefix
- Number of flips to make binary string alternate
- Find the first repeated word in string.
- Minimum number of swaps for bracket balancing.
- Find the longest common subsequence between two strings.
- Program to generate all possible valid IP addresses from given string.
- Given a sequence of words, print all anagrams together
- Find the smallest window in a string containing all characters of another string
- Recursively remove all adjacent duplicates
- String matching where one string contains wildcard characters
- Function to find Number of customers who could not get a computer
- Transform One String to Another using Minimum Number of Given Operation
- Check if two given strings are isomorphic to each other
- Recursively print all sentences that can be formed from list of word lists
- Rabin Karp Algorithm
- KMP Algorithm
- Word break problem
Note - Questions in red are most Important ones and asked many times.
Questions in BLUE are important Algorithms to be Considered.
** If having any sort of problems while Solving do let us know in the Comments Section Below**
ONLINE COMPILER ---
Link to part-1 : Take me to part-1
Link to part-3 : Take me to part-3
){kind=link}
0 Comments