Questions

Given an unsorted array of n elements, find if the element k is present in the array or not.
Complete the findNumber function in the editor below. It has 2 parameters:
  1. An array of integers, arr, denoting the elements in the array.
  2. An integer, k, denoting the element to be searched in the array.
The function must return a string "YES" or "NO" denoting if the element is present in the array or not.

Input Format

The first line contains an integer n, denoting the number of elements in the array arr.
Each line i of the n subsequent lines (where 0 ≤ i < n) contains an integer describing arri.
The next line contains an integer, k, the element that needs to be searched. 

Constraints
  • 1 ≤ n ≤ 105
  • 1 ≤ arr[i] ≤ 109

Output Format
The function must return a string "YES" or "NO" denoting if the element is present in the array or not. This is printed to stdout by locked stub code in the editor.

Explanation 0
Given the array = [1, 2, 3, 4, 5], we want to find the element 1 if it is present or not. We can find the element 1 at index = 0. Therefore we print "YES".

Explanation 1
Given the array [2, 3, 1] and k = 5. There is no element 5 in the array and therefore we print "NO".

------------------------------------
Odd Numbers : 
Given two integers, l and r, print all the odd numbers between l and r (l and r inclusive). 

Complete the oddNumbers function in the editor below. It has 2 parameters:
  1. An integer, l, denoting the left part of the range.
  2. An integer, r, denoting the right part of the range.
The function must return an array of integers denoting the odd numbers between l and r.

Input Format
Locked stub code in the editor reads the following input from stdin and passes it to the function:
The first line contains an integer, l, denoting the left part of the range.
The second line contains an integer, r, denoting the right part of the range.

Constraints
  • 1 ≤ l ≤ r ≤ 105

Output Format
The function must return an array of integers denoting the odd numbers between l and r. This is printed to stdout by locked stub code in the editor.

Explanation 0
The value of l is 2 and value of r is 5. The odd numbers between [2, 5] are 3 and 5.


-------------------
Which of the following sorting algorithms has the best asymptotic runtime complexity?
Pick one of the choices

Comments

Post a Comment

Popular posts from this blog

RUN JAVA PROJECT IN ANDROID STUDIO

You can compile and run java module as stand alone java project in Android Studio IDE. Follow the below steps  Open your Android project in Android Studio. If you do not have one, create one. Click  File > New Module . Select  Java Library  and click  Next . Fill in the package name, etc and click  Finish . You should now see a Java module inside your Android project. Add your code to the Java module you’ve just created. Click on the drop down to the left of the run button. Click  Edit Configurations… In the new window, click on the plus sign at the top left of the window and select  Application A new application configuration should appear, enter in the details such as your main class and classpath of your module.
Read more

Gradle DSL method not found: 'compile()'

As the note of your project's  build.gradle  file suggests: // NOTE: Do not place your application dependencies here; they belong // in the individual module build.gradle files Remove the 2 compile statements in that gradle file: compile 'com.android.support:appcompat-v7:20.+' compile 'com.google.android.gms:play-services:6.5.+' And then make your other (module's)  build.gradle  dependencies look like this: dependencies { compile fileTree ( dir : 'libs' , include : [ '*.jar' ]) compile 'com.android.support:appcompat-v7:21.0.3' compile 'com.google.android.gms:play-services:6.5.+' }
Read more

Reverse string using recursion

#include <stdio.h> #include <string.h> void reverse(char str[], int, int); int main() {         int size = 0;         char str[20];         printf ("Enter the your string \n");         scanf ("%s", str);         size = strlen(str);         reverse(str, 0, size - 1);         printf ("String after reverse : %s\n", str);         return 0; } void reverse(char str[], int index, int size) {         char temp;         temp = str[index];         str[index] = str[size - index];         str[size - index] = temp;         if (index == (size / 2)) {                 return;         }         reverse(str, index + 1, size); }
Read more