Mar 9, 2025 ยท 2 min read ยท Here's a refined and visually structured version with better readability and organization: ๐ต๏ธ Reconnaissance ๐ Goal: ๐ The attacker gathers intelligence about the target to plan future attacks. Techniques: ๐ Open-Source Intelligence (OSINT) | ๐...
Join discussionMar 13, 2024 ยท 1 min read ยท Replacing: You can use replaceAll() method to use string method to use sentence change to use replaceAll() method void main() { String str = "hi kem cho?"; String rep; rep = str.replaceAll('hi', 'jeet'); print(rep); } Outp...
Join discussion
Jun 4, 2023 ยท 2 min read ยท Elasticsearch is a powerful search engine that allows you to index and search through large volumes of data quickly and efficiently. In this blog post, we will explore how to create an Elasticsearch index, populate it with documents, and perform sear...
Join discussion
May 30, 2023 ยท 1 min read ยท Topic: Searching Questions Successfully Completed: 1 1) Count More than n/k OccurencesEasy Count More than n/k Occurences Time Complexity : O(n + max) Space Complexity: O(max) QuestionInput: N = 8 arr[] = {3,1,2,2,1,2,3,3} k = 4 Output: 2 Explanatio...
Join discussion
May 25, 2023 ยท 1 min read ยท Topic: Searching Questions Successfully Completed: 1 1) Count 1's in a binary arrayEasy Count 1's in a binary array Time Complexity : O(log n) Space Complexity : O(1) QuestionInput: N = 8 arr[] = {1,1,1,1,1,0,0,0} Output: 5 Explanation: Number of 1'...
Join discussion
May 10, 2023 ยท 1 min read ยท Topic: Searching Questions Attempted: 2 1Searching an element in a sorted array2Search an Element in an array Questions Successfully Completed: 2 Searching an element in a sorted array Time Complexity : O(logn) Space Complexity : O(1) QuestionInput:...
Join discussion
Jul 18, 2022 ยท 2 min read ยท No one can deny that searching is a crucial part of our life. You can ask yourself how many times you google something per day? Yeah ๐ many... ๐ But the real question is how often you find yourself scrolling without hope, and sometimes you give up...
Join discussion
