Skip to content
  • Home
  • YouTube
  • About
  • Contact
Learn to Code and Code to Learn

Learn to Code and Code to Learn

Your Journey to Code Mastery

  • Interview Prep Sheet
    • TCP DSA 75
    • TCP DSA 150
    • TCP DSA 351
    • TCP HLD 50
    • TCP HLD 101
  • General
    • Setup
    • Mastering in C programming (Crash Course)
  • DSA Patterns
    • Fast and Slow Pointer
    • sliding window
      • fixed size sliding window
      • Variable size sliding window
  • Coding Prep
    • Leetcode Problems
      • Leetcode Practice
      • Leetcode PTOD
      • TCP DSA 150
    • GFG
      • GFG Practice
      • GFG PTOD
    • Company wise Interview Questions
      • Google
      • Microsoft
  • Programming
    • C Programming
    • C++
      • C++-11
      • c++-14
      • STL
    • Python
  • HLD
    • TCP HLD 50
    • TCP HLD 101
  • LLD
    • SOLID Principle
    • Design Pattern
      • Creational Design Patterns
        • Singleton
  • Toggle search form

C program to check whether a number is Strong number or not

Posted on December 18, 2023December 18, 2023 By thecodepathshala No Comments on C program to check whether a number is Strong number or not

Example

Input

Input number: 145

Output

145 is STRONG NUMBER

Strong numberย is a special number whose sum of factorial of digits is equal to the original number.
For example: 145 is strong number. Since,ย 1! + 4! + 5! = 145

/**
 * C program to check whether a number is Strong Number or not
 */

#include <stdio.h>

int main()
{
    int i, originalNum, num, lastDigit, sum;
    long fact;

    /* Input a number from user */
    printf("Enter any number to check Strong number: ");
    scanf("%d", &num);

    /* Copy the value of num to a temporary variable */
    originalNum = num;

    sum = 0;

    /* Find sum of factorial of digits */
    while(num > 0)
    {

        /* Get last digit of num */
        lastDigit = num % 10;

        /* Find factorial of last digit */
        fact = 1;
        for(i=1; i<=lastDigit; i++)
        {
            fact = fact * i;
        }

        /* Add factorial to sum */
        sum = sum + fact;

        num = num / 10;
    }

    /* Check Strong number condition */
    if(sum == originalNum)
    {
        printf("%d is STRONG NUMBER", originalNum);
    }
    else
    {
        printf("%d is NOT STRONG NUMBER", originalNum);
    }

    return 0;
}

/*
Output :

Enter any number to check Strong number: 145
145 is STRONG NUMBER
*/
C Programming, Programming Tags:C Programming, loop, loops

Post navigation

Previous Post: C program to find perfect numbers between 1 to n
Next Post: C program to print strong numbers between 1 to n

More Related Articles

C program to print all even numbers from 1 to n C Programming
C program to convert Hexadecimal to Decimal number system C Programming
C program to print strong numbers between 1 to n C Programming
C program to find perfect numbers between 1 to n C Programming
C program to count total number of notes in given amount C Programming
C program to convert Binary to Decimal number system C Programming

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Archives

  • May 2026
  • August 2025
  • March 2025
  • February 2025
  • January 2025
  • December 2024
  • August 2024
  • April 2024
  • March 2024
  • February 2024
  • January 2024
  • December 2023
  • November 2023
  • September 2023
  • February 2023
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021

Categories

  • Algo
  • Array in C
  • C Programming
  • C++
  • C++
  • Company Wise
  • Competitive Programming
  • Design Pattern
  • DS
  • DS & Algo
  • Fast and Slow Pointer
  • fixed size sliding window
  • General
  • GFG
  • GFG PTOD
  • HLD
  • hld101
  • Interview Prep Sheet
  • Interview Questions
  • Leetcode Problems
  • Leetcode PTOD
  • LLD
  • Low-level design
  • Mastering in C programming (Crash Course)
  • Neetcode 150
  • Programming
  • Roadmap
  • Setup
  • Setup
  • sliding window
  • SOLID Principle
  • STL
  • string in c
  • System Design
  • TCP DSA 150
  • TCP DSA 351
  • TCP DSA 75
  • TCP HLD50
  • Top X
  • Variable size sliding window

Tags

algorithm array basic c++ coding interview C Programming Crash Course data structure and algorithm design pattern dsa easy Fixed size sliding window fubctions GFD gfg GFG PTOD hard HLD jump game LC PTOD leetcode Leetcode PTOD Leetcode Top Interview 150 LLD loop loops Low-level design Mastering C Programming in 15 Days matrix medium rotate array searching&sorting sliding window solid STL string string in c sunction in c system design TCP HLD50 TCP HLD101 Template in C++ Top Top 20 coding patterns to master MAANG Interview Top interview 150

C++ Vector + 20 Minutes + Complete Tutorial + DSA + Coding Interviews

Agar aap C++ mein DSA ya Coding Interview ki preparation kar rahe hain, toh ek STL container aapko sabse zyada use karna padega โ€” Vector! ๐Ÿ”ฅ

Lekin kya aapko actually pata hai ki Vector internally kaise kaam karta hai?

Normal array aur vector mein actual difference kya hai?

size() aur capacity() alag kyun hote hain?

push_back() ke peeche kya hota hai?

Aur sabse important โ€” reserve() aur resize() mein kya difference hai?

Is video mein hum C++ STL Vector ko zero se interview level tak samjhenge โ€” sirf functions nahi, balki vector ke internal working, memory allocation aur time complexity ko bhi understand karenge.

๐Ÿš€ C++ VECTOR IN 20 MINUTES โ€” COMPLETE GUIDE

๐Ÿ”ฅ IMPORTANT CONCEPTS

In this video, we'll understand:

โœ… vector [int] v
โœ… Vector vs Array
โœ… Dynamic Array
โœ… Contiguous Memory
โœ… size()
โœ… capacity()
โœ… push_back()
โœ… pop_back()
โœ… reserve()
โœ… resize()
โœ… clear()
โœ… empty()
โœ… front() / back()
โœ… operator[]
โœ… Iteration
โœ… Reallocation
โœ… Amortized O(1) push_back()
โœ… O(1) Random Access
โœ… Vector Time & Space Complexity
โœ… Interview-oriented Vector usage

๐Ÿง  SIZE vs CAPACITY

size() โ†’ Vector mein currently kitne elements hain.

capacity() โ†’ Current allocated storage mein maximum kitne elements fit ho sakte hain without another allocation.

Example:

vector[int] v;

v.push_back(10);
v.push_back(20);
v.push_back(30);

cout - v.size();
cout - v.capacity();

Size aur capacity ka difference samajhna vector ke internal working ko samajhne ke liye extremely important hai.

โšก push_back() INTERNALLY KYA KARTA HAI?

Jab vector ke paas extra capacity hoti hai, push_back() new element ko available storage mein add kar deta hai.

Lekin jab:

size == capacity

toh vector ko larger memory block allocate karke existing elements ko move/copy karna pad sakta hai. Isi wajah se individual reallocation expensive ho sakti hai, although push_back() ka amortized complexity O(1) hota hai.

๐Ÿš€ reserve() vs resize()

reserve(n)
โ†’ Future growth ke liye capacity reserve karta hai.
โ†’ Existing size ko change nahi karta.

resize(n)
โ†’ Vector ke actual number of elements ko change karta hai.
โ†’ Elements add ya remove ho sakte hain.

Ye dono functions coding interviews mein frequently confuse kiye jaate hain.

๐ŸŽฏ VECTOR INDEXING O(1) KYUN HAI?

Vector elements contiguous memory mein store hote hain.

Isliye:

v[i]

ko direct address calculation ke through access kiya ja sakta hai.

Conceptually:

address = base_address + i ร— sizeof(element)

Isi wajah se vector random access O(1) provide karta hai.

๐Ÿ’ผ CODING INTERVIEWS MEIN VECTOR

Vector DSA problems mein bahut commonly use hota hai:

๐Ÿ”ฅ Two Sum
๐Ÿ”ฅ Sliding Window
๐Ÿ”ฅ Prefix Sum
๐Ÿ”ฅ Sorting Problems
๐Ÿ”ฅ Binary Search
๐Ÿ”ฅ Two Pointers
๐Ÿ”ฅ Matrix / 2D Vector
๐Ÿ”ฅ Dynamic Programming
๐Ÿ”ฅ Graph Representation
๐Ÿ”ฅ Frequency Arrays
๐Ÿ”ฅ LeetCode Problems

Agar aap C++ mein DSA kar rahe hain, toh Vector ko sirf ek STL function nahi, balki dynamic array ke concept ke roop mein samajhna bahut important hai.

๐Ÿ”” WHO IS THIS VIDEO FOR?

This video is perfect for:

โœ”๏ธ C++ Beginners
โœ”๏ธ DSA Beginners
โœ”๏ธ Coding Interview Preparation
โœ”๏ธ Placement Preparation
โœ”๏ธ LeetCode Beginners
โœ”๏ธ Competitive Programming
โœ”๏ธ Software Engineer Interviews

Agar aapko C++ STL ko practical DSA + interview perspective se seekhna hai, toh TheCodePathshala ko subscribe karein. ๐Ÿš€

๐Ÿ‘ Video helpful lage toh Like karein
๐Ÿ’ฌ Comment karein: size() aur capacity() mein difference pehle pata tha?

๐Ÿ”” Subscribe for C++, DSA, LeetCode & System Design

#Cpp #CPlusPlus #Vector #CPPSTL #STL #DSA #CodingInterview #LeetCode #CompetitiveProgramming #DSAInCPlusPlus #CPlusPlusProgramming #TheCodePathshala  #LeetCode

๐Ÿ”Ž Tags:
c++ vector,
c++ vector tutorial,
c++ vector in 20 minutes,
c++ vector explained,
vector in c++,
vector c++ tutorial,
c++ stl vector,
c++ stl vector tutorial,
c++ vector for dsa,
c++ vector for coding interview,
vector in c++ for beginners,
c++ vector size capacity,
size vs capacity c++,
c++ vector push_back,
push_back internally c++,
c++ vector reserve resize,
reserve vs resize c++,
c++ vector internals,
how vector works in c++,
vector vs array c++,
c++ dynamic array,
c++ vector time complexity,
vector indexing o(1),
c++ vector interview questions,
vector interview questions,
c++ dsa,
dsa in c++,
c++ coding interview,
c++ placement preparation,
leetcode c++,
c++ stl tutorial hindi,
c++ vector hindi,
vector kya hai c++,
c++ vector explained hindi,
c++ vector
c++ vector explained
vector in c++
vector in c++ stl
c++ stl vector
c++ vector tutorial
c++ vector complete tutorial
c++ vector complete introduction
vector c++
vector stl
stl vector
c++ stl
c++ dsa
c++ data structures
vector data structure
dynamic array c++
array vs vector c++
vector vs array
size vs capacity c++
vector size capacity
push_back c++
push_back internally
reserve vs resize c++
vector reserve
vector resize
vector indexing
c++ coding interview
dsa interview preparation
c++ placement preparation
learn c++ stl
c++ for beginners
C++ Vector in 20 Minutes ๐Ÿ”ฅ | Complete Vector Tutorial for DSA & Coding Interviews
๐Ÿ”ฅ C++ STL IN 30 MINUTES โ€” Complete Introduction for DSA & Coding Interviews!

Confused about C++ STL while solving DSA and LeetCode problems? In this video, weโ€™ll understand the Standard Template Library (STL) from scratch and learn the most important concepts you actually need for competitive programming, DSA, placements and coding interviews.

Instead of spending hours learning STL, this 30-minute C++ STL crash course gives you a practical overview of the most important STL components with examples and complexity.

๐Ÿš€ What You'll Learn

โœ… What is C++ STL?
โœ… Why STL is important for DSA
โœ… STL Containers
โœ… Vector
โœ… Pair
โœ… List
โœ… Stack
โœ… Queue
โœ… Priority Queue
โœ… Set
โœ… Map
โœ… Unordered Map / Set
โœ… Iterators
โœ… Important STL Algorithms
โœ… sort()
โœ… reverse()
โœ… find()
โœ… binary_search()
โœ… lower_bound()
โœ… upper_bound()
โœ… min() / max()
โœ… Time Complexity of important STL operations
โœ… How STL helps in LeetCode & Coding Interviews

๐Ÿ’ก Why Should You Learn STL?

If you're preparing for:

๐Ÿ”ฅ LeetCode
๐Ÿ”ฅ Coding Interviews
๐Ÿ”ฅ DSA Placements
๐Ÿ”ฅ Competitive Programming
๐Ÿ”ฅ Amazon / Microsoft / Google / Meta Interviews
๐Ÿ”ฅ C++ Programming

then knowing STL can significantly reduce the amount of code you need to write and help you focus on the actual problem-solving logic.

By the end of this video, you should have a clear roadmap of which C++ STL containers, functions and algorithms you need to learn for DSA.

๐Ÿ‘‰ Subscribe to TheCodePathshala for practical DSA, C++, LeetCode and System Design videos.

๐Ÿ‘ Like the video if this STL crash course helped you!

๐Ÿ’ฌ Comment below: Which STL topic confuses you the most?

#๏ธโƒฃ HASHTAGS

#Cpp #CPlusPlus #STL #CPPSTL #DSA #DSAInCPlusPlus #CodingInterview #LeetCode #CompetitiveProgramming #Programming #CppProgramming #Coding #SoftwareEngineering #TheCodePathshala

SEO KEYWORDS / TAGS

c++ stl, c++ stl tutorial, c++ stl complete tutorial, c++ stl in 30 minutes, c++ stl crash course, c++ standard template library, standard template library in c++, c++ stl for dsa, c++ stl for beginners, c++ stl interview, c++ stl coding interview, c++ stl containers, c++ vector, c++ pair, c++ list, c++ stack, c++ queue, c++ priority queue, c++ set, c++ map, unordered_map c++, unordered_set c++, c++ iterators, c++ algorithms, c++ sort, c++ lower_bound, c++ upper_bound, c++ dsa, dsa in c++, leetcode c++, competitive programming c++, c++ coding interview, c++ placement preparation, c++ interview preparation, learn c++ stl, c++ stl explained, c++ stl one shot, c++ stl complete guide, c++ stl tutorial hindi, c++ stl hindi, standard template library tutorial
c++, stl, standard template library, dsa, data structures, algorithms, c++ interviews, stl introduction, c++ programming, coding interviews, competitive programming, stl functions, stl containers, learn c++, c++ basics, stl, cplus, cpp, stl, stl, cppp, alogrithms, c++ in 30 minutes, c stl, datastructure, algorithims
C++ STL IN 30 MINUTES ๐Ÿ”ฅ | Complete STL Introduction for DSA & Interviews
Important!!
Is DSA required for FAANG interview ๐Ÿ‡ฎ๐Ÿ‡ณโ™ฅ๏ธ
Bug free code | prod ready #google #leetcode #codeprep #codeadventure #codeeveryday
2 sum in O(n) #google #microsoft
Design a system for 10 million users #Design #google #microsoft #interview
System design basic #systemdesign #apple #google
LeetCode #1 โ€“ Two Sum | Under 3 Minutes #leetcode #viral #codeeveryday #codelife
Load More... Subscribe

TCP DSA

75
150
351

TCP HLD

50
101

Recent Posts

  • CAP THEOREM
  • TCP DSA 351
  • TCP HLD 101
  • TCP HLD 50
  • TCP DSA-150

    Recent Comments

    1. Odell Volner on C program to print multiplication table of a given number
    2. Crista Diegidio on C program to print multiplication table of a given number
    3. Daniel Pauling on C program to print multiplication table of a given number
    4. Tonisha Hepp on C program to print multiplication table of a given number
    5. Jorge Layng on C program to print multiplication table of a given number

    Copyright © 2026 Learn to Code and Code to Learn.

    Powered by PressBook Blog WordPress theme