BFS Problem Sets Part I
This wiki contains a couple of well-defined problems solved via Breadth First Search (BFS) traversal. The following points to be noted while solving traversal problem...
Page 5 of 11
This wiki contains a couple of well-defined problems solved via Breadth First Search (BFS) traversal. The following points to be noted while solving traversal problem...
This wiki contains a couple of well-defined problems solved via Binary Search algorithm. Median of two Sorted Arrays (65): Show solution double findMedian(...
This wiki contains a couple of well-defined problems solved via Binary Search algorithm. Search for a Range (61): Show solution int binSearch(vector<int...
Search is one of the first areas where LLMs got their industrial use. Currently, many organizations started looking into enhancing the user experience with search by i...
Recent large language models have opened a portal for different possibilities across domains. From a programmer perspective, it can provide a quick-fix recommendation,...
Union-find data structure is used extensively to solve problems associated with disjoint sets. Two sets are called disjoint sets if they don’t have any common elements...
In the last couple of blogs, we’ve learned a couple of different types of attacks on web applications. In this blog, we will learn about DoS attacks i.e. Denial of Ser...
In this blog, we will explore another type of attack on web applications: injection type attack. SQL Injection is one of the most well-known attacks due to the use of ...
Here in the blog post, we will learn about another type of attack, XML External Entity (XXE), which relies on an improperly configured XML parser on the application co...
In the last blog post, we started exploring web application security, where we explored cross-site scripting attacks. Here in this blog post, we will learn about anoth...