question: Monk loves to preform different operations on arrays, and so being the principal of Hackerearth School, he assigned a task to his new student Mishki. Mishki will be provided with an integer array A of size N and an integer K , where she needs to rotate the array in the right direction by K steps and then print the resultant array. As she is new to the school, please help her to complete the task. Input: The first line will consists of one integer T denoting the number of test cases. For each test case: 1) The first line consists of two integers N and K, N being the number of elements in the array and K denotes the number of steps of rotation. 2) The next line consists of N space separated integers , denoting the elements of the array A. Output: Print the required array.

Easy

hi , can anyone help me

Can you send the C++ source codes within .h, .cpp, .pro and .ui file formats extensions for the weather calender updating system?

/warn do your assignments on your own

Everything is possible with any Turing complete language, but it easier to use some libraries with it

Everything is possible with any Turing complete language, but it easier to use some libraries with it

If something is Turing complete it doesn't mean that you can write everything. You can perform the same computation. Good luck writing OS in pure Java or Web page in pure C.

Hi, I need some opinion on design pattern. For an object with only few types (let's say 8) and only one instance of each type will exist, will you use a list[enum of each type as index], or static variable for each of them in the manager class

Thankssss😍

#include <iostream> using namespace std; double celsius(); int fahrenheit(); int main () { cout << celsius() << endl; } double celsius() { int f, c; cin >> f; c = (f - 32) * (5 / 9); cout << c << endl ; return c; }

Is this C++?

Yes

Oh I thought it was C

In C headers have .h extension in them, also there is no namespaces in C

If you know that you need all of them I'd have an std array of objects as a static members of the class

but didn't get expected answer

Do you think there are mind readers here?

I am one of them, i think the code is wrong

Where can i get any professional C++ project with source code and documentation?

pocoproject.org for a "java-style" C++ project. mariadb for a style closer to C (mariadb.org), scylladb.com for something more modern in term of style

Is there a better method to check if string has unique characters?...hash table, unordered set would provide linear time...and set would be nlogn,

try string matching algorithms like kmp

Is there a better method to check if string has unique characters?...hash table, unordered set would provide linear time...and set would be nlogn,

you should access every char in string to find out its uniqueness. so its can`t be better than linear

to make it faster you can use array[256] and treat is as hash

Yeah that is also linear ..even if I consider 128 characters

Is there a better method to check if string has unique characters?...hash table, unordered set would provide linear time...and set would be nlogn,

In theory it's not O(N), it's O(1).You need to access up to 256 characters at most. If the string is ASCII string and is longer than 256 you know it certainly has duplicates. If it's shorter just use array bool[256] and set it to true if you encounter a character. If it's already true return false from method isUniqueChar

In theory it's not O(N), it's O(1).You need to access up to 256 characters at most. If the string is ASCII string and is longer than 256 you know it certainly has duplicates. If it's shorter just use array bool[256] and set it to true if you encounter a character. If it's already true return false from method isUniqueChar

true for one byte char

Since unordered set theoretically is O(1)

This was what I was referring when I said hash method..I thought we could make it O(logn) somehow

If string is wide string it still O(1). Just that constant is pretty large. All this O(N) notation works when we're talking about infinite large numbers. In reality it doesn't always works

ok, you are right regarding O definition. but for short strings we should traverse all chars

That means the entire length of the string

hello everyone i need to write a c program like : For integers X and Y received from the user (assuming X < Y), write the program that adds all Germain prime numbers in the range of X to Y to an array and prints the elements in this array on the screen. Germain prime numbers are primes such that the number 2p + 1 is also prime. An additional string will not be used in this question. Otherwise, it will be evaluated as 0. also usage of user defined functions, continue and break is illegal. I've been this for 2 days but still i couldn't reach the right output. Here is my code, can someone check it and tell me where my mistake is https://codeshare.io/5v38mn

You did an array and after called 2d array on the for loop

But does it effect the output

I think it dose, because you printing j with no columns, but maybe I'm wrong, And it suppose to return 0?