It's very simple and easy question asked in every interview.That is to find the second largest or smallest number from an array. the array is not sorted.

Home » Archives for July 2017

# Month: July 2017

It's very simple and easy question asked in every interview.That is to find the second largest or smallest number from an array. the array is not sorted.

Have you ever heard about GitHub? Github is how people build software.According to me, Github profile tells about your programming journey, what you have learned and developed throughout your career in Coding.

As you all know, NEC Technology is a leading IT MNC in India.We Computer science students always want to be a part of NEC.As usual, NEC Tech came in AMU for placement in 2016 for MCA and B Tech Students. In this article, you will know about the standard of NEC interviews and written papers, and you will learn different methods to solve these problems.

In AMU Campus , NEC Tech recruitment happened every year, in this article we have decided to share questions and solution of that technical round of AMU. This is the Interview Experience of @Saifullah Saifi

Solution of Non-Divisible Subset Hackerrank problem Given a set, S, of n distinct integers, print the size of a maximal subset, S’, of S where the sum of any 2 numbers in S’ is not evenly divisible by k. Input Format The first line contains 2 space-separated integers, n and k, respectively. The second line contains n space-separated integers (we’ll refer to the ith value as ai) describing the unique values of the set. Constraints 1<=k<=10 1<=n<=10^5 1<=ai<=10^9 All of …

Circular Array Rotation John Watson performs an operation called a right circular rotation on an array of integers,[a0,a1,a2,…,an-1]. After performing one right circular rotation operation, the array is transformed from [a0,a1,a2,…,an-1] to [an-1,a0,a1,a2,…,an-2]. Watson performs this operation k times. To test Sherlock’s ability to identify the current element at a particular position in the rotated array, Watson asks q queries, where each query consists of a single integer,m , for which you must print the element at index in the …