Rabobank’s Post

🚀 GeekStreak Day 20 Challenge: Conquering the Threshold Problem 🔥 Another exciting challenge tackled as I pushed forward in the #GeekStreak2024 powered by Deutsche Bank! Today's problem was all about arrays and thresholds. Given an array of positive integers and a threshold value k, the task was to break down each element into smaller integers such that each is less than or equal to k. The goal? To compute the total number of integers across all elements after this division. 💡 This problem tested my understanding of data structures and algorithms (DSA), particularly how to optimize solutions for real-world scenarios with threshold-based constraints. It was an excellent opportunity to apply mathematical thinking and logic to ensure efficient solutions. Excited for the next challenges as I continue to learn and grow! 🙌 #CodingChallenge #DSA #Java #ProblemSolving #GeekStreak #DeutscheBank #TechJourney

🌟 Day 19 of the #geekstreak2024 Challenge – Powered by Deutsche Bank 🚀Problem of the Day: Minimal Cost 🏔️Today's problem was an exciting one! Geek is standing on a series of stones, each with varying heights. The challenge was to help Geek minimize the total cost of jumping between stones while choosing the best path. With each jump, the cost is determined by the difference in height between the current stone and the next. Problem Details: Given an array arr[] representing the heights of the stones, and a number k representing the maximum number of stones Geek can jump at a time, we need to find the minimum total cost to reach the last stone. The cost of each jump is calculated as the absolute difference in height |hi - hj|. Example 1: Input: k = 3, arr[] = [10, 30, 40, 50, 20] Output: 30 Explanation: Geek follows the path 1 → 2 → 5. The total cost is |10 - 30| + |30 - 20| = 30. Example 2: Input: k = 1, arr[] = [10, 20, 10] Output: 20 Explanation: Geek follows the path 1 → 2 → 3. The total cost is |10 - 20| + |20 - 10| = 20. Key Challenge: The challenge was finding an efficient way to minimize the total cost while jumping across varying heights, using dynamic programming to ensure optimal performance with O(n*k) time complexity. ⚙️ What I Learned: 1. Reinforced the importance of dynamic programming for problems involving optimal paths. 2. Explored how to use absolute differences to determine cost functions. Gained insights into solving pathfinding problems with variable step sizes efficiently. A huge shoutout to GeeksforGeeks, Deutsche Bank, and Sandeep Jain Sir for powering this incredible challenge and consistently pushing us towards greater heights! Looking forward to solving more exciting problems in the days to come! 🔥💻 #java #dsa #geeksforgeeks GeeksforGeeks Deutsche Bank

🔗 Day 16 of the #geekstreak2024 Challenge – Powered by Deutsche Bank 🚀Today's challenge revolved around the intriguing problem of Palindrome Linked List 🌀. Participants had to determine if a given singly linked list reads the same forward and backward. This task combined linked list manipulation with algorithm optimization, resulting in a stimulating problem-solving experience! Key Challenge: - Maintaining O(n) time complexity while minimizing space usage to O(1) was crucial. - Utilizing a technique of reversing part of the list and comparing it against the original list proved to be an interesting approach. What I Learned: - Implemented linked list reversal and midpoint finding using a two-pointer technique. - Optimized space by avoiding extra data structures, enhancing the solution's efficiency. - Enhanced understanding of linked list operations without requiring additional memory. Huge shoutout to GeeksforGeeks and Sandeep Jain Sir for the constant inspiration, and to Deutsche Bank for powering this challenge. Every day presents an opportunity to hone problem-solving skills and progress! 💡 #day16 #PalindromeLinkedList #codingChallenges #linkedList #algorithmOptimization #DeutscheBank #geeksforGeeks #SandeepJain #techJourney #Java #problemSolving

🚀 Day 9 of the #geekstreak2024 – 21 Days POTD Challenge powered by Deutsche Bank! 🚀 Today's challenge involved reversing a string without altering the individual words, where the words are separated by dots. It was a great exercise in string manipulation and ensuring the correct word order! Tackling these daily problems has been a fun way to improve my problem-solving skills, and I’m looking forward to tomorrow’s challenge! 💡 GeeksforGeeks#Day9 #CodingChallenge #Java #ReverseString #geekstreak2024 #DeutscheBank #ProblemOfTheDay #CodingJourney

Time to learn from 50+ eminent speakers at the National Software Testing Conference 2024 in London on July 23rd-24th. Engage with leaders from Mastercard, JP Morgan Chase & more for insightful discussions. Learn more. https://lnkd.in/dTEykK9J #Event #EventAlert #technology #DailyDose #FollowUs #StayTuned #StayConnected #trending #trendingnow #trendingpost #explore #explorepage #TechDogs

🚀 Day 10 of the #geekstreak2024 – 21 Days POTD Challenge powered by Deutsche Bank! 🚀 Today's challenge was all about counting the number of buildings that can see the sunrise 🌅, given an array of building heights. It was a great opportunity to dive into array traversal and comparison logic to determine which buildings remain unobstructed by their taller neighbors. As the sun rises from the starting point of the array, only the taller buildings get a clear view! This challenge helped sharpen my problem-solving skills further, and I’m excited to see what tomorrow's challenge brings! 💡 GeeksforGeeks#Day10 #CodingChallenge #Java #SunriseBuildings #geekstreak2024 #DeutscheBank #ProblemOfTheDay #CodingJourney

Ready to master the essential skills for modern testers? Get ready to hear James Massa, Senior Executive Director of Software Engineering and Architecture, JPMorganChase., at #TestMuConf 2024 🔗 bit.ly/testmu_2024 As software complexity and AI-generated code proliferate, testers must evolve to tackle new challenges. James will dive into four critical areas: 🔎 Testing AI 🤖 Testing with AI 💰 Testing FinOps 📊 Testing Data Quality 🗓️ August 21 - 23, 2024 | 🧑💻 Free Virtual Conference #TestμConference #Conference #SoftwareTesting #TestAutomation

𝐈 𝐚𝐦 𝐞𝐱𝐜𝐢𝐭𝐞𝐝 𝐭𝐨 𝐬𝐡𝐚𝐫𝐞 𝐦𝐲 𝐫𝐞𝐜𝐞𝐧𝐭 𝐩𝐫𝐨𝐣𝐞𝐜𝐭 𝐰𝐡𝐞𝐫𝐞 𝐈 𝐝𝐞𝐯𝐞𝐥𝐨𝐩𝐞𝐝 𝐚 𝐜𝐨𝐦𝐩𝐫𝐞𝐡𝐞𝐧𝐬𝐢𝐯𝐞 𝐛𝐚𝐧𝐤 𝐚𝐜𝐜𝐨𝐮𝐧𝐭 𝐦𝐚𝐧𝐚𝐠𝐞𝐦𝐞𝐧𝐭 𝐬𝐲𝐬𝐭𝐞𝐦 𝐮𝐬𝐢𝐧𝐠 𝐉𝐚𝐯𝐚. This project was a deep dive into applying object-oriented programming principles to create a robust application capable of handling a variety of essential banking operations such as account creation, deposits, withdrawals, balance inquiries, and transaction history management. The system is designed with a focus on security, data integrity, and user experience, ensuring that each transaction is processed efficiently and accurately. Through this project, I was able to enhance my understanding of Java and its powerful capabilities in building scalable and maintainable software solutions. The experience also reinforced my ability to design and implement real-world applications that require precision and attention to detail, especially in managing sensitive financial data. I’m looking forward to applying these skills in future projects and continuing to explore the intersection of software development and financial technology.

2025 LOOKAHEAD - Danske Bank’s aims for ‘first-mover advantage’ in QA strategy Discussing an extensive software project with IBM in 2024, Henrik Hartvig Jensen says Danske Bank "aims to achieve first-mover advantage" https://lnkd.in/d7bUt2Pb #DanskeBank #IBM #SoftwareTesting #DigitalResilience #QAtesting #BankTech #QA

Day 18 of #𝗴𝗲𝗲𝗸𝘀𝘁𝗿𝗲𝗮𝗸𝟮𝟬𝟮𝟰, powered by Deutsche Bank! 🎒💡 𝗣𝗿𝗼𝗯𝗹𝗲𝗺: 𝗧𝗼𝘁𝗮𝗹 𝗖𝗼𝘂𝗻𝘁 🧮 Today's problem is straightforward but still interesting—you're given an array of positive integers and a threshold value, k. For each element in the array, divide it into the minimum number of smaller integers such that each divided integer is less than or equal to k. The challenge? Calculate the total number of these integers across the entire array! 🌟 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵: 𝗕𝗿𝘂𝘁𝗲 𝗙𝗼𝗿𝗰𝗲 (𝗕𝘂𝘁 𝗘𝗳𝗳𝗶𝗰𝗶𝗲𝗻𝘁!) 🚀 | 𝗧𝗖: O(n) Simply loop through each element in the array, divide it by k to determine how many parts you need, and add an extra count if there's any remainder. Pretty neat, right? 𝗧𝗶𝗽𝘀 & 𝗧𝗮𝗸𝗲𝗮𝘄𝗮𝘆𝘀: 📝 • Think of k as a maximum "package size" 🛍️—you're just trying to pack items into the smallest number of packages. • 𝗧𝗖 𝗢(𝗻) means you’re scanning the array once, making it super efficient for this kind of problem. #day18 #TotalCount #SimpleSolutions #ProblemSolving GeeksforGeeks #geekstreak2024 #java