## Maximum length substring having all same characters after k changes

We have a string of length n, which consist only UPPER and LOWER CASE characters and we have a number k (always less than n… Read More »

- OOPs | Object Oriented Design
- Microservices Introduction
- DBMS | Interfaces
- Introduction to Programming Languages
- Best way to answer If an Interviewer asks about Salary Expectation to you as a Fresher
- How Does the Blockchain Work?
- Virtual Reality, Augmented Reality, and Mixed Reality
- Vector processor classification
- Introduction to Blockchain technology | Set 2
- Introduction to Parallel Computing
- DBMS | Challenges of database security
- Computer Network | Wifi protected access (WPA)
- Computer Network | Wifi protected setup (WPS)
- Computer Ports
- Introduction to Internet of Things (IoT) | Set 1
- Vector instruction types
- Longest subarray with elements divisible by k
- Image Formats
- Web Information Retrieval | Vector Space Model
- Find the only different element in an array
- Introduction to Apache Cassandra
- Human - Computer interaction through the ages
- Mathematics | Renewal processes in probability
- Introduction to SAS programming
- Univariate, Bivariate and Multivariate data and its analysis
- Computer Network | Voice over Internet Protocol (VoIP)
- Hackathon - Think, Code, Create
- Count pairs from two arrays whose modulo operation yields K
- Liang-Barsky Algorithm
- Hardware Based Virtualization

We have a string of length n, which consist only UPPER and LOWER CASE characters and we have a number k (always less than n… Read More »

If you have ever tried to create a program for solving Sudoku, you might have come across the Exact Cover problem. In this article, we… Read More »

Master theorem is used to determine the Big – O upper bound on functions which possess recurrence, i.e which can be broken into sub problems.… Read More »

When a person visits a place, the first thing he checks is that if there is an open Wi-Fi connection available so that he could… Read More »

I am very sure that everyone is able to find middle index of array once you know start index and end index of array, but… Read More »

Given two non-negative numbers n and m. The problem is to find the largest number having n number of set bits and m number of… Read More »

Returns a reference to the character at the specified location pos. The function automatically checks whether pos is the valid position of a character in… Read More »

Given two numbers you are required to check whether they are anagrams of each other or not in binary representation. Examples: Input : a =… Read More »

Given a doubly linked list. The problem is to remove all adjacent duplicate nodes from the list such that the final modified doubly linked list… Read More »

You are given an initial string s starting with “0”. The string keeps duplicating as follows. Invert of it is appended to it. Examples: Input… Read More »

Given a non-negative number n and two values l and r. The problem is to unset the bits in the range l to r in… Read More »

Given a non-negative number n and two values l and r. The problem is to toggle the bits in the range l to r in… Read More »

Given a non-negative number n. The problem is to toggle the last m bits in the binary representation of n. A toggle operation flips a… Read More »

Given a number n. The problem is to efficiently check whether n is a multiple of 4 or not without using arithmetic operators. Examples: Input… Read More »

Given a non-negative number n. The problem is to set the rightmost unset bit in the binary representation of n. If there are no unset… Read More »