Software Engineer

What is the full form of IPC?

What are the types of DBMS? (Learn)

#include 
using namespace std;

int main()
{
   int number;
   number = -100;
   if (number >= 0) {
       cout << number << " is a positive number." << endl;
   }
   else {
       cout << number << " is a negative number." << endl;
   }
   return 0;
}

Given an array ‘a’ of size ‘n’-1 with elements of range 1 to ‘n’. The array does not contain any duplicates. Your task is to find the missing number.

For example:

Input:
'a' = [1, 2, 4, 5], 'n' = 5

Output :
3

Explanation: 3 is the missing value in the range 1 to 5.

Given an unsorted array of integers, you have to move the array elements in a way such that all the zeroes are transferred to the end, and all the non-zero elements are moved to the front. The non-zero elements must be ordered in their order of appearance.

For example, if the input array is: [0, 1, -2, 3, 4, 0, 5, -27, 9, 0], then the output array must be:

[1, -2, 3, 4, 5, -27, 9, 0, 0, 0].

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, ‘n’ is the size of the array.

I was asked about my project—how I built it and what problems I faced.

The interviewer asked basic personal questions about my family background and hometown.