Philip Kayode, PHILSKAY’s Post

𝗟𝗲𝘁'𝘀 𝘀𝗶𝗺𝗽𝗹𝗶𝗳𝘆 𝗦𝗲𝗹𝗲𝗰𝘁𝗠𝗮𝗻𝘆 𝗶𝗻 𝘁𝗵𝗲 𝗼𝗯𝗷𝗲𝗰𝘁 𝗼𝗿𝗶𝗲𝗻𝘁𝗲𝗱 𝘄𝗮𝘆✈ It's a way I use to not forget the application. A number of farmers went to farm to pluck apples for a festival. I plucked 15 apples, you plucked about 20 apples and the other farmers plucked their numbers. Each of us all have a collection of apples we have plucked and we need to gather these apples to celebrate this festival. Then we need to perform the 𝐒𝐞𝐥𝐞𝐜𝐭𝐌𝐚𝐧𝐲 method, where all the farmers need to gather each collections of apples into a single collection. So our collections have been flattened to one. 𝐒𝐞𝐥𝐞𝐜𝐭𝐌𝐚𝐧𝐲 is a projection operator. If you find this post helpful, please repost🔁 to let others see. Follow me for more simplified contents. Reach out to Philip Kayode, PHILSKAY #softwareengineering #softwaredevelopment #csharp #dotnet

𝗟𝗲𝘁'𝘀 𝘀𝗶𝗺𝗽𝗹𝗶𝗳𝘆 𝗦𝗲𝗹𝗲𝗰𝘁𝗠𝗮𝗻𝘆 𝗶𝗻 𝘁𝗵𝗲 𝗼𝗯𝗷𝗲𝗰𝘁 𝗼𝗿𝗶𝗲𝗻𝘁𝗲𝗱 𝘄𝗮𝘆. It's a way I use to not forget the application. A number of farmers went to farm to pluck apples for a festival. I plucked 15 apples, you plucked about 20 apples and the other farmers plucked their numbers. Each of us all have a collection of apples we have plucked and we need to gather these apples to celebrate this festival. Then we need to perform the SelectMany method, where all the farmers need to gather each collections of apples into a single collection. So our collections have been flattened to one. SelectMany is a projection operator. If you find this post helpful, please repost🔁 to let others see. Follow me for more simplified contents. Reach out to Philip Kayode, PHILSKAY #softwareengineering #softwaredevelopment #csharp #dotnet

In Android, Content Providers are used to manage access to application data. Sometimes, these components contain vulnerabilities. To test your application components, you can use Drozer to scan your components: https://lnkd.in/ezsCEiVp #android #programming #security

Anyone know what the dinnerware in the picture is? It's that crazy, neon green plastic stuff, right? Wrong. My son & I spotted these in an antique store in Almonte, Ontario this year. At some point in the not-to-distant past someone decided it would be a great idea to dope glass with trace amounts of uranium & turn it into dinnerware. That green colour is actually the glassware *glowing*. As in radioactive glowing. There's another type of dinnerware that glows red - different radioactive material used. So apparently it's safe to be around this stuff. Just not safe to eat or drink off. Crazy world, right? — I'm Russell 🐿️. A long time engineer discovering new life as a first-time solopreneur. I build software delivery systems using Docker & Python automation that increase speed & reduce errors - saving money & improving profitability. #devops #continuousdelivery #softwaredevelopment #testdrivendevelopment #platformengineering

Drozer is a tool that allows you to scan Android applications for security vulnerabilities. Want to install Drozer for your penetration tests? Check out our tutorial here: https://lnkd.in/eyTTA-g9 Interested in learning Android penetration testing? Check out our full course at: https://lnkd.in/ex7Kh8NQ #android #programming #security

Study Hack: Highlight with multiple colors to find dates, characters, and formulas easier. Need to remove highlighted text? Cut a lemon in half and put some of the juice on a cotton swab. Run the swab over what you wish to remove and watch it disappear. #Study #Hacks #Highlight

*Day 7* of 100 days leetcode challenge Problem: Can place flowers ? Approach: Checking if a given number of flowers (n) can be placed in a flowerbed represented by a list without violating the rule that no two flowers can be adjacent. It iterates through the flowerbed, checking for empty spots (0) and ensuring that both the previous and next positions (if they exist) are also empty before placing a flower. If a flower is successfully placed, it increments a count and skips the next position to maintain the no-adjacency rule. The method returns True if n flowers can be placed; otherwise, it returns False. 

Day 75: Flower Placement and Valid Parentheses Today’s challenges involved array constraints and balancing parentheses. The first problem, "Can Place Flowers," required determining if it's possible to plant flowers in a flowerbed without violating spacing rules—an interesting array problem with conditional logic. The second, "Minimum Add to Make Parentheses Valid," was about counting the minimum number of parentheses that need to be added to make a string of parentheses valid—great practice for working with stacks and counting imbalances. Both tasks helped improve my logical thinking and array manipulation skills. Problem Links:- 605. Can Place Flowers:- https://lnkd.in/gV8mhuSZ 921. Minimum Add to Make Parentheses Valid:- https://lnkd.in/ghUZuuA8 Github:- https://lnkd.in/gjKwWR9k #100DaysOfCode #LeetCode #C++ #Day75 #CanPlaceFlowers #ValidParentheses #ProblemSolving #ArrayManipulation #StackProblems #TechLearning #KeepCoding #GrowthMindset

Today, I tackled Problem No. 185: Minimum Fountains in my DSA challenge. 🌿 Problem Overview:   The task was to determine the minimum number of fountains needed to cover a one-dimensional garden of length 'N'. Each fountain can water a certain range defined by an array that specifies how far each fountain can reach. Approach:   To solve this problem, I followed these steps:   1. **Coverage Calculation**: For each fountain at position 'i', I calculated the range it can cover using the formula:     - Start of coverage = max(0, i - ARR[i])     - End of coverage = min(N, i + ARR[i])   2. **Greedy Selection**: I employed a greedy approach to activate the minimum number of fountains. I iterated through the garden, always selecting the fountain that extends the coverage as far as possible. 3. **Result Compilation**: The total count of fountains activated was maintained and printed for each test case. Key Takeaways:   1. A greedy strategy is effective in minimizing the number of fountains needed while ensuring complete coverage of the garden.   2. This problem reinforces the importance of understanding range-based coverage and its application in real-world scenarios, such as optimizing resources. Personal Reflection:   Working through this problem enhanced my problem-solving skills and understanding of greedy algorithms. I'm excited to apply these concepts in future challenges! #DataStructures #Algorithms #GreedyAlgorithm #Coverage #DSAChallenge

Thinking about getting a pet snake? 🐍 Check out our guide comparing Corn Snakes and Ball Pythons to help you pick the perfect slithery friend! Click on the link below and learn about it: https://lnkd.in/dhszNFq4 #petsnake #cornsnake #ballpython #snakecare #reptileloversofinstagram #petguide #snakecomparison #easypets #reptilecare #petadvice