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

Tag: gfg

GFG PTOD | 17th Dec | Aggressive Cows

Posted on December 17, 2024December 17, 2024 By thecodepathshala No Comments on GFG PTOD | 17th Dec | Aggressive Cows
bool isPossible(int mid, int k, vector<int> &stalls) {
        int count = 1;
        int lastPos = stalls[0];
        
        for(int i=1; i < stalls.size(); i++) {
            if(stalls[i] - lastPos >= mid) {
                count++;
                lastPos = stalls[i];
                if(count == k) {
                    return true;
                }
            }
        }
        
        return false;
    }
    
    int aggressiveCows(vector<int> &stalls, int k) {

        // Write your code here
        sort(stalls.begin(), stalls.end());
        
        int low = 1;
        int high = stalls.back() - stalls.front();
        int res = 0;
        
        while(low <= high) {
            int mid = low + (high - low) / 2;
            if(isPossible(mid, k, stalls)) {
                res = mid;
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        return res;
    }
https://www.youtube.com/live/99E37Q-vf-I
DS & Algo, GFG

GFG : Maximum MEX from all subarrays of length K

Posted on March 12, 2024March 12, 2024 By thecodepathshala 2 Comments on GFG : Maximum MEX from all subarrays of length K

Given an array arr[] consisting of N distinct integers and an integer K, the task is to find the maximum MEX from all subarray of length K. The MEX is the smallest positive integer that is not present in the array. Solution :

Algo, Competitive Programming, DS & Algo, fixed size sliding window, GFG, Interview Questions, sliding window

GFG : Count distinct elements in every window

Posted on March 6, 2024March 6, 2024 By thecodepathshala No Comments on GFG : Count distinct elements in every window

Problem : Given an array of integers and a number K. Find the count of distinct elements in every window of size K in the array. Solution:

Algo, Competitive Programming, DS & Algo, GFG, Leetcode Problems

#54 Spiral Matrix

Posted on January 19, 2022January 19, 2022 By thecodepathshala No Comments on #54 Spiral Matrix

Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7,4,5] Example 2: Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]] Output: [1,2,3,4,8,12,11,10,9,5,6,7] Constraints: m == matrix.length n == matrix[i].length 1 <= m, n <= 10 -100 <= matrix[i][j] <= 100 Solution : Complete code:

Algo, Competitive Programming, DS & Algo, GFG, Leetcode Problems

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++ 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
🚀 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
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