Picsart Academy’s Post

🚀 𝑫𝒂𝒚 58 𝒐𝒇 #100𝑫𝒂𝒚𝒔𝒐𝒇𝑳𝒆𝒂𝒓𝒏𝒊𝒏𝒈 🚀 𝐒𝐨𝐥𝐯𝐞𝐝 𝐨𝐧𝐞 𝐄𝐚𝐬𝐲 𝐨𝐟 𝐋𝐞𝐞𝐭𝐂𝐨𝐝𝐞 🌟 LeetCode 500. Detect Capital ✅ 𝐈𝐧𝐭𝐮𝐢𝐭𝐢𝐨𝐧 ⚡️ There are two possibilities, when first letter is capital and when first letter is small. There are two cases when first letter is capital i.e. word contains only capital letters and word contains only small letter except first character. There is only one case when first letter is small i.e. all small letters. 𝐀𝐩𝐩𝐫𝐨𝐚𝐜𝐡 🎗️ - We can divide this problem as first character and remaining characters of the word. Then simple if statements to catch false conditions and return true at last. 𝟭. We take two variables capital and small and initialize both to zero 𝟮. Iterating via whole array, we check for characters from a to z 𝟯. if found we increment small, otherwise increment capital 𝟰. Further we check for A to Z and 1 and 0 as base case and return true 𝟱. At last, we return false 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲 ❗️ 𝐓𝐢𝐦𝐞 𝐜𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(n) 𝐒𝐩𝐚𝐜𝐞 𝐜𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(1) Hope everyone finds the explanation helpful 🙌 #DSA #Technology #codinglife #code #Engineering

🪟🚀Exploring the Sliding window algorithm Is sliding window is just algorithm? How to utilize it in our Coding journey? Well it is important to know it is a problem solving technique that transforms two nested loops into one loop. It can reduce the time complexity to O(n). In our coding journey or we can say mastering Data Structure and Algorithms, we learn so many things. Most of them taking extra space and time which are very helpful, but we can also use many algorithms which are efficient in time and space both sense. When I first delved into this technique, it seemed challenging. But now, with a deeper understanding, I find it immensely valuable. Excited to share this knowledge with my #LinkedInFamily! 🌐📚 Attended a incredible workshop on an applied intro to Fixed-Sized Sliding window technique with leetcode solutions which is organized by ICodeGuru. Very thanks to our trainer @Muhmmad Ali. I am feeling grateful to be the part of this learning. We learn by solving leetcode questions. Leetcode 1876: Substrings of Size Three with Distinct Characters Leetcode 643. Maximum Average Subarray I Leetcode 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold Very grateful for our mentors sir Zafar Shahid, PhD , sir Rizwan Ghaffar for giving us this platform #IcodeGuru. I found this platform Thank you to our moderators sir Zubair Zafar , mam Hamna Dawood , Dure Amna Musaffa, for their consistent effort. #problemsolving #coding #dsajourney #codingcommunity https://lnkd.in/dfGhN3MU

In the landscape of software engineering, the development of parsers remains a cornerstone, critical for interpreting and processing the programming of languages that power the digital world. Despite the well-established theories underpinning parsing, the actual process of building parsers often treads a precarious path, mired in unpredictability and a trial-and-error approach. The Chisel Method attempts to turn the often chaotic process of building parsers into a streamlined, rule-based journey, ensuring reliability and efficiency. Whether you’re a seasoned developer or new to the field, by reading this article, you will learn how the Chisel Method attempts to turn the approach in parser construction, turning a complex process into an achievable, predictable task. Ready to revolutionize your parser development process and navigate the complexities with confidence? Read more: https://lnkd.in/dnMqR_NG #chiselmethod #strumentablog #parserdevelopment

In the landscape of software engineering, the development of parsers remains a cornerstone, critical for interpreting and processing the programming of languages that power the digital world. Despite the well-established theories underpinning parsing, the actual process of building parsers often treads a precarious path, mired in unpredictability and a trial-and-error approach. The Chisel Method attempts to turn the often chaotic process of building parsers into a streamlined, rule-based journey, ensuring reliability and efficiency. Whether you’re a seasoned developer or new to the field, by reading this article, you will learn how the Chisel Method attempts to turn the approach in parser construction, turning a complex process into an achievable, predictable task. Ready to revolutionize your parser development process and navigate the complexities with confidence? Read more: https://lnkd.in/dv6AuWFZ #chiselmethod #strumentablog #parserdevelopment

Today, on the fifth day of my 100 Days Problem-Solving Challenge, I delved into the world of arrays to calculate the product of its elements. 🧮 As I continue this journey, I'm not just writing code; I'm crafting solutions. Join me in this exhilarating quest of mastering the art of problem-solving! 💻✨ #100DaysOfCode #ProblemSolving #CodeChallenge #ProgrammingJourney https://lnkd.in/dpSgU6Sg

Day 28 of Leetcode Daily Code Challenge (28/01/2024) Solved the question "Number of Submatrices that Sum to Target" using the concept of prefix sums. Extremely interesting optimization from 2D prefix sum to 1D prefix sums. Problem: https://lnkd.in/dcmyygd9 Solution: https://lnkd.in/dSdQ3fpZ #leetcode #leetcodechallenge #dsa #dsachallenge

🚀 Leetcode Daily Challenge 📅 15th March 2024 Post Part-I (Problem Statement) Problem Statement: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation. Example 1: Input: nums = [1,2,3,4] Output: [24,12,8,6] Can you think about the solution 🤔? #dailycodingchallenge #leetcode #problemoftheday #programmers

𝐋𝐄𝐄𝐓𝐂𝐎𝐃𝐄 𝐖𝐄𝐄𝐊𝐋𝐘 𝐂𝐎𝐍𝐓𝐄𝐒𝐓 𝟑𝟗𝟐 : Solved 4/4 : Here's my approach for all the problems Question 1 : It's a simple brute force , just find the longest increasing / decreasing subarray. Question 2 : A greedy problem . Try with all possible characters starting from a to z and calculate the cost. If the cost stays within the constraint place that character at current position. Question 3 : It's a straight forward implementation . Sort the array first and check the current median position value . If its greater than k , replace the numbers to the left of current median which are greater than k, otherwise replace the numbers to the right of current median which are smaller than k. Question 4 : It's a fairly good question . Can be solved using DSU . Observation : If two nodes lies on same component its always better to take the entire bitwise and of all the weights which lies in this component. (Since performing 'bitwise and' the value will either remain same or gets decreased). We can maintain this weight in DSU. Finally check whether two nodes lie on same component , if yes get the entire bitwise and of all the weights else place -1. #leetcode #weeklycontest #coding #problemsolving #leetcodechallenge

Solving LeetCode: Understandable code means easier maintenance Now that the Roman numbers are over, it is time for real-life problems. How about recycling bottles? Some problems have many solutions that may put forward either readability or computational performance. Sometimes performance wins but code lines are cheap while brain power is expensive. My general approach is to write understandable, not shorter, code so that it is easier to maintain in the future. See below. https://lnkd.in/dzahzPb4 #leetcode

Code review / Critique: polaris-card-news - this is based on work in class to build a "polaris" style card that is for the presentation of news. Really cool how this student already had "date-chip" as an additional reusable piece. We work in class in a "open source" manner, meaning that large teams are espected to produce work individually, but the collective can share and remix work. In this instance, one person focused on the 'date-chip' as a stand alone piece of the project while others worked on the larger card. Then, they all shared in the date-chip and then shared ideas about how to implement the card piece most effectively. This instructional strategy: - lets them build more faster - feedback is from peers / remix - mimics industry approaches - you'd borrow pieces that already exist, always - learning is collaborative but work out put is STILL individual ('team' but without the dissolution of work output being done by like 1 person while others watch) https://lnkd.in/gG-2F5sn #edtechjoker #edu #education #pedagogy #edtech #brand #psu #pennstate #ist #webdev