All questions

Use Depth-First Search with a tracking mechanism for visited nodes. If a node is revisited during the same DFS traversal, a cycle exists. For example, in a graph with edges 1 -> 2 -> 3 -> 1, a cycle is detected.

A priority queue can be implemented using a heap where the highest (or lowest) priority element is always at the top. Operations include insert and extract-max (or extract-min). For example, in a max-heap, inserting 5 and 10 results in [10, 5].

Use dynamic programming to build a table where each cell represents the length of the longest common subsequence up to those indices. For example, for 'abcde' and 'aceb', the longest common subsequence is 'ace' with length 3.

Use Kadane's Algorithm to find the maximum sum. Initialize the maximum sum and current sum as the first element, then iterate through the array updating these values. For example, for [1, -2, 3, 4, -1], the maximum subarray sum is 7.

Use a min-heap of size K to keep track of the K largest elements. For each element, if it is larger than the smallest element in the heap, replace the smallest. For example, in [3, 2, 1, 5, 6, 4], the 2nd largest element is 5.

Use two pointers to traverse the linked lists. When one pointer reaches the end, move it to the start of the other list. Continue until both pointers meet. For example, if lists intersect at node with value 8, both pointers will eventually reach this node.

Use topological sorting to order nodes and then apply dynamic programming to find the longest path. For example, in a DAG with edges 1 -> 2, 1 -> 3, 2 -> 4, 3 -> 4, the longest path is 1 -> 2 -> 4 or 1 -> 3 -> 4.

Use a sliding window and hash maps to compare character counts. Slide the window across the string and check if the counts match. For example, in 'cbaebabacd' with pattern 'abc', the start indices of anagrams are 0 and 6.

Use BFS to explore the shortest path in an unweighted graph. Enqueue the starting node, then visit each neighbor while updating distances. For example, in a graph with edges (1 -> 2), (2 -> 3), (1 -> 3), the shortest path from 1 to 3 is 1 -> 3.

HTML5 is the fifth version of the HTML standard. It introduces new elements, attributes, and behaviors, enhancing the language's capability to create more dynamic and interactive web content. For example, `<article>` and `<section>` elements are used for better semantic structuring.

Semantic elements provide meaning to the web content, improving accessibility and SEO. Elements like `<header>`, `<footer>`, and `<article>` make the structure of web pages more understandable to both browsers and developers.

The `<section>` element represents a thematic grouping of content, typically with a heading. It's used to divide a webpage into logical sections. For instance, `<section>` can be used to group related content such as different articles or parts of a webpage.

The `<article>` element represents a self-contained piece of content that could be distributed independently. Examples include blog posts, news articles, or user comments. It should ideally contain a heading and content related to the heading.

The `<aside>` element is used for content that is tangentially related to the content around it, such as sidebars, pull quotes, or advertisements. It helps to separate supplementary content from the main content, improving page structure and accessibility.

The `<header>` element typically contains introductory content or navigational aids, like headings or logo. Conversely, the `<footer>` element usually contains metadata about the section it is in, such as copyright information or contact details.

The `<nav>` element is used to define a block of navigation links. It helps to group together navigational links, making it easier for users and search engines to identify the main navigation areas of a webpage.

`grid-template-areas` defines named grid areas within a grid container. It uses a string to assign names to specific grid cells. For example, `grid-template-areas: 'header header' 'sidebar content' 'footer footer';` creates a layout with named regions.

`justify-content` aligns flex items along the main axis. Values include `flex-start`, `flex-end`, `center`, `space-between`, and `space-around`. For example, `justify-content: space-between;` distributes items with equal space between them and no space at the ends.

`align-items` aligns flex items along the cross axis. Values include `flex-start`, `flex-end`, `center`, `baseline`, and `stretch`. For example, `align-items: center;` vertically centers items within the flex container.

Use `position: sticky;` along with `top`, `right`, `bottom`, or `left` to create a sticky element that toggles between `relative` and `fixed` positioning based on scroll position. For example, `position: sticky; top: 0;` keeps the element at the top of its container as you scroll.

CSS Grid Layout areas are named regions in a grid. Defined with `grid-template-areas`, they simplify the placement of grid items. For example, `grid-template-areas: 'header header' 'main sidebar' 'footer footer';` organizes content into distinct sections.

npm (Node Package Manager) is the default package manager for Node.js, used to manage packages and dependencies in Node.js projects. Example: npm install installs dependencies, and npm init initializes a new project with a package.json file to manage those dependencies.

ES modules allow you to use JavaScript's import/export syntax in Node.js. Example: In an ES module, you can import another module using 'import { func } from './module.js';' instead of using 'require'. Node.js supports ES modules natively from version 12 onwards.

Clustering allows Node.js to create child processes (workers) that share the same server port to handle multiple requests in parallel. This improves application performance by leveraging multi-core systems. Example: Using the cluster module to spawn worker processes for increased throughput.

The 'require' function is used to import modules in Node.js, following the CommonJS module system. Example: To import the 'fs' module, you use 'const fs = require('fs');' to access file system operations like reading or writing files.