# Tag Archives: Technical Scripter 2020

One of those shrewd editing programs, Ocenaudio, takes on the entire burden of audio recording and editing. This makes it a tool that begs users… Read More
Finite Automata (FA) is a simple machine used to match patterns in an input string. Finite Automata is a quintuple i.e., it has five elements.… Read More
Given a positive integer N, the task is to find the maximum value among all the rotations of the digits of the integer N. Examples:… Read More
Given a positive integer N, the task is to find the maximum value among all the rotations of the digits of the integer N. Examples:… Read More
Given a positive integer N, the task is to find the maximum value among all the rotations of the digits of the integer N. Examples:… Read More
Given a binary string S of size N, the task is to maximize the sum of the count of consecutive 0s present at the start… Read More
Given a binary string S of size N, the task is to maximize the sum of the count of consecutive 0s present at the start… Read More
Given a binary string S of size N, the task is to maximize the sum of the count of consecutive 0s present at the start… Read More
Given a binary string S of size N, the task is to maximize the sum of the count of consecutive 0s present at the start… Read More
Given a matrix mat[][] of dimensions M * N, the task is to print the matrix obtained after rotating every ith row of the matrix… Read More
Given a matrix mat[][] of dimensions M * N, the task is to print the matrix obtained after rotating every ith row of the matrix… Read More
Given a matrix mat[][] of dimensions M * N, the task is to print the matrix obtained after rotating every ith row of the matrix… Read More
Given a string S containing lowercase English alphabets, and a matrix shift[][] consisting of pairs of the form{direction, amount}, where the direction can be 0… Read More
Given a string S containing lowercase English alphabets, and a matrix shift[][] consisting of pairs of the form{direction, amount}, where the direction can be 0… Read More
Given a string S containing lowercase English alphabets, and a matrix shift[][] consisting of pairs of the form{direction, amount}, where the direction can be 0… Read More