Django LeetCode Node.js JavaScript Fundamentals

🚀 #Day18 of My Learning Journey 💻 Today was focused on backend learning, DSA problem-solving, API development, and strengthening JavaScript fundamentals. 🔹 Django Continued learning Django by diving deeper into backend concepts and understanding application flow in more detail. 🔹 LeetCode – Valid Parentheses Normal Approach: Repeatedly remove valid pairs (), {}, and [] from the string until no more changes occur. Check if the final string is empty. Time Complexity: O(n²) Space Complexity: O(n) Optimal Approach: Use a stack to track opening brackets. For each closing bracket, check if it matches the top of the stack. Valid if the stack is empty at the end. Time Complexity: O(n) Space Complexity: O(n) 🔹 Node.js Learning & Practice Learned Node.js concepts and built filter and search APIs, focusing on query parameters and efficient data handling. 🔹 JavaScript – Basics to Advanced Revisited JavaScript from basics to advanced topics to strengthen logic, syntax, and real-world usage. 💡 Takeaway Combining DSA, backend APIs, and strong JavaScript fundamentals helps build scalable and reliable applications 🌱 Masai #Django #LeetCode #DSA #NodeJS #JavaScript #FrontendDevelopment #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day36 of My Learning Journey 💻 Today was focused on backend learning, DSA problem-solving, and strengthening full-stack skills. 🔹 Django Continued learning Django by going deeper into backend concepts and improving overall framework understanding. 🔹 LeetCode – Reverse Linked List Normal Approach: Traverse the linked list and store node values in an array. Reverse the array and rebuild the linked list. Time Complexity: O(n) Space Complexity: O(n) Optimal Approach: Reverse the linked list in place using three pointers (prev, curr, next). Update links while traversing the list once. Time Complexity: O(n) Space Complexity: O(1) 🔹 React & Node.js Learning Learned more about React and Node.js concepts to strengthen frontend–backend integration and application flow. 💡 Takeaway Understanding optimal solutions and consistently learning across the stack builds strong problem-solving and development confidence 🌱 Masai #Django #ReactJS #NodeJS #LeetCode #DSA #masai #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day36 of My Learning Journey 💻 Today was focused on deepening backend knowledge, practicing frontend logic, and strengthening JavaScript fundamentals. 🔹 Django Continued learning Django by reinforcing backend concepts and understanding how different components work together. 🔹 React Practice – Sorting & Filtering Solved React problems focused on sorting and filtering data, improving state management, conditional rendering, and performance handling. 🔹 JavaScript Revision Revised key JavaScript concepts to strengthen fundamentals and improve problem-solving clarity. 💡 Takeaway Working on real-world UI logic alongside backend learning helps build scalable and reliable applications 🌱 Masai #Django #ReactJS #JavaScript #masai #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day32 of My Learning Journey 💻 Today was focused on backend fundamentals, frontend learning, problem-solving, and UI improvements. 🔹 Django Learned about Django project structure and clearly understood the MVT (Model–View–Template) architecture, strengthening my backend foundation. 🔹 React Learning Continued learning React concepts to improve understanding of component flow and UI behavior. 🔹 LeetCode – Remove All Adjacent Duplicates in String Normal Approach: Repeatedly scan the string and remove adjacent duplicate characters. Continue until no duplicates remain. Time Complexity: O(n²) Space Complexity: O(n) Optimal Approach: Use a stack to process characters. If the current character matches the top of the stack, remove it; otherwise, push it. Build the final string from the stack. Time Complexity: O(n) Space Complexity: O(n) 🔹 React Application – Responsiveness Fix Improved responsiveness of React applications by fixing layout issues and enhancing the UI for different screen sizes. 💡 Takeaway Understanding architecture, writing optimized solutions, and refining UI together build strong full-stack skills 🌱 Masai #Django #ReactJS #LeetCode #DSA #masai #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day30 of My Learning Journey 💻 Today was focused on learning something new, problem-solving, revision, and hands-on React practice. 🔹 Django Started my Django journey by understanding the basics, project structure, and how Django handles requests and responses. 🔹 LeetCode – Valid Anagram Solved the Valid Anagram problem using two approaches: Normal Approach: Sort both strings and compare them. Time Complexity: O(n log n) Space Complexity: O(n) Optimal Approach: Use a hash map (frequency counter) to count characters. Compare counts for both strings. Time Complexity: O(n) Space Complexity: O(1) (since the alphabet size is constant) 🔹 JavaScript Revision Revised important JavaScript concepts to strengthen fundamentals and improve coding confidence. 🔹 React Application – User Profile Loader Built a React application that dynamically loads and displays user profile data, focusing on state management and component-based UI updates. 💡 Takeaway Learning new frameworks, revising fundamentals, and solving problems consistently is the best way to grow as a developer 🌱 Masai #Django #Python #LeetCode #DSA #JavaScript #masai #ReactJS #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day21 of My Learning Journey 💻 Today was focused on backend learning, DSA problem-solving, and hands-on frontend debugging. 🔹 Django Continued learning Django by strengthening backend concepts and improving understanding of application flow. 🔹 LeetCode – Sort Colors (Dutch National Flag) Normal Approach: Sort the array using a built-in sort or simple sorting algorithm. Time Complexity: O(n log n) Space Complexity: O(1) (in-place sort) Optimal Approach: Use the Dutch National Flag algorithm with three pointers (low, mid, high). Traverse the array once and place 0, 1, and 2 in correct positions. Time Complexity: O(n) Space Complexity: O(1) 🔹 React Application & Bug Fixing Built a React application and fixed bugs, focusing on debugging, state handling, and improving overall UI stability. 💡 Takeaway Learning optimized algorithms while debugging real applications helps build strong problem-solving and development skills 🌱 Masai #Django #ReactJS #LeetCode #DSA #BackendDevelopment #masai #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day20 of My Learning Journey 💻 Today was focused on full-stack development, backend API building, DSA problem-solving, and revising JavaScript fundamentals. 🔹 Django Continued learning Django by strengthening backend concepts and improving understanding of application flow. 🔹 React Full Application – CRUD Built a complete CRUD application in React, focusing on component structure, state management, and clean UI interactions. 🔹 Backend API Development Developed backend APIs to support the React application, strengthening the connection between frontend and backend. 🔹 LeetCode – Jump Game II Normal Approach: Use recursion or dynamic programming to try all possible jumps. Time Complexity: O(n²) Space Complexity: O(n) Optimal Approach: Use a greedy approach to track the farthest reachable index and count jumps. Time Complexity: O(n) Space Complexity: O(1) 🔹 JavaScript Revision Revisited important JavaScript concepts to reinforce fundamentals and improve coding clarity. 💡 Takeaway Building full-stack applications while practicing optimized DSA solutions helps develop real-world development skills 🌱 Masai #Django #ReactJS #JavaScript #LeetCode #DSA #BackendDevelopment #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day22 of My Learning Journey 💻 Today was focused on backend learning, DSA problem-solving, frontend application building, and strengthening JavaScript fundamentals. 🔹 Django Continued learning Django by strengthening backend concepts and gaining deeper clarity on application flow. 🔹 LeetCode – Remove Element Normal Approach: Create a new array and add elements that are not equal to the given value. Time Complexity: O(n) Space Complexity: O(n) Optimal Approach: Use the two-pointer technique to overwrite unwanted elements in the same array. Return the new length of the modified array. Time Complexity: O(n) Space Complexity: O(1) 🔹 React Application Development Built a React application, focusing on component structure, state management, and clean UI interactions. 🔹 JavaScript Learning Learned and revised JavaScript concepts to strengthen logic and frontend fundamentals. 💡 Takeaway Practicing optimized DSA solutions while building real applications helps develop strong and efficient coding skills 🌱 Masai #Django #ReactJS #JavaScript #LeetCode #DSA #BackendDevelopment #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day33 of My Learning Journey 💻 Today was focused on backend learning, DSA problem-solving, and building structured frontend UI components. 🔹 Django Continued learning Django by strengthening backend concepts and understanding how different parts of the framework work together. 🔹 LeetCode – Intersection of Two Arrays Normal Approach: Use nested loops to compare each element of one array with the other. Store unique matching elements in a result array. Time Complexity: O(n × m) Space Complexity: O(k) (for storing the result) Optimal Approach: Use a Set to store elements of one array. Traverse the second array and check presence in the set. Add matching elements to another set to maintain uniqueness. Time Complexity: O(n + m) Space Complexity: O(n) 🔹 React Application Development Built React components including: OTP Validation feature Navbar, Hero Section, and Footer Focused on component structure, state handling, and clean UI layout. 💡 Takeaway Combining backend learning, optimized problem-solving, and real UI building helps grow strong full-stack fundamentals 🌱 Masai #Django #ReactJS #LeetCode #DSA #masai #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai

🚀 #Day22 of My Learning Journey 💻 Today was focused on DSA problem-solving, backend learning with Django, building React applications, and exploring state management with Redux. 🔹 LeetCode – Pascal's Triangle II Problem (Brief Explanation): Given an integer rowIndex, return the rowIndex-th row of Pascal’s Triangle. Each number in Pascal’s Triangle is the sum of the two numbers directly above it. Brute Force Approach: Generate the entire Pascal’s Triangle up to the given row and return the required row. Time Complexity: O(n²) Space Complexity: O(n²) Optimal Approach: Compute the required row directly using the mathematical relation between elements (based on combinations) or build the row iteratively. Time Complexity: O(n) Space Complexity: O(n) 🔹 Django Learning Continued learning Django concepts to strengthen backend development and understand application structure. 🔹 React Application Development Built a React application focusing on component structure, state management, and dynamic UI behavior. 🔹 Redux Learning Learned Redux fundamentals and how it helps manage global state efficiently in larger React applications. 💡 Takeaway Combining algorithm practice with full-stack development concepts helps build stronger problem-solving and application development skills 🚀 Masai #DSA #LeetCode #ReactJS #Redux #Django #BackendDevelopment #dailylearning #100DaysOfCode #FullStackJourney #Masaiverse #Masai