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

Month: December 2023

C program to find perfect numbers between 1 to n

Posted on December 18, 2023December 18, 2023 By thecodepathshala 1 Comment on C program to find perfect numbers between 1 to n

Example Input Input upper limit: 100 Output Perfect numbers between 1 to 100: 6, 28 Perfect number is a positive integer which is equal to the sum of its proper positive divisors. For example: 6 is the first perfect numberProper divisors of 6 are 1, 2, 3Sum of its proper divisors = 1 + 2 +…

Read More “C program to find perfect numbers between 1 to n” »

C Programming, Programming

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

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

Example Input Input any number: 6 Output 6 is PERFECT NUMBER Perfect number is a positive integer which is equal to the sum of its proper positive divisors.For example: 6 is the first perfect numberProper divisors of 6 are 1, 2, 3Sum of its proper divisors = 1 + 2 + 3 = 6.Hence 6 is…

Read More “C program to check whether a number is perfect number or not” »

C Programming, Programming

C program to find Armstrong numbers between 1 to n

Posted on December 18, 2023December 18, 2023 By thecodepathshala 3 Comments on C program to find Armstrong numbers between 1 to n

Example Input Enter lower limit: 1 Enter upper limit: 1000 Output Armstrong number between 1 to 1000 are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 370, 371, 407 An Armstrong number is a n-digit number that is equal to the sum of nth power of its digits. For example,6 = 61 = 6371 = 33 + 73 + 13 = 371 Program…

Read More “C program to find Armstrong numbers between 1 to n” »

C Programming, Programming

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

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

Example Input Input number: 371 Output 371 is armstrong number An Armstrong number is a n-digit number that is equal to the sum of the nth power of its digits. For example –6 = 61 = 6371 = 33 + 73 + 13 = 371

C Programming, Programming

C program to find prime factors of a number

Posted on December 18, 2023December 18, 2023 By thecodepathshala No Comments on C program to find prime factors of a number

Example Input Input any number: 10 Output Prime factors of 10: 2, 5

C Programming, Programming

C program to print all prime numbers between 1 to n

Posted on December 18, 2023December 18, 2023 By thecodepathshala 1 Comment on C program to print all prime numbers between 1 to n

Example Input Input lower limit: 1 Input upper limit: 20 Output Prime numbers between 1-20: 2, 3, 5, 7, 13, 17, 19 Program to print prime numbers in given range

C Programming, Programming

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

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

Example Input Input any number: 17 Output 17 is prime number Prime numbers are the positive integers greater than 1 that is only divisible by 1 and self. For example: 2, 3, 5, 7, 11 etc…

C Programming, Programming

C program to find LCM of two numbers

Posted on December 18, 2023 By thecodepathshala No Comments on C program to find LCM of two numbers

Example Input Input number1: 12 Input number2: 30 Output LCM = 60 LCM is a smallest positive integer that exactly divides two or more numbers. For Example

C Programming, Programming

C program to find HCF (GCD) of two numbers

Posted on December 18, 2023December 18, 2023 By thecodepathshala No Comments on C program to find HCF (GCD) of two numbers

Example Input Input first number: 12 Input second number: 30 Output HCF of 12 and 30: 6 HCF (Highest Common Factor) is the greatest number that divides exactly two or more numbers. HCF is also known as GCD (Greatest Common Divisor) or GCF (Greatest Common Factor).

C Programming, Programming

C program to find factorial of a number

Posted on December 18, 2023 By thecodepathshala No Comments on C program to find factorial of a number

Example Input Input number: 5 Output Factorial: 120

C Programming, Programming

Posts navigation

Previous 1 2 3 4 … 9 Next

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

LeetCode #1 – Two Sum | Under 3 Minutes #leetcode #viral #codeeveryday #codelife
🚀 LeetCode #1 – Two Sum Explained in Under 2 Minutes!
Learn the most asked coding interview problem using the Hash Map approach and understand why it runs in O(n) time instead of O(n²).
In this Short, you'll learn:
✅ Problem statement
✅ Optimized Hash Map approach
✅ Step-by-step dry run
✅ Time & Space Complexity
✅ Interview tips
If you're preparing for FAANG, Microsoft, Amazon, Google, or any software engineering interview, this series is for you.
👍 Like the video if it helped.
💬 Comment which LeetCode problem I should explain next.
🔔 Subscribe for daily DSA, Golang, System Design, and Coding Interview content.
#leetcode #twosum #dsa #coding #programming #cpp #golang #interview #softwareengineer #shorts #codinginterview #algorithms #datastructures
🚀 LeetCode #1 – Two Sum Explained in Under 3 Minutes! #leetcode #viral #codeeveryday #codelife
Queue #codinginterview #education #databaseconcepts #algorithmanalysis #spacecomplexity #dsa
Want to clearly understand Time Complexity and Space Complexity of Queue for DSA and coding interviews? 🤔
In this video, we explain Queue Data Structure Complexity using simple examples, Big-O notation, and interview-focused concepts.

🚀 What You’ll Learn in This Video:

What is a Queue in Data Structures?

Queue Principle: FIFO (First In First Out)

Types of Queue (Simple, Circular, Priority, Deque)

Time Complexity of Queue Operations

Enqueue → O(1)

Dequeue → O(1)

Front / Peek → O(1)

Rear → O(1)

Search → O(n)

Space Complexity of Queue

Queue Implementation (Array vs Linked List)

Real-World Applications of Queue

Most Asked Queue Interview Questions

🎯 Why Watch This Video?
✔ Easy explanation of Big O Notation
✔ Important for Coding Interviews & Exams
✔ Useful for C, C++, Java, Python learners
✔ Beginner-friendly & exam-oriented

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Master DSA Concepts Step-by-Step!

👍 Like | 💬 Comment | 🔔 Subscribe for more Data Structures & Algorithms content


🔖 Tags:
time complexity of queue
space complexity of queue
queue data structure
queue operations time complexity
big o notation queue
queue using array
queue using linked list
circular queue time complexity
queue interview questions
dsa queue tutorial
time and space complexity of queue,
time and space complexity problems,
time and space complexity python,
time and space complexity in ds,
time and space complexity of algorithm,
time and space complexity data structure,
calculating time and space complexity,
time and space complexity examples,
time and space complexity of dfs,
time and space complexity of an algorithm,
time and space complexity in c,
time and space complexity in c++,
finding time complexity and space complexity,
data structures time and space complexity,
data structure time and space complexity,
time and space complexity in dsa,
time and space complexity explained,
calculate space and time complexity,
space and time complexity in dsa,
time and space complexity of algorithms,
space and time complexity dsa,
time and space complexity algorithm,
calculate time and space complexity,
how to find time and space complexity of algorithms


🔖 Hashtags:

#QueueDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
🔥 Time & Space Complexity of Queue | Queue Data Structure | Big-O Explained
Want to master Time Complexity and Space Complexity of Stack for DSA and coding interviews? 🤔
In this video, we explain Stack Data Structure Complexity using simple examples, Big-O notation, and interview-oriented explanations.

🚀 What You’ll Learn in This Video:

What is a Stack in Data Structures?

Stack Principle: LIFO (Last In First Out)

Time Complexity of Stack Operations

Push → O(1)

Pop → O(1)

Peek / Top → O(1)

Search → O(n)

Space Complexity of Stack

Stack Implementation (Array vs Linked List)

Real-World Applications of Stack

Common Stack Interview Questions

🎯 Why Watch This Video?
✔ Clear explanation of Big O Notation
✔ Essential for DSA Interviews & Exams
✔ Helpful for C, C++, Java, Python learners
✔ Beginner-friendly & concept-focused

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Build Strong DSA Foundations – One Concept at a Time!

👍 Like | 💬 Comment | 🔔 Subscribe for more Data Structures & Algorithms videos


🔖 Tags:
time complexity of stack
space complexity of stack
stack data structure
stack operations time complexity
big o notation stack
stack using array
stack using linked list
stack interview questions
dsa stack tutorial
time and space complexity of stack,
time and space complexity dsa,
time and space complexity problems,
time and space complexity javascript,
time and space complexity in ds,
space and time complexity dsa,
time and space complexity of the algorithm,
space complexity and time complexity,
space and time complexity explained,
time complexity and space complexity explained,
time complexity and space complexity dsa,
time and space complexity in c++,
dsa space and time complexity,
time and space complexity explained,
time and space complexity of an algorithm,
time and space complexity in c,
finding time complexity and space complexity,
dfs time and space complexity,
space and time complexity java,
time and space complexity js,
data structures time and space complexity,
time and space complexity in dsa,
time and space complexity of dfs,
time and space complexity of recursion,
space and time complexity of algorithm,
space and time complexity in dsa,
time and space complexity of algorithms,
time and space complexity of algorithm,
calculating space and time complexity

🔖 Hashtags:
#StackDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
🔥 Time & Space Complexity of Stack | Stack Data Structure | Big-O Explained
Linked list operations and time complexity | BigO notation #education #scaling #codinginterview
📌 Array Part-5 : Time and Space Complexity of Array | Data Structures & Algorithms

Tags:
time complexity of array
space complexity of array
array data structure time complexity
big o notation array
array operations time complexity
dsa array tutorial
array interview questions
data structures and algorithms

time and space complexity of array,
time and space complexity python,
time and space complexity dsa,
time and space complexity examples,
time and space complexity in recursion,
time and space complexity of algorithm,
data structures time and space complexity,
space and time complexity java,
time complexity and space complexity examples,
calculate time complexity and space complexity,
time complexity and space complexity python,
time complexity and space complexity explained,
calculate space and time complexity,
time and space complexity in c++,
time and space complexity in ds,
time and space complexity problems,
finding time complexity and space complexity,
algorithms time and space complexity,
time complexity of array,
space and time complexity dsa,
data structure time and space complexity,
time and space complexity js,
big o notation time and space complexity,
time and space complexity explained,
space and time complexity in dsa,
space and time complexity python,
time complexity and space complexity dsa,
calculate time and space complexity,
time and space complexity algorithm,
time and space complexity java

🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
📌 Array Part-5 : Time and Space Complexity of Array | Data Structures & Algorithms
Struggling to understand Time Complexity and Space Complexity of Linked Lists? 🤔
This video explains Linked List Data Structure Complexity in a simple, interview-focused, and beginner-friendly way using Big-O notation and real examples.

🚀 What You’ll Learn in This Video:

What is a Linked List in Data Structures?

Types of Linked List (Singly, Doubly, Circular)

Time Complexity of Linked List Operations

Accessing Elements → O(n)

Searching → O(n)

Insertion → O(1) / O(n)

Deletion → O(1) / O(n)

Space Complexity of Linked List

Linked List vs Array (Complexity Comparison)

Most Asked DSA Interview Questions on Linked List

🎯 Why Watch This Video?
✔ Clear explanation of Big O Notation
✔ Perfect for Coding Interviews & Exams
✔ Useful for C, C++, Java, Python learners
✔ Beginner to Intermediate friendly

📌 Who Should Watch?

DSA Beginners

Computer Science Students

Coding Interview Aspirants

Competitive Programmers

📈 Master DSA Step-by-Step – Build Strong Foundations!

👍 Like | 💬 Comment | 🔔 Subscribe for more DSA & Programming videos

📌 Tags:
time complexity of linked list
space complexity of linked list
linked list data structure
linked list operations time complexity
big o notation linked list
linked list vs array
dsa linked list tutorial
linked list interview questions
linked list, time complexity, space complexity, data structures, algorithm analysis, big o notation, linked list operations, runtime efficiency, algorithm optimization, programming interviews, coding algorithms, data structure efficiency, linked list implementation, computational complexity, linked list design, performance analysis
time and space complexity of linked list,
time complexity of linked list,
time and space complexity of dfs,
time and space complexity of recursion,
time and space complexity in ds


🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
#LinkedList
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#DataStructures
#Programming
🔥 Time & Space Complexity of Linked List | DSA Made Easy | Big-O Explained
📌 Array Part-4 : Time and Space Complexity of Array | Data Structures & Algorithms

Tags:
time complexity of array
space complexity of array
array data structure time complexity
big o notation array
array operations time complexity
dsa array tutorial
array interview questions
data structures and algorithms

time and space complexity of array,
time and space complexity python,
time and space complexity dsa,
time and space complexity examples,
time and space complexity in recursion,
time and space complexity of algorithm,
data structures time and space complexity,
space and time complexity java,
time complexity and space complexity examples,
calculate time complexity and space complexity,
time complexity and space complexity python,
time complexity and space complexity explained,
calculate space and time complexity,
time and space complexity in c++,
time and space complexity in ds,
time and space complexity problems,
finding time complexity and space complexity,
algorithms time and space complexity,
time complexity of array,
space and time complexity dsa,
data structure time and space complexity,
time and space complexity js,
big o notation time and space complexity,
time and space complexity explained,
space and time complexity in dsa,
space and time complexity python,
time complexity and space complexity dsa,
calculate time and space complexity,
time and space complexity algorithm,
time and space complexity java

🔖 Hashtags:
#Array #TimeComplexity #SpaceComplexity #DSA #BigONotation #DataStructures #CodingInterview #ProgrammingBasics
#ArrayDataStructure
#TimeComplexity
#SpaceComplexity
#BigONotation
#DSA
#CodingInterview
#LearnDSA
#Programming
#ComputerScience
📌 Array Part-4 : Time and Space Complexity of Array | Data Structures & Algorithms
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