Канал: Codes Your Mind

Lecture 01: Version Control | Git and Github

Lecture 01: Version Control | Git and Github

How to install Code blocks | STL latest library | Set path

How to install Code blocks | STL latest library | Set path

Lecture 22 - Deque | STL in C++

Lecture 22 - Deque | STL in C++

Lecture 21 - stack and queue | STL in C++

Lecture 21 - stack and queue | STL in C++

Lecture 20 - unordered_map | STL in C++

Lecture 20 - unordered_map | STL in C++

Lecture 19 - unordered_set | STL in C++

Lecture 19 - unordered_set | STL in C++

Lecture 18 - memset() | STL in C++

Lecture 18 - memset() | STL in C++

Lecture 17 - Frequency of all elements in the array | STL in C++

Lecture 17 - Frequency of all elements in the array | STL in C++

Lecture 16 - map | STL in C++

Lecture 16 - map | STL in C++

Ada king | ADAKING | CodeChef July Long Challenge 2020

Ada king | ADAKING | CodeChef July Long Challenge 2020

Missing a Point | PTMSSNG | CodeChef July Long Challenge 2020

Missing a Point | PTMSSNG | CodeChef July Long Challenge 2020

Lecture 02.6 - Master Method | Time Complexity | Data Structure and Algorithms

Lecture 02.6 - Master Method | Time Complexity | Data Structure and Algorithms

Lecture 02.5 - Substitution Method | Time Complexity | Data Structure and Algorithms

Lecture 02.5 - Substitution Method | Time Complexity | Data Structure and Algorithms

Lecture 02.4 - Find the Time Complexity of Recursive Algorithms | Data Structure and Algorithms

Lecture 02.4 - Find the Time Complexity of Recursive Algorithms | Data Structure and Algorithms

Lecture 02.3 - Examples on Finding the Time Complexity | Data Structure and Algorithm

Lecture 02.3 - Examples on Finding the Time Complexity | Data Structure and Algorithm

Lecture 02.2 - Find the Time Complexity of Iterative Algorithm | Data Structure and Algorithms

Lecture 02.2 - Find the Time Complexity of Iterative Algorithm | Data Structure and Algorithms

Lecture 02.1 - Analysis of Algorithms | Data Structure and Algorithm

Lecture 02.1 - Analysis of Algorithms | Data Structure and Algorithm

Lecture 15 - Check if string has all unique characters | STL in C++

Lecture 15 - Check if string has all unique characters | STL in C++

Lecture 01 - Introduction to Data Structure | Data Structure and Algorithms

Lecture 01 - Introduction to Data Structure | Data Structure and Algorithms

Lecture 00 - Course Overview | Data Structure And Algorithms

Lecture 00 - Course Overview | Data Structure And Algorithms

Lecture 19 - Sum vs XOR ( Hackerrank ) | Bit Manipulation Tutorial

Lecture 19 - Sum vs XOR ( Hackerrank ) | Bit Manipulation Tutorial

Problem - Even Matrix ( EVENM ) | June Long Challenge 2020 | Codechef

Problem - Even Matrix ( EVENM ) | June Long Challenge 2020 | Codechef

Problem - Chef and String ( XYSTR ) | June Long Challenge 2020 | Codechef

Problem - Chef and String ( XYSTR ) | June Long Challenge 2020 | Codechef

Problem - Chef and Price Control ( PRICECON ) | June Long Challenge 2020 | Codechef

Problem - Chef and Price Control ( PRICECON ) | June Long Challenge 2020 | Codechef

Lecture 14 - set | STL in C++

Lecture 14 - set | STL in C++

Lecture 18 - Print all subsets of an array of k length | Bit Manipulation Tutorial

Lecture 18 - Print all subsets of an array of k length | Bit Manipulation Tutorial

Lecture 17 - Paying Up ( codechef ) | Bit Manipulation Tutorial

Lecture 17 - Paying Up ( codechef ) | Bit Manipulation Tutorial

Lecture 01 - Bitwise Operators | Bit Manipulation Tutorial

Lecture 01 - Bitwise Operators | Bit Manipulation Tutorial

Lecture 16 - Print all the subsets of an array | Bit Manipulation Tutorial

Lecture 16 - Print all the subsets of an array | Bit Manipulation Tutorial

Lecture 13 - Find the frequency of an element in sorted array in O(log N ) | STL in C++

Lecture 13 - Find the frequency of an element in sorted array in O(log N ) | STL in C++

Lecture 12 - lower_bound() & upper_bound() | STL in C++

Lecture 12 - lower_bound() & upper_bound() | STL in C++

Lecture 11 - Time Complexity of Vector's Basic Operations | STL in C++

Lecture 11 - Time Complexity of Vector's Basic Operations | STL in C++

Lecture 10 - Vector of Vector | STL in C++

Lecture 10 - Vector of Vector | STL in C++

Lecture 09 - Activity Selection Problem | STL in C++

Lecture 09 - Activity Selection Problem | STL in C++

Problem - Isolation Centers ( CORUS ) | May Long Challenge 2020 | Codechef

Problem - Isolation Centers ( CORUS ) | May Long Challenge 2020 | Codechef

Problem - Coronavirus Spread ( COVID19 ) | May Long Challenge 2020 | Codechef

Problem - Coronavirus Spread ( COVID19 ) | May Long Challenge 2020 | Codechef

Day 6 Problem - Majority Element (Voting Algorithm) | May LeetCoding Challenge | Interview Question

Day 6 Problem - Majority Element (Voting Algorithm) | May LeetCoding Challenge | Interview Question

Lecture 08 - Sort the Rectangle according to its Area | STL in C++

Lecture 08 - Sort the Rectangle according to its Area | STL in C++

Day 5 Problem - First Unique Character in a String | May LeetCoding Challenge

Day 5 Problem - First Unique Character in a String | May LeetCoding Challenge

Day 4 Problem - Number Complement | May LeetCoding Challenge

Day 4 Problem - Number Complement | May LeetCoding Challenge

Lecture 15 - Flip the all bits of a Positive Number | Bit Manipulation

Lecture 15 - Flip the all bits of a Positive Number | Bit Manipulation

Lecture 07 - Sort the element of the array according to their absolute value | STL in C++

Lecture 07 - Sort the element of the array according to their absolute value | STL in C++

Day 3 Problem - Ransom Note | May LeetCoding Challenge

Day 3 Problem - Ransom Note | May LeetCoding Challenge

Day 2 Problem - Jewels and Stones | May LeetCoding Challenge

Day 2 Problem - Jewels and Stones | May LeetCoding Challenge

Lecture 06 - Sort() with Comparator | STL in C++

Lecture 06 - Sort() with Comparator | STL in C++

Day 1 Problem - First Bad Version | May LeetCoding Challenge

Day 1 Problem - First Bad Version | May LeetCoding Challenge

Lecture 05 - Sort function | STL in C++

Lecture 05 - Sort function | STL in C++

Lecture 04 - Vector of pairs | STL in C++

Lecture 04 - Vector of pairs | STL in C++

Lecture 03 - Vector in C++ | STL in C++

Lecture 03 - Vector in C++ | STL in C++

Day 11 Problem - Diameter of Binary Tree | Leetcode 30 Days Challenge | Interview Problem

Day 11 Problem - Diameter of Binary Tree | Leetcode 30 Days Challenge | Interview Problem

Lecture 02 - Introduction Of Containers, Iterators and Algorithms | STL in C++

Lecture 02 - Introduction Of Containers, Iterators and Algorithms | STL in C++

Lecture 14 - Determining Numbers (Hackerearth) | Bit Manipulation | Amazon Interview Question

Lecture 14 - Determining Numbers (Hackerearth) | Bit Manipulation | Amazon Interview Question

Problem - Lift Requests (LIFTME) | April 2020 CookOff Codechef

Problem - Lift Requests (LIFTME) | April 2020 CookOff Codechef

Day 10 Problem - Min Stack | Leetcode 30 Days Challenge | Interview Question

Day 10 Problem - Min Stack | Leetcode 30 Days Challenge | Interview Question

Lecture 01 - Template | STL in C++

Lecture 01 - Template | STL in C++

Problem - Unit GCD | April 2020 Long Challenge

Problem - Unit GCD | April 2020 Long Challenge

Day 9 Problem - Backspace String Compare | Leetcode 30 Days Challenge

Day 9 Problem - Backspace String Compare | Leetcode 30 Days Challenge

Problem - Sell All the Cars | April 2020 Long Challenge

Problem - Sell All the Cars | April 2020 Long Challenge

Problem - COVID Pandemic and Long Queue | COVIDLQ | April Long Challenge

Problem - COVID Pandemic and Long Queue | COVIDLQ | April Long Challenge

Day 8 Problem - Middle of the linked list | Leetcode 30 Days Challenge | Interview Question

Day 8 Problem - Middle of the linked list | Leetcode 30 Days Challenge | Interview Question

Lecture 13 - Missing Number | Interview Question | Bit Manipulation

Lecture 13 - Missing Number | Interview Question | Bit Manipulation

Day 7 Problem - Counting Elements | Leetcode 30 Days Challenge

Day 7 Problem - Counting Elements | Leetcode 30 Days Challenge

Day 6 Problem - Group Anagrams | Leetcode 30 Days Challenge | Interview Question

Day 6 Problem - Group Anagrams | Leetcode 30 Days Challenge | Interview Question

Day 5 Problem - Buy and Sell the Stock II | Leetcode 30 Days Challenge | Interview Question

Day 5 Problem - Buy and Sell the Stock II | Leetcode 30 Days Challenge | Interview Question

Day 4 Problem - Move Zeroes | Leetcode 30 Days Challenge

Day 4 Problem - Move Zeroes | Leetcode 30 Days Challenge

Day 3 Problem - Maximum Subarray | Leetcode 30 Days Challenge | Interview Question

Day 3 Problem - Maximum Subarray | Leetcode 30 Days Challenge | Interview Question

Day 2 Problem - Happy Number | Leetcode 30 Days Challenge

Day 2 Problem - Happy Number | Leetcode 30 Days Challenge

Day 1 Problem - Single Number | Leetcode 30 Days Challenge | Interview Question

Day 1 Problem - Single Number | Leetcode 30 Days Challenge | Interview Question

Lecture 12 - Lonely Integer (Hackerrank) | Bit Manipulation

Lecture 12 - Lonely Integer (Hackerrank) | Bit Manipulation

Lecture 11 - XORSN (codechef) | Bit Manipulation

Lecture 11 - XORSN (codechef) | Bit Manipulation

Lecture 10 - XOR Properties | Bit Manipulation

Lecture 10 - XOR Properties | Bit Manipulation

Lecture 09 - Determine a number is power of 4 or not | Bit Manipulation | Leetcode

Lecture 09 - Determine a number is power of 4 or not | Bit Manipulation | Leetcode

Lecture 08 - Determine a number is power of 2 or not | Bit Manipulation | Leetcode

Lecture 08 - Determine a number is power of 2 or not | Bit Manipulation | Leetcode

Lecture 07 - Count the set bits in number | Bit Manipulation

Lecture 07 - Count the set bits in number | Bit Manipulation

Lecture 06 - Number of bits to represent a number 'n' | Bit Manipulation

Lecture 06 - Number of bits to represent a number 'n' | Bit Manipulation

Lecture 05 - Check the ith bit is set or not | Bit Manipulation

Lecture 05 - Check the ith bit is set or not | Bit Manipulation

Lecture 04 - Find the smallest number greater than ‘n’ with exactly 1 bit different in binary form.

Lecture 04 - Find the smallest number greater than ‘n’ with exactly 1 bit different in binary form.

Lecture 03 - How many ways you can convert a to b by applying bitwise OR on a | Bit Manipulation

Lecture 03 - How many ways you can convert a to b by applying bitwise OR on a | Bit Manipulation

Lecture 02 - Check a number is even or odd without using modulus(%) operator | Bit Manipulation

Lecture 02 - Check a number is even or odd without using modulus(%) operator | Bit Manipulation