Skip to content
  • Home
  • Contact Us
  • About Us
  • Privacy Policy
  • DMCA
  • Linkedin
  • Pinterest
  • Facebook
thecscience

TheCScience

TheCScience is a blog that publishes daily tutorials and guides on engineering subjects and everything that related to computer science and technology

  • Home
  • Human values
  • Microprocessor
  • Digital communication
  • Linux
  • outsystems guide
  • Toggle search form

Tag: CSharp

HackerRank Longest Mod Path Problem Solution

HackerRank Longest Mod Path Problem Solution

In this post, we will solve HackerRank Longest Mod Path Problem Solution. In the middle of a nightmare, Maxine suddenly finds herself in a mysterious room with the following items: There are Q levels to Maxine’s nightmare castle, and each one has a different set of valuesfor S. E. and M. Given the above information,…

Read More “HackerRank Longest Mod Path Problem Solution” »

c
HackerRank Modify The Sequence Solution

HackerRank Modify The Sequence Solution

In this post, we will solve HackerRank Modify The Sequence Problem Solution. You are given a sequence of integers a1,a2,a3…..an. You are free to replace any integer with any other positive integer. How many integers must be replaced to make the resulting sequence strictly increasing? Input FormatThe first line of the test case contains an…

Read More “HackerRank Modify The Sequence Solution” »

c
HackerRank Zurikela’s Graph Problem Solution

HackerRank Zurikela’s Graph Problem Solution

In this post, we will solve HackerRank Zurikela’s Graph Problem Solution. Zurikela is creating a graph with a special graph maker. At the begining, it is empty and has no nodes or edges. He can perform 3 types of operations: Create the graph by completing the Q operations specified during input. Then calculate themaximum number…

Read More “HackerRank Zurikela’s Graph Problem Solution” »

c
HackerRank Police Operation Problem Solution

HackerRank Police Operation Problem Solution

In this post, we will solve HackerRank Police Operation Problem Solution. Roy is helping the police department of his city in crime fighting. Today, they informed him about a new planned operation.Think of the city as a 2D plane. The road along the X-axis is very crime prone, because n criminals live there. No two…

Read More “HackerRank Police Operation Problem Solution” »

c
HackerRank Mining Problem Solution

HackerRank Mining Problem Solution

In this post, we will solve HackerRank Mining Problem Solution. There are n gold mines along a river, and each mine i produces w, tons of gold. In order to collect the mined gold, we want to redistribute and consolidate it amongst exactly k mines where it can be picked up by trucks. We do…

Read More “HackerRank Mining Problem Solution” »

c
HackerRank Dorsey Thief Problem Solution

HackerRank Dorsey Thief Problem Solution

In this post, we will solve HackerRank Dorsey Thief Problem Solution. Mr. Dorsey Dawson recently stole X grams of gold from ACME Jewellers. He is now on a train back home. To avoid getting caught by the police, he has to convert all the gold he has into paper money. He turns into a salesman…

Read More “HackerRank Dorsey Thief Problem Solution” »

c
HackerRank Square Subsequences Solution

HackerRank Square Subsequences Solution

In this post, we will solve HackerRank Square Subsequences Problem Solution. Square Subsequences A string is called a square string if it can be obtained by concatenating two copies of the same string. For example, “abab”, “aa” are square strings, while “aaa”, “abba” are not. Given a string, how many (non-empty) subsequences of the string…

Read More “HackerRank Square Subsequences Solution” »

c
HackerRank Extremum Permutations Solution

HackerRank Extremum Permutations Solution

In this post, we will solve HackerRank Extremum Permutations Problem Solution. Let’s consider a permutation P = {p1, p2, …, pN} of the set of N = {1, 2, 3, …, N} elements . P is called a magic set if it satisfies both of the following constraints: How many such magic sets are there? Input FormatThe first line of…

Read More “HackerRank Extremum Permutations Solution” »

c
HackerRank Swap Permutation Problem Solution

HackerRank Swap Permutation Problem Solution

In this post, we will solve HackerRank Swap Permutation Problem Solution. You are given an array A = [1, 2, 3, …, n]: An adjacent swap can be made between two elements of the Array A, A[i] and A[i+1] or A[i] and A[i-1].A swap otherwise can be between any two elements of the array A[i] and…

Read More “HackerRank Swap Permutation Problem Solution” »

c
HackerRank Hyper Strings Problem Solution

HackerRank Hyper Strings Problem Solution

In this post, we will solve HackerRank Hyper Strings Problem Solution. String A is called a Super String if and only if: A contains only letters a, b, c, d, e, f, g, h, i, j;For any i and j. A[i] has lower ascii code than A[j], where 0 < i < j < length…

Read More “HackerRank Hyper Strings Problem Solution” »

c
HackerRank Candles Counting Problem Solution

HackerRank Candles Counting Problem Solution

In this post, we will solve HackerRank Candles Counting Problem Solution. Tim is visiting his grandma for two days and is bored due to the lack of the electricity over there. That’s why he starts to play with grandma’s colorful candle collection.He aligned the N candles from left to right. The ith candle from the…

Read More “HackerRank Candles Counting Problem Solution” »

c
HackerRank Longest Palindromic Subsequence

HackerRank Longest Palindromic Subsequence

In this post, we will solve HackerRank Longest Palindromic Subsequence Problem Solution. Steve loves playing with palindromes. He has a string, s, consisting of n lowercase English alphabetic characters (i.e., a through z). He wants to calculate the number of ways to insert exactly 1 lowercase character into string s such that the length of…

Read More “HackerRank Longest Palindromic Subsequence” »

c

Posts navigation

Previous 1 2 3 … 28 Next

Copyright © 2023 TheCScience.

Powered by PressBook Grid Blogs theme