Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Invite Your Friends

    Learning is always more fun with friends, and studying together can help you all stay motivated and on track. Plus, you can share your insights and knowledge with one another, which can help you learn even more.
     
    💥
    Consistent practice is the key to achieving your goals! Making even a small amount of progress each day will help you build momentum and develop your skills over time.
     
    Practicing consistently with friends is always easier and more fun!

    Challenge

    Invite some friends to learn with you and write a program that will print the number of friends you’ve invited.
    The program should print the number of friends you have invited to learn with you (1, 2, 10, or even 100… Any number is great).
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue