Blog

In this tutorial, we will write a Keith number in C++. It is one of the most asked questions in an interview. Before that, you may go through the following topic in C programming.

• C++ for loop
• C++ while loop
• C++ if..else statement

What is Keith Number?

A positive n digit number x is called a Keith number or repfigit number (repetitive Fibonacci-like digit) if it is arranged in a special number sequence generated using its digits. This sequence has n terms as digit of x and the next term is determined by the sum of previous n terms and so on. And if the number x falls under this sequence then x is a Keith Number. Example: 19, 742, etc

Explanation: Consider the number 742. Go through the following steps:

First separate the digit, 7, 4, 2.

To find the next term, add the digits, 7+4+2 = 13
New Series: 7, 4, 2, 13.

To find the next term, add the last three digits of the above sequence, 13+2+4=19
New Series: 7, 4, 2, 13, 19.

To find the next term, add the last three digits of the above sequence, 19+13+2=34
New Series: 7, 4, 2, 13, 19, 34.

To find the next term, add the last three digits of the above sequence, 34+19+13=66
New Series: 7, 4, 2, 13, 19, 34, 66.

To find the next term, add the last three digits of the above sequence, 66+34+19=119
New Series: 7, 4, 2, 13, 19, 34, 66, 119.

To find the next term, add the last three digits of the above sequence, 119+66+34=219
New Series: 7, 4, 2, 13, 19, 34, 66, 119, 219.

To find the next term, add the last three digits of the above sequence, 219+119+66=404
New Series: 7, 4, 2, 13, 19, 34, 66, 119, 219, 404.

To find the next term, add the last three digits of the above sequence, 404+219+119=742
New Series: 7, 4, 2, 13, 19, 34, 66, 119, 219, 404, 742.

Now we will stop as we got the number 742 as the term of the series. Hence 742 is a Keith Number.

C++ Program to check whether the Number is Keith Number or not

#include <bits/stdc++.h>
using namespace std;

int digitCount(int n)
{
  int counter = 0;
  while (n > 0)
  {
    n = n / 10;
    counter++;
  }

  return counter;
}

int main()
{
  int num1 = 0, arr1[10], temp = 0, flag = 0, i = 0, sum = 0;

  cout << "Enter a number: ";
  cin >> num1;

  temp = num1;

  for (i = digitCount(temp) - 1; i >= 0; i--)
  {
    arr1[i] = num1 % 10;
    num1 /= 10;
  }

  while (flag == 0)
  {
    for (i = 0; i < digitCount(temp); i++)
      sum += arr1[i];
    if (sum == temp)
    {
      cout << "The entered number is a Keith Number\n";
      flag = 1;
    }

    if (sum > temp)
    {
      cout << "The entered number is NOT a Keith Number\n";
      flag = 1;
    }

    for (i = 0; i < digitCount(temp); i++)
    {
      if (i != digitCount(temp) - 1)
        arr1[i] = arr1[i + 1];
      else
        arr1[i] = sum;
    }

    sum = 0;
  }
}

Output:

//Run 1
Enter a number: 197
The entered number is a Keith Number

//Run 2
Enter a number: 15
The entered number is NOT a Keith number

In this tutorial, we will write a C++ program to implement singly linked list.

In this program, we will create a separate function for each operation that is to be performed in a linked list. This operation includes:

• create()
• insert(): this includes insetion at the begining, at the end or at a given position.
• delet() : delete is also the same that is at the begining, at the end or at a given position.
• display()
• search()

The program takes user input at every step necessary from the user and performed accordingly. The following are the various C++ programming topics used in the program.

• Switch statement
• while loop
• if..else statement
• break statement

Singly linked list in C++

#include <iostream>
#include <conio.h>
#include <stdlib.h>
using namespace std;

class Node
{
  public_colon
  int info;
  Node * next;
};

class List: public Node
{

  Node *first, *last;
  public_colon
  List()
  {
    first = NULL;
    last = NULL;
  }
  void create();
  void insert();
  void delet();
  void display();
  void search();
};

//create function
void List::create()
{
  Node * temp;
  temp = new Node;
  int n;

  cout << "\nEnter an Element: ";
  cin >> n;

  temp->info = n;
  temp->next = NULL;
  if (first == NULL)
  {
    first = temp;
    last = first;
  }
  else
  {
    last->next = temp;
    last = temp;
  }
}

//insert function
//at chosen position
void List::insert()
{
  Node *prev, *cur;
  prev = NULL;
  cur = first;
  int count = 1, pos, ch, n;
  Node *temp = new Node;

  cout << "\nEnter an Element: ";
  cin >> n;

  temp->info = n;
  temp->next = NULL;
  cout << "\nChoose the position:";
  cout << "\n1 for the beginning.";
  cout << "\n2 for the end.";
  cout << "\n3 for in between.";
  cout << "\nEnter Your Choice: ";
  cin >> ch;

  switch (ch)
  {
    case 1:
      temp->next = first;
      first = temp;
      break;
    case 2:
      last->next = temp;
      last = temp;
      break;
    case 3:
      cout << "\nEnter the Position to Insert: ";
      cin >> pos;
      while (count != pos)
      {
        prev = cur;
        cur = cur->next;
        count++;
      }
      if (count == pos)
      {
        prev->next = temp;
        temp->next = cur;
      }
      else
        cout << "\nNot Able to Insert";
      break;
  }
}

//function to delete
//at chosen position
void List::delet()
{
  Node *prev = NULL, *cur = first;
  int count = 1, pos, ch;
  cout << "Select the position for deletion: \n";
  cout << "\n1 for the beginning.";
  cout << "\n2 for the end.";
  cout << "\n3 for in between.";
  cout << "\nEnter Your Choice:";
  cin >> ch;

  switch (ch)
  {
    case 1:
      if (first != NULL)
      {
        cout << "\nDeleted Element is " << first->info;
        first = first->next;
      }
      else
        cout << "\nOperation Failed";
      break;
    case 2:
      while (cur != last)
      {
        prev = cur;
        cur = cur->next;
      }
      if (cur == last)
      {
        cout << "\nDeleted Element is: " << cur->info;
        prev->next = NULL;
        last = prev;
      }
      else
        cout << "\nOperation Failed";
      break;
    case 3:
      cout << "\nEnter the Position of Deletion: ";
      cin >> pos;
      while (count != pos)
      {
        prev = cur;
        cur = cur->next;
        count++;
      }

      if (count == pos)
      {
        cout << "\nDeleted Element is: " << cur->info;
        prev->next = cur->next;
      }
      else
      {
        cout << "\nOperation Failed";
      }
      break;
  }
}

//display function
//check for empty list first
void List::display()
{
  Node *temp = first;
  if (temp == NULL)
  {
    cout << "\nList is Empty";
  }
  while (temp != NULL)
  {
    cout << temp->info;
    cout << "-->";
    temp = temp->next;
  }
  cout << "NULL";
}

//search function
//check for empty list first
void List::search()
{
  int value, pos = 0;
  bool flag = false;

  if (first == NULL)
  {
    cout << "List is Empty";
    return;
  }
  cout << "Enter the Value to be Searched: ";
  cin >> value;

  Node * temp;
  temp = first;
  while (temp != NULL)
  {
    pos++;
    if (temp->info == value)
    {
      flag = true;
      cout << "Element" << value << "is Found at " << pos << " Position";
      return;
    }
    temp = temp->next;
  }
  if (!flag)
  {
    cout << value << " is not present in the List";
  }
}

//drive function
int main()
{
  List ls;
  int ch;
  while (1)
  {
    cout << "\nChoose an Operation: ";
    cout << "\n1 to CREATE.";
    cout << "\n2 to INSERT.";
    cout << "\n3 to DELETE.";
    cout << "\n4 to SEARCH.";
    cout << "\n5 to DISPLAY.";
    cout << "\n6 to EXIT.";
    cout << "\nEnter Your Choice: ";
    cin >> ch;

    switch (ch)
    {
      case 1:
        ls.create();
        break;
      case 2:
        ls.insert();
        break;
      case 3:
        ls.delet();
        break;
      case 4:
        ls.search();
        break;
      case 5:
        ls.display();
        break;
      case 6:
        return 0;
    }
  }
  return 0;
}

Output:

Choose an Operation:
1 to CREATE.
2 to INSERT.
3 to DELETE.
4 to SEARCH.
5 to DISPLAY.
6 to EXIT.
Enter Your Choice: 1

Enter an Element: 2

Choose an Operation:
1 to CREATE.
2 to INSERT.
3 to DELETE.
4 to SEARCH.
5 to DISPLAY.
6 to EXIT.
Enter Your Choice: 2

Enter an Element: 4

Choose the position:
1 for the beginning.
2 for the end.
3 for in between.
Enter Your Choice: 2

Choose an Operation:
1 to CREATE.
2 to INSERT.
3 to DELETE.
4 to SEARCH.
5 to DISPLAY.
6 to EXIT.
Enter Your Choice: 5
2-->4-->NULL
Choose an Operation:
1 to CREATE.
2 to INSERT.
3 to DELETE.
4 to SEARCH.
5 to DISPLAY.
6 to EXIT.
Enter Your Choice: 6

Similarly, you can follow the option, and then you can search and delete an element from the list.

In this tutorial, we will learn about the Peterson number and write a C++ program to check if the given number is a Peterson number or not.

What is Peterson Number?

A number is said to be a Peterson number if the sum of factorials of each digit of the number is equal to the number itself.

Peterson numbers example:

Number = 145
145 = !1 + !4 + !5
= 1 + 4*3*2*1 + 5*4*3*2*1
= 1 + 24 + 120
= 145 = 145

Therefore, we can see that after the sum of the factorial of 145 is equal to the number 145 itself. Hence the Peterson Number.

Cpp program to check a number is Peterson number or not

#include <iostream>
using namespace std;

int peterson_func(int num)
{
  int rem, sum = 0, fact = 1, i;

  while (num != 0)
  {
    rem = num % 10;

    for (i = 1; i <= rem; i++)
      fact *= i;

    sum += fact;
    fact = 1;
    num /= 10;

  }

  return sum;
}

int main()
{
  int num, sum = 0, temp;

  cout << "Enter a number: ";
  cin >> num;

  temp = num;
  sum = peterson_func(num);

  if (sum == temp)
    cout << num << " is a Peterson number";
  else
    cout << num << " is NOT a Peterson number";

  return 0;
}

Output:

Enter a number: 145
145 is a Peterson number

Enter a number: 55
55 is not a Peterson number

In this tutorial, we will write a C++ program to check for sunny numbers.

What is Sunny Number?

A number N is said to be a sunny number if the number next to the given number (N+1) is a perfect square.

Example: Let us take a Number 8, then the next number is 8+1=9 and as 3 is a square root of 9, hence 8 is a sunny Number.

Another example, let the number be 5, then 5+1=6, that has no square roots, hence 5 is not a sunny Number.

Sunny Number Program in C++

Question: Check if the given number is a sunny number or not in C++ programming.

#include <iostream>
#include <cmath>

using namespace std;

bool is_sunny(int);   //function prototype

int main()
{
  int num;

  cout << "Enter the number: ";
  cin >> num;

  if (is_sunny(num))
    cout << num << " is a sunny number";
  else
    cout << num << " is NOT a sunny number";

  return 0;
}

bool is_sunny(int n)
{
  // find the square root
  int square = sqrt(n + 1);

  return (square *square == n);
}

Output:

Enter the number: 81
81 is a sunny number