Common interview question

 Reverse string , Reverse array, Palindrome
vector , list , set and map implementation
go through alogrithm.h functions and map.h, vector.h, set.h, bitset.h, string.h and list.h
API functions, operator functons of map, vector and list
accessing index of list. map and vector and printing
modifying the value at the index of list, map and vector
finding the key and modifying the value in a map
deleting the entry in map, list and vector

missin integer, consecutive number in arrays

#include <iostream>
#include <vector>
#include <map>
#include <numeric>
#include <algorithm>
using namespace std;
int main()
{
  std::map<int, int> m;
  std::vector v{1,2,3,5,6};
  for(auto &x: v)
  {
     m[x]++;
  }
  for(int i=1; i <= v[v.size() -1]; i++)
  {
      if(m[i] < 1)
      {
          std::cout << "missing integer is:" << i <<std::endl;
      }
      
  }
}

Comments

Post a Comment

Popular posts from this blog

GlobalLogic Interview

 Toplevel traversal in a BST Class with parent virtual function defined (program) Virtual destructor copy constructor, copy constructor why do we give reference Polymorphism Frequency of characters in "globallogic" If we declare a constructor as private, can we create an object ? Ans: we can't create object on stack but we can create on heap using new  Even or odd using Thread coding question #include <thread> #include <iostream> using namespace std; void even_func(int n) {     if(n%2 == 0)     {         cout << "Number is even" <<endl;     }      } void odd_func(int n) {     if(n%2 != 0)     {         cout << "Number is odd" <<endl;     }      } int main() {      for(int i=0; i< 100; i++)      {         thread th1(even_func, i);         thre...
Read more

Motorola(Dynamic Technologies) Kolkata

 #include <stdio.h> #define MAX_SIZE 30 int stack[30]; static int size; int push(int a) {    if(size >= MAX_SIZE)    {        printf("overflow\n");        return 0;    }   else {       stack[size++] = a;       return 1;   } } int pop() {     if(size < 0)     {         printf("underflow\n");         return -1;     }     else {          return stack[size--];     } } int main() {     char *c = "(((5+7)*6)/2)";     while(*c != '\0')     {          switch(*c)          {              case '1':              case '2':case '3':case '4':case '5':case '6': case '7':case '8':case '9':case '0':case '+':case '-':cas...
Read more

Euronet interview questions

Some questions were from test4geeks  void GetSomeVariable(int **i) {    if(*i == NULL)    {       *i = new int;    }   **i = 20;   } int main() {    int someValue = 10;    GetSomeVariable(&someValue);    cout << someValue <<endl;        int *ptr = nullptr;    GetSomeVariable(&ptr);    cout << *ptr <<endl; } How to make the code compilable without changing GetSomeVariable? Solution: Use Function overloading or Type traits #include <iostream> #include <type_traits> void g(int*) { std::cout << 'L'; } void g(int**) { std::cout << 'R'; } template<typename T> void f(T t) {     if (std::is_same_v<T, int>) { std::cout << 1; }      if (std::is_same_v<T, int*>) { std::cout << 2; }      if (std::is_same_v<T, int**>) { std::cout <...
Read more