Sonar’s Post

👉 If you're in the Charlotte, NC area, join us this Wednesday AM for the Charlotte Metro ISSA monthly meeting! Deepfactor CTO and Founder, Mike Larkin, will lead a 90-minute, hands-on workshop: “Vulnerability Reachability Analysis Using OSS Tools.” Planned learnings include: ➕ Understand what vulnerability reachability is and why it is important ➕ Compare/contrast the two main ways of understanding reachability (static call graphs and runtime analysis) 🔸 Via hands-on experience, use both types of tools against real applications with real vulnerabilities. Interpreted languages (Java) and compiled languages (C/C++/Go) will be covered. ➕ Learn how to interpret the results obtained from the exercises and draw conclusions 🔗 Add'l info and register link in comments! See you there! 🚀 #CTO #AppSec #ISSACharlotte

👉 If you're in the Charlotte, NC area, we hope you join us tomorrow AM for the Charlotte Metro ISSA monthly meeting! Deepfactor CTO and Founder, Mike Larkin, will lead a 90-minute, hands-on workshop: “Vulnerability Reachability Analysis Using OSS Tools.” Planned learnings include: ➕ Understand what vulnerability reachability is and why it is important ➕ Compare/contrast the two main ways of understanding reachability (static call graphs and runtime analysis) 🔸 Via hands-on experience, use both types of tools against real applications with real vulnerabilities. Interpreted languages (Java) and compiled languages (C/C++/Go) will be covered. ➕ Learn how to interpret the results obtained from the exercises and draw conclusions 🔗 Add'l info and register link in comments! See you there! 🚀 #CTO #AppSec #ISSACharlotte

As #DigitalTransformation accelerates, the decision between #lowcode and traditional development approaches has grown critical for IT leaders and their teams. Watch this on-demand webinar from #OutSystems to learn about low-code development and how it delivers a competitive advantage over traditional #coding methods. http://outs.so/F10BD0 #t4s #OutsystemsPartner #ModernApplicationPlatform #AdviseBuildManage #AppDev #WebandMobileAppDevelopment #LowCode #CodeExtensibility #EasyIntegration #Security

#Technology can make us look current in an instance. Takes a long time for Common sense to boot in. Common sense takes years to seep in, to create an updated version. #commonsense is not a patch but a totally different #code. Not a good idea to turn off commonsense updates.

#Day95 of #100daysofcodechallenge Problem Statement: https://lnkd.in/ggMjdVep Solution: https://lnkd.in/gUqhm6S4 #CodeToInspire #KeepCoding #ProgressNotPerfection

CodeForces Round 933 (Div 3) Question A : Simple brute force consider each pair and if the count is less than equals k increment counter. Question B : It follows a pattern of 1 2 1.Starting from index 0 subtract the consecutive 3 elements in this form until the 1st element of the 3 elements become 0 when reach end of index and all are zero print yes else while iterating whenever the element becomes negative give output no. Question C : We need to eliminate the substring 'pie' ans 'map' from the string.Whenever we encounter such string eliminate middle char will result in minimum deletion. Question D : Implemented DP but got tle.Upsolved it just when we encounter '?' we will be having 2 option either clockwise or anticlockwise and we need only unique number so implementing set will work.Iterating all the possible number we get to in ith iteration and storing the next number in set2 according to choice either clockwise,anticlockwise or both and copying it all in set1. #cpp #cp #coding #codeforces

Day 45: Implementing JWT authentication in Express for secure user management & protecting sensitive endpoints! 🔒 #FullStackChallenge #JWT #Coding #HarahalGaikwad #FullStack

Alhamdulillah, I have solved 6 out of 8 problems codeforces round-970 (Div-3). My rank - 2058 out of 41k+ contestent.  Here is my some approaches: Problem A: We can approach this problem by observing the following: If the number of ones is odd, it is impossible to reduce it to zero. If the number of ones is zero and the number of twos is odd, it is also impossible to reduce it to zero. Otherwise, in all other cases, it is possible to reduce the number of ones and twos to zero. Problem B: This is primarily an implementation problem. We first check if the given number nnn is a perfect square. Then, we can create a 2D array or vector and verify whether the conditions are satisfied. Problem C: This is a binary search problem. We search for the answer by checking if the length is possible within the given bounds. The bound can be checked using the formula: l+((mid - 1) * mid)/2 ≤r. Problem D: This problem involves finding a cycle. We first identify the loop size and the nodes in the cycle. The answer for each node is the number of black counts. Finally, we create an answer array accordingly and print it.

The Java OpenWire protocol marshaller is vulnerable to Remote Code Execution. This vulnerability may allow a remote attacker with network access to either a Java-based OpenWire broker or client to run arbitrary shell commands by manipulating serialized class types in the OpenWire protocol to cause either the client or the broker (respectively) to instantiate any class on the classpath. #cyberdefenders

testaug5threads