## Count number of common elements between two arrays by using Bitset and Bitwise operation

Given two arrays a[] and b[], the task is to find the count of common elements in both the given arrays. Note that both the… Read More »

- Data Structures and Algorithms Online Courses : Free and Paid
- Count pairs in array whose sum is divisible by K
- Why companies like Amazon, Microsoft, Google focuses on Data Structures and Algorithms : Answered
- Travelling Salesman Problem implementation using BackTracking
- Longest subsequence such that adjacent elements have at least one common digit
- Count common characters in two strings
- Double Knapsack | Dynamic Programming
- Coin Change | BFS Approach
- Design a Chess Game
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Interactive Problems in Competitive Programming
- Microsoft Interview experience for full time position of software engineer at Microsoft Ireland Research
- Minimum number of cubes whose sum equals to given number N
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Complexity Analysis of Binary Search
- Merge two BSTs with constant extra space
- Rearrange characters in a string such that no two adjacent are same using hashing
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Microsoft TechSetGo Summer Internship Interview Experience
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Count how many times the given digital clock shows identical digits
- Program to generate all possible valid IP addresses from given string | Set 2
- Find a triplet in an array whose sum is closest to a given number
- Print path from root to all nodes in a Complete Binary Tree
- Rearrange numbers in an array such that no two adjacent numbers are same
- Range Queries to Find number of sub-arrays with a given xor
- Find maximum meetings in one room
- Count number of ways to reach destination in a maze
- Difference Between BFS and DFS
- Find the sum of the diagonal elements of the given N X N spiral matrix

Given two arrays a[] and b[], the task is to find the count of common elements in both the given arrays. Note that both the… Read More »

Given here are n circles which touch each other externally, and are lined up in a row. The distance between the centers of the first… Read More »

Given here are n squares which touch each other externally, and are lined up in a row. The distance between the centers of the first… Read More »

Given an array arr[] of N elements and an integer K, the task is to generate an B[] with the following rules: Copy elements arr[1…N],… Read More »

Given N-sided polygon we need to find the number of triangles formed by joining the vertices of the given polygon with exactly one side being… Read More »

Given an array arr[] and an integer K, the task is to count the pairs whose sum of set bits is K Examples: Input: arr[]… Read More »

Given an array arr[] of N elements and an integer X, the task is to find the minimum number of operations required to make sum… Read More »

Given a array ‘a[]’ of size n and number of queries q. Each query can be represented by a integer m. Your task is to… Read More »

Given an array arr[] of characters and an integer M, the task is to sort the array based on ASCII % M i.e. the character… Read More »

Given a circle C1 and it’s a radius r1. And one another circle C2 whose passes through center of circle C1 and touch the circumference… Read More »

Given an array arr1 containing integers from 1..N and another array arr2 containing integers from 1..M. Each element of arr1 is mapped to more than… Read More »

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

Given an array arr[] of positive integers, the task is to find whether it is possible to make this array strictly decreasing by modifying at… Read More »

Given an array arr[] and an integer X, the task is to find the indices such that: The sum of elements on the found indices… Read More »

Given a Binary Search Tree, the task is to find the node with maximum value. Examples: Input: Output: 22 Recommended: Please try your approach on… Read More »