Questions Set 1

-

Questions Set 1

Hello Friends 

I am new to this community of blogging and would love to seek help from anyone who wishes to.I am currently a student and pursuing B.Tech in Computer Science and preparing for interviews.There many platforms were you can prepare yourself for coding interviews but I feel that platforms have a lot of problems.Obviously the more questions you solve more will be your ability to ace such interviews but solving that many questions is a difficult task.That is what has made me bring this blog to you.I will be frequently putting up questions of varying difficulty in sets and I believe solving these questions will give you an idea of where you stand and what you lag.I will be posting 4 questions very often.This way not only i will be benefited but it will also help budding coders improve their skills.This is the set 1.

I will be providing the link to questions taken from different platforms or sites where you can verify your logic.You can also read the questions from this blog itself.I believe a blog series like these will help budding coders or those who have joined the coding community recently. Suggestions are always welcomed.

1-Find the missing AP term(Easy)

An Arithmetic Progression is defined as one in which there is a constant difference between the consecutive terms of a given series of numbers. You are provided with consecutive elements of an Arithmetic Progression. There is however one hitch: exactly one number from the original series is missing from the set of numbers which have been given to you. The rest of the given series is the same as the original AP. Find the missing number.

SAMPLE INPUT
 
5
1 3 5 9 11    
SAMPLE OUTPUT
 
7        



2- Swap two numbers without using a temporary variable(Easy)

Given two variables, x and y, swap two variables without using a third variable.



3-Finding Unique Element without extra space (Easy)

Given an array of integers. All numbers occur twice except one number which occurs once. Find the number in O(n) time & constant extra space.

SAMPLE INPUT
 
5
1 7 1 5 6 6 5 
SAMPLE OUTPUT
 
7  


4-Finding Unique Element extended (Medium)

Given an array in which all numbers except two are repeated once. (i.e. we have 2n+2 numbers and n numbers are occurring twice and remaining two have occurred once). Find those two numbers in the most efficient way.

SAMPLE INPUT
 
5
1 7 1 5 5 9 11 11 
SAMPLE OUTPUT
 
7  9


Comments

Post a Comment

Popular posts from this blog

Question Set 4

-
  This is question set 4. Another day another set.This set contains 3 questions from the famous CSES problems set.This set has some problems that new programmers must give a try. Happy Coding! "while(!success) keep trying”   Problem 1- Repetitions (Easy) You are given a DNA sequence: a string consisting of characters A, C, G, and T. Your task is to find the longest repetition in the sequence. This is a maximum-length substring containing only one type of character. The only input line contains a string of n characters. Print one integer: the length of the longest repetition. Constraints 1 ≤ n≤ 10^6 Example Input: ATTCGGGA Output: 3 Link to the question- https://cses.fi/problemset/task/1069   Problem 2-Weird Algorithm (Easy) Consider an algorithm that takes as input a positive integer n. If n is even, the algorithm divides it by two, and if n is odd, the algorithm multiplies it by three and adds one. The algorithm repeats this, until n is one. For examp
Read more

Question Set 5

-
“Simplicity is prerequisite for reliability.” — Edsger Dijkstra Problem 1-Fibonacci Series (Easy) The Fibonacci sequence is a series where the next term is the sum of previous two terms. The first two terms of the Fibonacci sequence is 0 followed by 1.Print Fibonacci Series upto a number n. 0,1,1,2,3,5,8,13,..... Link to question- https://www.programiz.com/cpp-programming/examples/fibonacci-series Problem 2-Factorial (Easy) Factorial of a non-negative integer, is multiplication of all integers smaller than or equal to n. For example factorial of 6 is 6*5*4*3*2*1 which is 720. Find factorial of a number N. Link to question- https://www.geeksforgeeks.org/program-for-factorial-of-a-number/ Problem 3-Primality Test (Easy) Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples of first few prime numbers are 2, 3, 5, 7, 11 ..... Link to question- https://www.geeksforgeeks.org/pr
Read more

Question Set 2

-
This is question set 2. This set has some implementation problems and try submitting them on different platforms.This will help you get familiar with coding platforms. Problem 1-Watermelon(Easy) One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed  w  kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem. Pete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight. The first (and the
Read more