C++ and DSA Foundation Course Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course
Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course Transcript and Lesson Notes
How were the last three classes on sorting? We hope you are following the lectures regularly. In the series of sorting, today Urvi mam is going to cover a few problems based on the sorting algorithms covered so far. Are
Quick Summary
How were the last three classes on sorting? We hope you are following the lectures regularly. In the series of sorting, today Urvi mam is going to cover a few problems based on the sorting algorithms covered so far. Are
Key Takeaways
- Review the core idea: How were the last three classes on sorting? We hope you are following the lectures regularly. In the series of sorting, today Urvi mam is going to cover a few problems based on the sorting algorithms covered so far. Are
- Understand how Prefix Sums in 2D Arrays fits into Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course.
- Understand how problem solving fits into Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course.
- Understand how advance fits into Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course.
- Understand how C++ fits into Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course.
Key Concepts
Full Transcript
How were the last three classes on sorting? We hope you are following the lectures regularly. In the series of sorting, today Urvi mam is going to cover a few problems based on the sorting algorithms covered so far. Are we ready? See you in the class !! Are you finding the classes helpful? Stay tuned for more! Access the notes and assignments for this class for free at : ▶️https://pwskills.com/course/C++--Foundation PW Skills is announcing the launch of the following programs, Binary Batch:- Java-with-DSA-&-System-Design (Java with DSA & System Design) https://pwskills.com/course/Java-with-DSA-and-system-design (Hindi) https://pwskills.com/course/Java-with-DSA-and-System-Design (English) Sigma Batch:- Full-Stack-Web-Development (MERN Stack) https://pwskills.com/course/Full-Stack-web-development (Hindi) https://pwskills.com/course/Full-Stack-Web-Development (English) Impact Batch:- Data-Science-Masters (Full Stack Data Science) https://pwskills.com/course/Data-Science-masters (Hindi) https://pwskills.com/course/Data-Science-Masters (English) Website - https://pwskills.com/ Instagram - https://www.instagram.com/pwcollegewallah/ LinkedIn - https://www.linkedin.com/company/ineuron-ai https://www.linkedin.com/company/physicswallah/ Telegram - https://t.me/SkillsPW Discord - https://discord.gg/m7YSX6Xh Twitter - https://twitter.com/pw__skills TIME STAMPS: 00:00 - Introduction 00:23 - Recap 01:20 - Today's checklist 01:58 - Given an integer arr, move all 0s to the end of it while maintaining the relative order of the non-zero elements 04:19 - Solution discussion 17:13 - Code 20:46 - Dry run 27:44 - Given an array of names of fruits, sort it in the lexicographical order using selection sort. 29:56 - Solution discussion 37:02 - Code 42:42 - Summary #DSA #ProblemSolving #Lecture38 #Sorting #BasicProblems #DataStructures #CodingChallenges #Debugging #SortingAlgorithms #LogicalThinking #PWskills #CollegeWallah #PhysicsWallah
Lesson FAQs
What is Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course about?
How were the last three classes on sorting? We hope you are following the lectures regularly. In the series of sorting, today Urvi mam is going to cover a few problems based on the sorting algorithms covered so far. Are
What key concepts are covered in this lesson?
The lesson covers Prefix Sums in 2D Arrays, problem solving, advance, C++, arrays.
What should I learn before Problem Solving on Sorting Algorithms-1 | Lecture-38 | C++ and DSA Foundation course?
Review the previous lessons in C++ and DSA Foundation Course, then use the transcript and key concepts on this page to fill any gaps.
How can I practice after this lesson?
Practice by applying the main concepts: Prefix Sums in 2D Arrays, problem solving, advance, C++.
Does this lesson include a transcript?
Yes. The full transcript is visible on this page in indexable HTML sections.
Is this lesson free?
Yes. CourseHive lessons and courses are available to learn online for free.
Continue Learning
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
