Similar Collections

We are trying to list out the most frequently asked interview problems or the problem given in the coding rounds of IT giants.


Write a program that counts frequency of each letter in the string (string consists lowercase letters only)
Given two strings, check whether two given strings are anagram of each other or not. An anagram of a string is another string that contains same characters, only the order of characters can be different
For a given n, Print the count and say sequence using c++
Write a function to find the longest common prefix string amongst an array of strings
Given a binary string find the number of substring that can formed such that every substring starts with \"1\" and ends with \"1\"
Given a permutation write c++ program to print permutation just greater than this
Given a string that contains ternary expressions. The expressions may be nested. You need to convert the given ternary expression to a binary Tree and return the root
our goal is to minimize the number of bits to be flipped. Write a program to determine the minimum number of bits to reach the goal
Given a string S and a word C, return the count of the occurrences of anagrams of the word in the text. Both string and word are in lowercase letter
Given a string containing uppercase alphabets and integer digits (from 0 to 9), the task is to print the alphabets in the order followed by the sum of digits
Given an expression exp of length n consisting of some brackets. The task is to print the bracket numbers when the expression is being parsed
Given a string find the length of longest palindromic subsequence
Given an array pre[] of N nodes representing preorder traversal of BST. The task is to print its postorder traversal
Given a binary string of 0s and 1s. Find the maximum difference of number of 0s and number of 1s (number of 0s – number of 1s) in substrings of the string
Given an integer, S represented as a string, get the sum of all possible substrings of this string.
You are given a string and a pattern. You find the pattern on the given string. If found print how many times found the pattern and their index. Otherwise, print Not Found
total questions: 16





Best Answers