Канал: Techies Code

Coin Change 2 LeetCode | Recursion

Coin Change 2 LeetCode | Recursion

Recursion on Array Part-2 | Last Occurrence of Key

Recursion on Array Part-2 | Last Occurrence of Key

Print all Subsequence of String or Array | Recursion

Print all Subsequence of String or Array | Recursion

Fast Exponentiation (x^y) | Recursion

Fast Exponentiation (x^y) | Recursion

How Recursive code Executed | How Recursion works?

How Recursive code Executed | How Recursion works?

Basics of Recursion | Easiest way to understand | Detailed Explanation

Basics of Recursion | Easiest way to understand | Detailed Explanation

Introduction to Recursion | How to think Recursively

Introduction to Recursion | How to think Recursively

Quick Sort Code | Detail Explanation

Quick Sort Code | Detail Explanation

Time Complexity of Quick Sort

Time Complexity of Quick Sort

Quick Sort | Algorithm | Complete Logic

Quick Sort | Algorithm | Complete Logic

Kth Largest Element in Array | O(n) | Quick Select | Heaps | Sorting

Kth Largest Element in Array | O(n) | Quick Select | Heaps | Sorting

Majority Element LeetCode | Interview Preparation | Sorting | Divide and Conquer | Techies Code

Majority Element LeetCode | Interview Preparation | Sorting | Divide and Conquer | Techies Code

Gas Station | 134 LeetCode | Explanation, Intuition, Code | Greedy C++

Gas Station | 134 LeetCode | Explanation, Intuition, Code | Greedy C++

Find the Duplicate (Bit Masking Approach) | LeetCode | Interview Preparation Array | Techies Code

Find the Duplicate (Bit Masking Approach) | LeetCode | Interview Preparation Array | Techies Code

Find the Duplicate | LeetCode | Interview Preparation Array | Techies Code |

Find the Duplicate | LeetCode | Interview Preparation Array | Techies Code |

Run C++ Code in Sublime Text | Sublime Text Setup | Techies Code

Run C++ Code in Sublime Text | Sublime Text Setup | Techies Code

Minimize the maximum difference between the heights | Greedy Algorithm | Interview Preparation

Minimize the maximum difference between the heights | Greedy Algorithm | Interview Preparation

Maximum XOR value of a pair from a range | BitMasking Interview Question

Maximum XOR value of a pair from a range | BitMasking Interview Question

Copy List with Random Pointer | LeetCode | Interview Preparation | Linked List + Hashmap

Copy List with Random Pointer | LeetCode | Interview Preparation | Linked List + Hashmap

Merge Sort | Sorting Algorithm | Divide and Conquer | Techies Code |

Merge Sort | Sorting Algorithm | Divide and Conquer | Techies Code |

Sudoku Solver | Real Life Project | C++ | JavaScript | Techies Code

Sudoku Solver | Real Life Project | C++ | JavaScript | Techies Code

N Queen Problem | Backtracking | Recursion | Techies Code |

N Queen Problem | Backtracking | Recursion | Techies Code |

Sudoku Solver Project C++ | Real Life Project | C++ | Techies Code

Sudoku Solver Project C++ | Real Life Project | C++ | Techies Code

cin.get() V/s cin.getline() | cin, cin.get(), cin.getline() | How to use cin?

cin.get() V/s cin.getline() | cin, cin.get(), cin.getline() | How to use cin?

Partition List | LeetCode | Even After Odd | Linked List | Interview Preparation

Partition List | LeetCode | Even After Odd | Linked List | Interview Preparation

Maximum Circular Subarray Sum | Modified Kadane's Algorithm

Maximum Circular Subarray Sum | Modified Kadane's Algorithm

Reverse Linked List II | Leetcode | Hard | Interview Questions | Linked List

Reverse Linked List II | Leetcode | Hard | Interview Questions | Linked List

Reverse Nodes in k-Group | Leetcode | Hard | Interview Questions | Linked List

Reverse Nodes in k-Group | Leetcode | Hard | Interview Questions | Linked List

Remove Nth Node From End of List | Leetcode | Medium | Interview Questions | Linked List

Remove Nth Node From End of List | Leetcode | Medium | Interview Questions | Linked List

Kth Node from End | Two Pointer Approach | Linked List

Kth Node from End | Two Pointer Approach | Linked List

Circular Linked List | Implementation | Insertion | Code

Circular Linked List | Implementation | Insertion | Code

Deletion in Doubly Linked List

Deletion in Doubly Linked List

Insertion Part -2 Doubly Linked List

Insertion Part -2 Doubly Linked List

Introduction to Doubly Linked List

Introduction to Doubly Linked List

Implementation of Doubly Linked List

Implementation of Doubly Linked List

Insertion in Doubly Linked List

Insertion in Doubly Linked List

Searching Linked List | Linear Search Better Than Binary Search

Searching Linked List | Linear Search Better Than Binary Search

Slow and Fast Pointer Approach | Mid Point of linked List | Single Iteration

Slow and Fast Pointer Approach | Mid Point of linked List | Single Iteration

Calculate Length of Linked List | C++ | Techies Code

Calculate Length of Linked List | C++ | Techies Code

Implementation of Linked List | Print Linked List | C++

Implementation of Linked List | Print Linked List | C++

Reverse Linked List (Method-3) || Recursive Method || Modifying Data not Links

Reverse Linked List (Method-3) || Recursive Method || Modifying Data not Links

Reverse Linked List (Method-2) || Recursive Method || Modifying Links

Reverse Linked List (Method-2) || Recursive Method || Modifying Links

Reverse Linked List (Method-1) || Iterative Method

Reverse Linked List (Method-1) || Iterative Method

Deletion in Linked List Part - 2 (Deletion Code) || Delete at K || Delete at Beg || Delete at End

Deletion in Linked List Part - 2 (Deletion Code) || Delete at K || Delete at Beg || Delete at End

Deletion in Linked List Part - 1 (Deletion Logic) || Delete at K || Delete at Beg || Delete at End

Deletion in Linked List Part - 1 (Deletion Logic) || Delete at K || Delete at Beg || Delete at End

Linked List Insertion Part - 3 || Insert Node At K (Logic and C++ Code)

Linked List Insertion Part - 3 || Insert Node At K (Logic and C++ Code)

Linked List Insertion Part - 2 || Insert Node At Beginning (Logic and C++ Code)

Linked List Insertion Part - 2 || Insert Node At Beginning (Logic and C++ Code)

Linked List Insertion Part - 1 || Linked List Insertion || Insert Node At End (Code C++)

Linked List Insertion Part - 1 || Linked List Insertion || Insert Node At End (Code C++)

Linked List Iteration

Linked List Iteration

1. Introduction to Linked List

1. Introduction to Linked List

Recursion Bootcamp 🔥🔥 | Day -3 : Recursion Level -3 | Techies Code |

Recursion Bootcamp 🔥🔥 | Day -3 : Recursion Level -3 | Techies Code |

Recursion Bootcamp 🔥🔥 | Day -2 : Recursion Level -2 | Techies Code |

Recursion Bootcamp 🔥🔥 | Day -2 : Recursion Level -2 | Techies Code |

Recursion on Arrays Part - 1

Recursion on Arrays Part - 1

Merge Sorted Arrays | Techies Code |

Merge Sorted Arrays | Techies Code |

Recursion Bootcamp 🔥🔥 | Day -1 Intro to Recursion | Techies Code |

Recursion Bootcamp 🔥🔥 | Day -1 Intro to Recursion | Techies Code |

Code 🔥🔥 Largest Rectangle in Histogram Using Stack | LeetCode | Histogram Area | Data Structures

Code 🔥🔥 Largest Rectangle in Histogram Using Stack | LeetCode | Histogram Area | Data Structures

Largest Rectangle in Histogram Using Stack | LeetCode |Histogram Area | Stack | Data Structures

Largest Rectangle in Histogram Using Stack | LeetCode |Histogram Area | Stack | Data Structures

Largest Rectangle in Histogram | LeetCode | Brute Force | Histogram Area | Stack | Data Structures

Largest Rectangle in Histogram | LeetCode | Brute Force | Histogram Area | Stack | Data Structures

Check for Balanced Parentheses | STACK | Data Structures | Techies Code |

Check for Balanced Parentheses | STACK | Data Structures | Techies Code |

Stack Using Arrays | Stack Implementation | Build Your Own Stack Header File | Stack in C++

Stack Using Arrays | Stack Implementation | Build Your Own Stack Header File | Stack in C++

Introduction To Stacks in C++ | Stack STL(Standard Template Library) | Data Structures in C++

Introduction To Stacks in C++ | Stack STL(Standard Template Library) | Data Structures in C++

Introduction to Recursion in C++ | what is Recursion ? | Definition + Explanation + Code

Introduction to Recursion in C++ | what is Recursion ? | Definition + Explanation + Code

What are Data Structures and Algorithms? | Introduction to DSA (Data Structures and Algorithm )|

What are Data Structures and Algorithms? | Introduction to DSA (Data Structures and Algorithm )|

Null Pointers | NULL V/s nullptr | What are Null Pointers? | Pointers | C++ | Techies Code

Null Pointers | NULL V/s nullptr | What are Null Pointers? | Pointers | C++ | Techies Code

Install C++ Compiler | MinGW GCC | Set Up C++ Environment | Install Sublime Text Editor

Install C++ Compiler | MinGW GCC | Set Up C++ Environment | Install Sublime Text Editor

Count Sort | Logic + Code + Explanation | Sorting Algorithms | Techies Code

Count Sort | Logic + Code + Explanation | Sorting Algorithms | Techies Code

Insertion Sort || Animation + Logic + Code + Explanation || Sorting Algorithms || Techies Code ||

Insertion Sort || Animation + Logic + Code + Explanation || Sorting Algorithms || Techies Code ||

Key Present in Segment || Techies Code ||

Key Present in Segment || Techies Code ||

Shift Negative to Left || Techies Code ||

Shift Negative to Left || Techies Code ||

Pair Sum K || Techies Code ||

Pair Sum K || Techies Code ||

Operators in C++ || Techies Code ||

Operators in C++ || Techies Code ||

Getting Started with C++-2 🔥 🔥| Data Types | Identifiers | keywords | Data Modifiers | Techies Code

Getting Started with C++-2 🔥 🔥| Data Types | Identifiers | keywords | Data Modifiers | Techies Code

Getting Started with C++(Part-1)🔥 🔥| Hour Glass Puzzle | Variables | Working of Code | Techies Code

Getting Started with C++(Part-1)🔥 🔥| Hour Glass Puzzle | Variables | Working of Code | Techies Code

Avg using Array|| Techies Code ||

Avg using Array|| Techies Code ||

Spiral print || Techies Code ||

Spiral print || Techies Code ||

Wave Print || Techies Code ||

Wave Print || Techies Code ||

Binary Search || Techies Code ||

Binary Search || Techies Code ||

Linear Search || Techies Code ||

Linear Search || Techies Code ||

Print All Subarray || Techies Code ||

Print All Subarray || Techies Code ||

Subsequence V/s Subarray || Techies Code ||

Subsequence V/s Subarray || Techies Code ||

💡 Max Subarray Sum ️‍🔥 || Approach-1 Brute Force || Generating all Subarray || Techies Code ||

💡 Max Subarray Sum ️‍🔥 || Approach-1 Brute Force || Generating all Subarray || Techies Code ||

Time Complexity of Binary Search || Linear Search || Techies Code ||

Time Complexity of Binary Search || Linear Search || Techies Code ||

Array Introduction || Techies Code ||

Array Introduction || Techies Code ||

Kadane's Algorithm || Techies Code ||

Kadane's Algorithm || Techies Code ||

maxMin Value || Techies Code ||

maxMin Value || Techies Code ||

Function Overloading in C++ | How it works? | Invalid Overloading | Techies Code

Function Overloading in C++ | How it works? | Invalid Overloading | Techies Code

Pattern Printing - 1 || Techies Code ||

Pattern Printing - 1 || Techies Code ||

Everything about Functions in C++ | Function Prototypes | Call By Value/Reference | Type of Function

Everything about Functions in C++ | Function Prototypes | Call By Value/Reference | Type of Function

Ambiguity in Function Overloading | Errors in Function Overloading | Functions C++ | Techie's Code

Ambiguity in Function Overloading | Errors in Function Overloading | Functions C++ | Techie's Code

5. Using Array Name as Pointer || Pointer advance Notation || Array Name V/s Pointer || Techies Code

5. Using Array Name as Pointer || Pointer advance Notation || Array Name V/s Pointer || Techies Code

Scopes in C++ || Scope of Variables || Local and Global Scope || Techies Code ||

Scopes in C++ || Scope of Variables || Local and Global Scope || Techies Code ||

2. Types of Functions || Based on Return Value and Arguments || Techies Code ||

2. Types of Functions || Based on Return Value and Arguments || Techies Code ||

10. Dynamic Memory Allocation || Techies Code ||

10. Dynamic Memory Allocation || Techies Code ||

9.Void Pointer || Generic Pointer || Pointer Pointing to All Data Types || Techies Code ||

9.Void Pointer || Generic Pointer || Pointer Pointing to All Data Types || Techies Code ||

8. Pointer to Pointer || Double Pointer || Pointer chaining || Techies Code ||

8. Pointer to Pointer || Double Pointer || Pointer chaining || Techies Code ||

7. Type Conversions in Pointers || Question on Type Conversion in Pointers || Techies Code ||

7. Type Conversions in Pointers || Question on Type Conversion in Pointers || Techies Code ||

6.Pointer Pointing to diff. data types| Different type of Pointers| Why data type req. for Pointers?

6.Pointer Pointing to diff. data types| Different type of Pointers| Why data type req. for Pointers?

3. Pointer Arithmetic || Pointer Addition/ Subtraction || Techies Code ||

3. Pointer Arithmetic || Pointer Addition/ Subtraction || Techies Code ||

4. Pointer and Arrays || Pointer Pointing to Array || Arrays using Pointers || Complete Explanation

4. Pointer and Arrays || Pointer Pointing to Array || Arrays using Pointers || Complete Explanation

2. Functions and Pointers | References and Pointers | Call by Reference using Pointers

2. Functions and Pointers | References and Pointers | Call by Reference using Pointers

1. Introduction to Pointers ‎️‍🔥‎️‍🔥 || Address of and Dereference Operators || Techies Code ||

1. Introduction to Pointers ‎️‍🔥‎️‍🔥 || Address of and Dereference Operators || Techies Code ||

Bubble Sort || Sorting Algorithm || Techies Code ||

Bubble Sort || Sorting Algorithm || Techies Code ||

Selection Sort || Sorting Algorithm ||Techies Code ||

Selection Sort || Sorting Algorithm ||Techies Code ||