## Count of adjacent Vowel Consonant Pairs

Given a string, the task is to count the number of adjacent pairs such that the first element of the pair is a consonant and… Read More »

- Code Optimization Technique (logical AND and logical OR)
- Difference between Recursion and Iteration
- Algorithms | Recurrences | Set 1
- Microsoft Interview experience for full time position of software engineer at Microsoft Ireland Research
- Find the repeating and the missing number using two equations
- Maximum length of subarray such that sum of the subarray is even
- Count all Prime Length Palindromic Substrings
- Sort the numbers according to their sum of digits
- Find smallest number K such that K % p = 0 and q % K = 0
- Minimum operations of the given type required to make a complete graph
- Greatest divisor which divides all natural number in range [L, R]
- Longest substring of only 4's from the first N characters of the infinite string
- Generate original array from difference between every two consecutive elements
- Find the original coordinates whose Manhattan distances are given
- Choose points from two ranges such that no point lies in both the ranges
- Count of adjacent Vowel Consonant Pairs
- Find number of magical pairs of string of length L
- Find the largest interval that contains exactly one of the given N integers.
- Sorting Algorithms Visualization : Bubble Sort
- Complexity Analysis of Binary Search
- Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0's
- Algorithms Sample Questions | Set 3 | Time Order Analysis
- Algorithms Sample Questions | Recurrences | Set 2

Given a string, the task is to count the number of adjacent pairs such that the first element of the pair is a consonant and… Read More »

The human brain can easily process visuals in spite of long codes to understand the algorithms. In this article, Bubble sort visualization has been implemented… Read More »

Complexities like O(1) and O(n) are simple to understand. O(1) means it requires constant time to perform operations like to reach an element in constant… Read More »

Question 1: What is the asymptotic boundary of T(n)? θ( n*log(n) ) θ( n2 ) θ( n ) θ( n*log2(n) ) θ( n2*log2(n) ) Answer:… Read More »

Given the Manhattan distances of three coordinates on a 2-D plane, the task is to find the original coordinates. Print any solution if multiple solutions… Read More »

Question 1: What is the complexity of T(n)? Θ( 1⁄n ) Θ( 1⁄n2 ) Θ( 1 ) Θ( ln( n ) ) Answer: 3 Explanation:… Read More »

Given an array arr[] of N distinct integers, the task is to find the maximum elements in an interval [L, R] such that the interval… Read More »

A pair of string s and r are called magical if for every index i the character of s is less than r i.e. s[i]… Read More »

Position: Senior software engineer – Office 365 team I initially applied for senior software engineer position in Office 365 Team in Dublin, Ireland in Aug… Read More »

Given an array of N elements. The task is to find the length of the longest subarray such that sum of the subarray is even.… Read More »

Given an integer N, the task is to find the length of the longest substring containing only 4’s from the first N characters of the… Read More »

Given an integer N. The task is to generate a symmetric matrix of order N*N having the following properties. Main diagonal should contain only 0’s… Read More »

Given N – 1 differences between two consecutive elements of an array containing N numbers which are in range of 1 to N. The task… Read More »

Given two integers p and q, the task is to find the smallest number K such that K % p = 0 and q %… Read More »

Given an array arr[] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples: Input: arr[] =… Read More »