- Видео 489
- Просмотров 973 482
Programming Pathshala
Индия
Добавлен 17 дек 2019
Programming Pathshala's official RUclips channel. Here, you can find some learning videos curated by our experts.
5 Design Patterns to Learn Before Your Interview
Design Patterns in Low Level Design
So, what are design patterns? Do we need to learn them all?
Do they have categories?
Check out the best Low level Design course : renaissance.programmingpathshala.com/low-level-design
Connect : www.linkedin.com/in/vivekanand-vivek-7a4ab388/
#lld #designpatterns #lowleveldesign #softwareengineering
So, what are design patterns? Do we need to learn them all?
Do they have categories?
Check out the best Low level Design course : renaissance.programmingpathshala.com/low-level-design
Connect : www.linkedin.com/in/vivekanand-vivek-7a4ab388/
#lld #designpatterns #lowleveldesign #softwareengineering
Просмотров: 258
Видео
Dynamic Programming | Length of Longest Increasing Subsequence | L-111
Просмотров 121День назад
#dsa #course #problemsolving #faangcodinginterviewpreparation #dynamicprogramming #fullcourse In this video, we dive into solving the Length of Longest Increasing Subsequence (LIS) problem using Dynamic Programming . We start by clearly defining the problem and understanding what an increasing subsequence means. Next, we break down the dynamic programming approach step by step, explaining how t...
Dynamic Programming | Coin Change Problem | L-110
Просмотров 82День назад
#dsa #course #problemsolving #faangcodinginterviewpreparation #dynamicprogramming #fullcourse #coingchangeproblem Welcome to another exciting video in our Dynamic Programming (DP) series! In this tutorial, we dive deep into the Coin Change Problem, a classic and essential problem often encountered in programming interviews and algorithm studies. Whether you're preparing for coding challenges or...
Dynamic Programming | Rod Cutting Problem | L-109
Просмотров 19014 дней назад
#dsa #course #problemsolving #faangcodinginterviewpreparation #dynamicprogramming #fullcourse In this video, we explore the Rod Cutting Problem, a classic example in Dynamic Programming that focuses on maximizing profit by cutting a rod into pieces of varying lengths and selling them. We'll start by understanding the problem statement with real-world examples, then move on to solving it using a...
SOLID Principles Explained With Examples- System Design
Просмотров 40714 дней назад
Learn the SOLID principles in software development with this simple and clear explanation! This video breaks down each principle to help you improve your coding skills and design better software. Perfect for beginners! Complete RUclips Playlist on DSA : ruclips.net/video/Hu-EPelY7Yo/видео.html Full fledged Interview Preparation Course : renaissance.programmingpathshala.com/crack-coding-intervie...
Dynamic Programming | Find Maximum Sum of Subsequence Such That No 2 Elements Are Adjacent | L-108
Просмотров 12614 дней назад
#dsa #course #problemsolving #faangcodinginterviewpreparation #dynamicprogramming #fullcourse In this video, we will explore the Dynamic Programming (DP) approach to solve the problem of finding the maximum sum subsequence in an array where no two elements are adjacent. This problem is an excellent example of how to apply dynamic programming techniques to optimize solutions that involve constra...
Chandigarh University to Amazon | Bhoomika Breaks The Code
Просмотров 48514 дней назад
#amazoninterviewpreparation #amazon #engineeringjobs #computerscience #techjobs #faang #chandigarhuniversity #womenengineers Watch Bhoomika Bhardwaj's inspiring journey from a Tier-3 college to landing an SDE Internship at Amazon! Thanks to our Renaissance course, her hard work, and participation in HackOn, she turned her dreams into reality. A perfect example of how the right guidance and dete...
Dynamic Programming | Stairs Case Problem | L-107
Просмотров 7114 дней назад
Dynamic Programming | Stairs Case Problem | L-107
Understanding Dynamic Programming by Fibonacci Series | L-106
Просмотров 8514 дней назад
Understanding Dynamic Programming by Fibonacci Series | L-106
Dynamic Programming Introduction | Key Concepts and Techniques | L-105
Просмотров 43714 дней назад
Dynamic Programming Introduction | Key Concepts and Techniques | L-105
Graph | Cycle Detection in Undirected Graph | L-104
Просмотров 12914 дней назад
Graph | Cycle Detection in Undirected Graph | L-104
Graph | BFS on Graph(Breadth-First Search) | L-103
Просмотров 14014 дней назад
Graph | BFS on Graph(Breadth-First Search) | L-103
Perfect Roadmap For Low Level Design Interviews
Просмотров 57314 дней назад
Perfect Roadmap For Low Level Design Interviews
Graph | Count the No of Island | LeetCode - 200(Medium) | L-102
Просмотров 6421 день назад
Graph | Count the No of Island | LeetCode - 200(Medium) | L-102
Graph | DFS On Graph (Depth First Search ) | Count connected node of Graph | L-101
Просмотров 5521 день назад
Graph | DFS On Graph (Depth First Search ) | Count connected node of Graph | L-101
Graph | Representation of Graph | Adjacency List | Adjacency Matrix | L-100
Просмотров 9221 день назад
Graph | Representation of Graph | Adjacency List | Adjacency Matrix | L-100
Graph | Introduction to Graph | Master Graph Terminology | L-99
Просмотров 8521 день назад
Graph | Introduction to Graph | Master Graph Terminology | L-99
Backtracking | N-Queen Problem | LeetCode -51 (Hard Problem) | L-98
Просмотров 11421 день назад
Backtracking | N-Queen Problem | LeetCode -51 (Hard Problem) | L-98
Backtracking | Count Number of Different Path | Leet code - 980 (Hard Problem) | L-97
Просмотров 4821 день назад
Backtracking | Count Number of Different Path | Leet code - 980 (Hard Problem) | L-97
Backtracking | Rat in Maze Problem | L-96
Просмотров 5421 день назад
Backtracking | Rat in Maze Problem | L-96
Backtracking | Print all the Subset of Set | L-95
Просмотров 7528 дней назад
Backtracking | Print all the Subset of Set | L-95
Backtracking | Generate All Unique Permutations of a String with Duplicate Characters | L-94
Просмотров 9728 дней назад
Backtracking | Generate All Unique Permutations of a String with Duplicate Characters | L-94
Unlock Success in Low Level Design Interviews with Vivekanand Vivek
Просмотров 36528 дней назад
Unlock Success in Low Level Design Interviews with Vivekanand Vivek
Backtracking | Generate all Permutation of String | L-93
Просмотров 150Месяц назад
Backtracking | Generate all Permutation of String | L-93
Tree Data Structure | Check if a Given Binary Tree is a BST or NOT | L-92
Просмотров 95Месяц назад
Tree Data Structure | Check if a Given Binary Tree is a BST or NOT | L-92
Binary Search Tree | Create BST of Smallest Height | L-91
Просмотров 77Месяц назад
Binary Search Tree | Create BST of Smallest Height | L-91
Binary Search Tree | Print K-th Smallest Element in BST | LeetCode-230(Medium) | L-90
Просмотров 66Месяц назад
Binary Search Tree | Print K-th Smallest Element in BST | LeetCode-230(Medium) | L-90
Binary Search Tree | Delete in BST | Trees Data Structure | L-89
Просмотров 93Месяц назад
Binary Search Tree | Delete in BST | Trees Data Structure | L-89
Binary Search Tree (BST) | Search and Insert in BST | Trees Data Structure | L-88
Просмотров 162Месяц назад
Binary Search Tree (BST) | Search and Insert in BST | Trees Data Structure | L-88
From Accenture to Nutanix: How Sohail Cracked MTS Role with Programming Pathshala
Просмотров 429Месяц назад
From Accenture to Nutanix: How Sohail Cracked MTS Role with Programming Pathshala
I am working with javascript(node, react)since 3years due to my projects using that, and now is it wise to switch to java? I am just confused, because if I go to java now, can I try for java jobs which is having 3+ years experience?
@@johnnydepp3236 In any tech framework specific interview, what an interviewer ideally looks out for is your command and levels of depth in it. On top of that, there are few things that go common across all frameworks. If you’ve done some good projects using MERN and alongside that you also have a great understanding of Springboot and enough fluency in Java, then this switch should be possible. Infact, that’s how people switch across tech stacks.
@@ProgrammingPathshala okay, thank you. Does your course help us in providing in depth for cracking interviews? Or do we need to build some real time projects in the company?
@@johnnydepp3236 You will find amazing depth for sure 👍
Thank you for the idea.
Link to Register:- ruclips.net/user/livedXOuKgBx8LY?si=eEM8iuDrSXGWG0zd
Can send deatols syllabis and fee
@@rokkingrronak4464 programmingpathshala.com/tech-fellowship-program
Best video on topic
@@quantumgaming7 glad it helped ☺️
sir please make a playlist and add all dsa related video on that playlist
Thanks to the RUclips algorithm for recommending programming pathshala - it's exactly the kind of content I was looking for!!!
Where is the strategy?
check this ruclips.net/video/zKMU4H92JcI/видео.htmlsi=b74WxkrGb6e4c4-z
Congratulations bhumi👍
🎉🎉🎉🎉🎉
🎉🎉❤
Comment your answer & hear back from us.
Complete DSA Playlist:- ruclips.net/p/PL8ALCSKTY-0s-GPhNW-1kf1njUDx0il9o
Thanks for making the videos but there is a problem with the code, I have fixed it , you are not returning if a[m-1]!=a[m],when we should while(l<=h): m = l+h//2 if(a[m]>key): h = m - 1 elif a[m]<key: l = m + 1 else: if m == 0: return m elif a[m-1] != a[m]: return m else: return h - 1
every edge is not representing 2E . if you look at 1 it is connected to 3 elements . can you please explain that part at 10:16
Amazing explanation 🙌
excellent introduction of Graph
Bring complete dsa playlist. Playlist is not for beginners and is not structured 🙏🙏🙏
I think you should start the course from the beginning of the playlist. It is quite structured in my opinion
There r random questions of leet code
Subscribed 🎉
i really love backtracking
generally i never comment but this is really really good keep it up sir and soon you will got so many subscribers
literally excellent
enjoying backtracking, Best explained
Best explained, best dsa series for interview preparation. Please keep it up
Initially coding felt like a challenging puzzle, but after following this series, everything has fallen into place. I now understand every part of coding, making the process not only manageable but also really enjoyable.
Why dont u start dsa for beginners. Ur playlist contains random videos on dsa. Its not strctured.
I think you should start the course from the beginning of the playlist. It is quite structured in my opinion
Can i say that yours is the best LLD course out there in the market
Absolutely!!