Skip to main content

C++ Day 39

  C++ Day 39 STL Containers (Deep Understanding & Real Usage) Till now, you already know arrays, vectors, loops, and STL algorithms. Today, we go one step deeper and understand STL containers , which are the backbone of modern C++ programming. In real projects and competitive coding, choice of container matters a lot. 1. What are STL Containers? STL containers are data structures provided by C++ to store data efficiently. They handle: memory management resizing element access performance optimization You focus on logic , not memory handling. 2. Categories of STL Containers STL containers are mainly divided into: Sequence Containers Associative Containers Unordered Containers Container Adapters 3. Sequence Containers These store data in sequence . 3.1 Vector Most used container in C++. vector< int > v; Key Features: Dynamic size Contiguous memory Fast random access Slower insertion in middle Example: v. push_...
Post a Comment

Goal-Everyone's Dream

  GOAL


Every person in life has a goal, something they want to accomplish that gives them meaning and direction. Goals—not just a hope—are clearly stated objectives driving us to push on, clear barriers, and pursue success. Goals can be aggressive or simple, personal or professional, long-term or short-term. A goal gives sense to our actions and lets us evaluate our growth in life whether we want to pass an exam, gain admission to a top college, start a business, or help others.


From an early age, we are urged to set goals, especially in academics. Students may have objectives include obtaining excellent grades, gaining more understanding, or adhering to a particular career. These cerebral objectives encourage focus and effort. Knowing what we want transforms our studies into a stepping stone toward a better tomorrow. It evolves into something above and beyond a project. Understanding our objective motivates us to rise early, stay up late, make sacrifices, and work continuously.


Setting a goal is merely the starting point, however. Achieving a goal requires will, discipline, and ongoing effort. There will be moments when the road gets difficult. Failures, diversions, or apathy might be encountered. However, it is under these trying conditions that our real strength is challenged. Someone who is very committed to their goal won't give up when faced with challenges. They will instead learn from their mistakes, investigate fresh directions, and carry on no matter what.


Hard work lies in the middle between a dream and its fulfillment. Even the most clear goals call effort if they are to be realized. We have to work for success; just wishing for it won't cut it. This means that we must study for many hours, develop our skills, adhere to rules, and resist giving to inactivity or anxiety. Even the most talented individuals have to work hard. Though skill gets you ahead, hard work propels you to the finish line.


Furthermore necessary is perseverance. Determined people believe their goal will be reached no matter how long it takes. They refuse to be defined by errors. Rather they see failure as a chance for development. Rather than comparing themselves to others, they continue inspired by consistently trying to be better than they were.


Additionally very important is setting realistic and important goals. Goals ought to mirror your skills, interests, and principles. It should encourage you to grow yet also be reachable with time and effort. Rather than what people really want, they sometimes set goals depending on what others anticipate of them. Genuine fulfillment, though, results from following a cause that is personally meaningful—one that excites you and offers significance.


Basically, a target is a mark one can reach with commitment, work, and clarity rather than just a dream. It gives form to our life and directs our energy properly. With hard work, great enthusiasm, and a good attitude, anything—no matter how big or difficult—can be achieved. Hence, set your goals precisely, pursue them relentlessly, and never stop trusting in yourself. Every significant achievement begins with a well-defined and intentional objective.

Labels:

Comments

Post a Comment

Popular posts from this blog

C++ Day 35

  C++ Day 34: Layout Layouts (Part 2) We’ll cover: Constructer Layout Adjuster Layout Decorator Layout practise Task 🔹 1. developer form (creational) used to make compound objects measure away step ✅ employ case: you need to form associate in nursing aim (like amp pizza pie calculator house) with elective parameters example: cpp copy edit class calculator {     train Methodor gpu ram; public:     family developer {         train Methodor gpu ram;     public:         developer setcpu(string c) { Methodor = c; take *this; }         developer setgpu(string g) { gpu = g; take *this; }         developer setram(string r) { run = r; take *this; }         calculator Construct() {             take Calculater(cpu gpu ram);         }     };     Calculater(string snow train m train r) : cpu(c) gp...
Post a Comment
Read more

C++ Day 33

  C++ Day 33: Smart Pointers & Memory Management 🔹 1. wherefore forward pointers in c++ hand-operated green / cancel is error-prone: memory leaks 🧠 double deletes ❌ dangling pointers 💥 smart pointers care store mechanically exploitation raii (Supply skill is initialization) 🔹 ii. Types of Smart Pointers in C++ ✅ std::unique_ptr Sole ownership of a Supply. Cannot be copied. Automatically deletes the Supply when it goes out of scope. cpp Copy Edit #include  unique_ptr ptr1 = make_unique(10); cout << *ptr1 << endl; // 10 You can transfer ownership: cpp Copy Edit unique_ptr ptr2 = move(ptr1); ✅ std::shared_ptr Shared ownership multiple shared_ptrs can point to the same object. Uses reference counting to track how many owners. cpp Copy Edit shared_ptr p1 = make_shared(100); shared_ptr p2 = p1;  // Reference count = 2 When count goes to 0 memory is released. ✅ std::weak_ptr Non-owning reference to a shared_ptr-managed object. Used to break cyclic references ...
Post a Comment
Read more

CSES Increasing Subsequence solution

 You are given an array containing  n n n integers. Your task is to determine the longest increasing subsequence in the array, i.e., the longest subsequence where every element is larger than the previous one. A subsequence is a sequence that can be derived from the array by deleting some elements without changing the order of the remaining elements. Input The first line contains an integer n n n : the size of the array. After this there are n n n integers x 1 , x 2 , … , x n x_1,x_2,\ldots,x_n x 1 ​ , x 2 ​ , … , x n ​ : the contents of the array. Output Print the length of the longest increasing subsequence. Constraints 1 ≤ n ≤ 2 ⋅ 1 0 5 1 \le n \le 2 \cdot 10^5 1 ≤ n ≤ 2 ⋅ 1 0 5 1 ≤ x i ≤ 1 0 9 1 \le x_i \le 10^9 1 ≤ x i ​ ≤ 1 0 9 Example Input: 8 7 3 5 3 6 2 9 8 Output: 4 #include < bits / stdc ++. h > using namespace std ; void solve (){ int n ; cin >> n ; vector <int> arr ( n ); for ( int i = 0 ; i < n ; i ++)...
Post a Comment
Read more