Recursion Problem Solving | Binary Strings, Parentheses, & More | C++ & DSA for FAANG - #22
DSA is not tough — it just needs consistency. Quitting won't get you your dream job, but showing up every day will
*Important Notes & Resources for Students*
1️⃣𝑁𝑜𝑡𝑒𝑠: https://www.linkedin.com/posts/khaiserkhanam_lecture-22-recursion-problems-activity-7342896272342716417-ol4r?utm_source=share&utm_medium=member_desktop&rcm=ACoAAEoMv9MBQKIuKt-ED1Bs4UUzhnBVZl4SOEU
2️⃣𝐴𝑙𝑙 𝑃𝑃𝑇𝑠 𝑎𝑛𝑑 𝑟𝑒𝑙𝑎𝑡𝑒𝑑 𝑑𝑜𝑐𝑢𝑚𝑒𝑛𝑡𝑠 𝑎𝑟𝑒 𝑎𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑜𝑛 𝐺𝑖𝑡𝐻𝑢𝑏: https://github.com/khaiserkhanam/DSA-Mastery-Course
✨LinkedIn: https://www.linkedin.com/in/khaiserkhanam/
✨Instagram: https://www.instagram.com/khaiserkhanam/
If you want to work on web development projects, I have an English channel dedicated to that — you can visit it anytime! https://www.youtube.com/@UCYSd3dDrcafIwGppPbSkq8w
*⏳TIMELINE*
00:00 - Introduction
00:29 - Generate All Binary Strings of Length N
24:36 - Count Ways to Climb Stairs
33:56 - Print All Balanced Parentheses Combinations
46:50 - Convert a Decimal Number to Binary Using Recursion
55:16 - Homework
55:38 - Count Number of Ways to Express N as Sum of 1, 3, and 4
01:03:00 - Count Number of Digits in a Number
01:08:51 - Sum of Digits of a Number
01:14:52 - [Homework] Product of Digits of a Number
01:15:44 - Reverse a Number Using Recursion
01:22:59 - Count Zeros in a Number
01:25:52 - Count Number of Times a Digit Occurs in a Number
01:26:37 - Check if a Number is a Power of 2 Using Recursion
01:32:47 - Print sum from 1 to n.
01:36:55 - Calculate nth Fibonacci number
*Related Tags*
C++ tutorial
Data Structures and Algorithms
DSA in C++
LeetCode solutions
FAANG interview preparation
C++ programming for beginners
DSA for placements
Coding interview questions
Learn C++ step by step
C++ basics
Advanced DSA problems
LeetCode problems explained
Coding interview preparation
FAANG coding questions
Competitive programming C++
C++ algorithms
DSA course
Placement preparation
Interview coding questions
C++ data structures
LeetCode daily challenge
DSA explained
C++ for interviews
C++ compilation process
Problem solving with C++
Coding rounds preparation
Arrays in C++
Linked list in C++
Binary trees in C++
Graph algorithms C++
Dynamic programming C++
Recursion in C++
Sorting algorithms C++
Searching algorithms C++
Stack and queue in C++
Hashing in C++
Two pointer technique
Sliding window technique
C++ STL tutorial
LeetCode beginner problems
LeetCode medium problems
LeetCode hard problems
Job interview preparation
Software engineer interview prep
Coding interview tips
Learn algorithms
Algorithmic thinking
Data structures basics
Top coding interview questions
FAANG preparation course
C++ programming language
Master Recursion
Видео Recursion Problem Solving | Binary Strings, Parentheses, & More | C++ & DSA for FAANG - #22 канала Coding Hunar
*Important Notes & Resources for Students*
1️⃣𝑁𝑜𝑡𝑒𝑠: https://www.linkedin.com/posts/khaiserkhanam_lecture-22-recursion-problems-activity-7342896272342716417-ol4r?utm_source=share&utm_medium=member_desktop&rcm=ACoAAEoMv9MBQKIuKt-ED1Bs4UUzhnBVZl4SOEU
2️⃣𝐴𝑙𝑙 𝑃𝑃𝑇𝑠 𝑎𝑛𝑑 𝑟𝑒𝑙𝑎𝑡𝑒𝑑 𝑑𝑜𝑐𝑢𝑚𝑒𝑛𝑡𝑠 𝑎𝑟𝑒 𝑎𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑜𝑛 𝐺𝑖𝑡𝐻𝑢𝑏: https://github.com/khaiserkhanam/DSA-Mastery-Course
✨LinkedIn: https://www.linkedin.com/in/khaiserkhanam/
✨Instagram: https://www.instagram.com/khaiserkhanam/
If you want to work on web development projects, I have an English channel dedicated to that — you can visit it anytime! https://www.youtube.com/@UCYSd3dDrcafIwGppPbSkq8w
*⏳TIMELINE*
00:00 - Introduction
00:29 - Generate All Binary Strings of Length N
24:36 - Count Ways to Climb Stairs
33:56 - Print All Balanced Parentheses Combinations
46:50 - Convert a Decimal Number to Binary Using Recursion
55:16 - Homework
55:38 - Count Number of Ways to Express N as Sum of 1, 3, and 4
01:03:00 - Count Number of Digits in a Number
01:08:51 - Sum of Digits of a Number
01:14:52 - [Homework] Product of Digits of a Number
01:15:44 - Reverse a Number Using Recursion
01:22:59 - Count Zeros in a Number
01:25:52 - Count Number of Times a Digit Occurs in a Number
01:26:37 - Check if a Number is a Power of 2 Using Recursion
01:32:47 - Print sum from 1 to n.
01:36:55 - Calculate nth Fibonacci number
*Related Tags*
C++ tutorial
Data Structures and Algorithms
DSA in C++
LeetCode solutions
FAANG interview preparation
C++ programming for beginners
DSA for placements
Coding interview questions
Learn C++ step by step
C++ basics
Advanced DSA problems
LeetCode problems explained
Coding interview preparation
FAANG coding questions
Competitive programming C++
C++ algorithms
DSA course
Placement preparation
Interview coding questions
C++ data structures
LeetCode daily challenge
DSA explained
C++ for interviews
C++ compilation process
Problem solving with C++
Coding rounds preparation
Arrays in C++
Linked list in C++
Binary trees in C++
Graph algorithms C++
Dynamic programming C++
Recursion in C++
Sorting algorithms C++
Searching algorithms C++
Stack and queue in C++
Hashing in C++
Two pointer technique
Sliding window technique
C++ STL tutorial
LeetCode beginner problems
LeetCode medium problems
LeetCode hard problems
Job interview preparation
Software engineer interview prep
Coding interview tips
Learn algorithms
Algorithmic thinking
Data structures basics
Top coding interview questions
FAANG preparation course
C++ programming language
Master Recursion
Видео Recursion Problem Solving | Binary Strings, Parentheses, & More | C++ & DSA for FAANG - #22 канала Coding Hunar
introduction to recursion recursion problems in C++ recursion practice C++ generate binary strings recursion balanced parentheses recursion decimal to binary recursion sum of digits recursion reverse number using recursion count digit frequency recursion recursion dry run recursion step by step Fibonacci recursion recursion logic building recursion coding questions recursion interview questions DSA recursion C++ recursion tutorial dsa DSA dsa khanam course c++
Комментарии отсутствуют
Информация о видео
23 июня 2025 г. 17:48:32
01:43:03
Другие видео канала