Understanding Cybersecurity, Types, and Examples – For Beginners
Want to be secured with your personal and professional data? Then every individual today has to have a basic idea of what cybersecurity is and how you can protect yourselves,…
New York Cyber Security Summit – Fri, Nov 18, 2022 – Virtual & In-person
The Tenth Annual New York Cyber Security Summit returns In-Person and Virtually Live-Streamed. It connects C-Suite & Senior Executives who are responsible for protecting their companies’ critical infrastructures with innovative solution providers and…
Why you need to know the internet, data encryption, SSL and TLS in today’s world
Good day everyone! I will be explaining why we need to understand the importance of the internet, data encryption and what exactly SSL and TLS are and why you need…
What is Phishing and What to do?
Are we safe? How can you make sure that you are not vulnerable to the scams which are increasing day after day? In this post, we will discuss about Phishing…
LeetCode – Strings – Make String Great
Given a string s of lower and upper case English letters. A good string is a string which doesn’t have two adjacent characters s[i] and s[i + 1] where: To make the string good, you can choose two…
LeetCode – Strings – Path Crossing
Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at the origin (0, 0) on a 2D plane and walk on the path…
LeetCode – Strings – Reformat Date
Given a date string in the form Day Month Year, where: Convert the date string to the format YYYY-MM-DD, where: Example 1: Input: date = "20th Oct 2052" Output: "2052-10-20" Example 2: Input: date…
LeetCode – Arrays – Last Stone Weight
We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppose the stones have weights x and y with x <= y. The result…
LeetCode – Arrays – Next Greater Element I
You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1‘s elements in the corresponding places of nums2. The Next Greater Number of a number x in nums1 is…
LeetCode – Stack – Remove All Adjacent Duplicates In String
Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make duplicate removals on S until we no longer can. Return the…