Interview Questions and Answers

The average and best-case time complexity is O(n log n), while the worst case is O(n^2).

Dynamic programming is a method for solving complex problems by breaking them down into simpler overlapping subproblems and solving each subproblem only once, storing the solutions to subproblems to avoid redundant computations.

A hash table is a data structure that uses a hash function to map keys to indices in an array. It allows for efficient insertion, deletion, and retrieval of data. Collisions can be resolved using techniques like chaining or open addressing.

Greedy algorithms make locally optimal choices at each stage with the hope of finding a global optimum, while dynamic programming involves solving subproblems and combining their solutions to solve the overall problem.

The Floyd-Warshall algorithm is used for finding the shortest paths between all pairs of vertices in a weighted graph, even if the graph contains negative weight edges.

A* (A-star) is a pathfinding algorithm that uses a combination of the cost to reach a node and an estimate of the cost to reach the goal from that node. It prioritizes nodes with lower total cost.

A trie is a tree-like data structure that is used to store a dynamic set or associative array where keys are usually strings. It allows for efficient insertion, deletion, and lookup operations.

Dijkstra's algorithm is used to find the shortest paths from a source vertex to all other vertices in a weighted graph. It works for graphs with non-negative edge weights.

Backtracking is a general algorithm for finding all (or some) solutions to computational problems, particularly constraint satisfaction problems. It incrementally builds candidates for solutions and abandons a candidate as soon as it determines it cannot be completed to a valid solution.

The Bellman-Ford algorithm is used to find the shortest paths from a source vertex to all other vertices in a weighted graph. It can handle graphs with negative weight edges, but it detects and reports negative weight cycles.

Topological sorting is an ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u comes before v in the ordering. It is used in scheduling and task sequencing.

The Rabin-Karp algorithm is a string-searching algorithm that efficiently finds the occurrence of a pattern within a text by using hashing. It checks for a match by comparing hash values of the pattern and substrings of the text.

Prim's algorithm is used to find the minimum spanning tree of a connected, undirected graph. It starts with an arbitrary node and adds the shortest edge at each step, avoiding cycles.

The Boyer-Moore algorithm is a string-searching algorithm that efficiently finds the occurrence of a pattern within a text. It uses a preprocessing step to skip portions of the text when mismatches occur.

Huffman coding is a compression algorithm that creates variable-length codes for characters based on their frequencies in the input. It produces prefix codes, ensuring that no code is a prefix of another.

Floyd's cycle-finding algorithm, also known as the Tortoise and the Hare algorithm, is used to detect cycles in a sequence, particularly in linked lists. It involves two pointers moving at different speeds.

Bresenham's line algorithm is used for drawing a line between two points in a grid. It efficiently determines the pixels to be illuminated by considering the slope of the line.

The Dutch National Flag problem is a sorting problem that involves arranging an array of objects (usually colors) into three partitions (red, white, and blue) such that objects of the same color are grouped together.

Boyer-Moore-Horspool is an improvement to the Boyer-Moore string-searching algorithm. It skips more characters in the text when a mismatch occurs, leading to faster searches.

K-means clustering is an unsupervised machine learning algorithm that partitions a dataset into k clusters. It minimizes the variance within each cluster and is commonly used in data analysis and image segmentation.

The Longest Common Subsequence is the longest sequence of characters that appear in the same order in two (or more) strings. It is used in bioinformatics, text comparison, and version control.

A Trie-based autocomplete system efficiently suggests word completions by traversing a trie data structure that stores a dictionary. It is commonly used in search engines and text editors.

A Minimum Spanning Tree is a tree that spans all the vertices in a connected, undirected graph with the minimum possible total edge weight. Algorithms like Kruskal's and Prim's are used to find MSTs.

The Floyd-Warshall algorithm is used for finding the shortest paths between all pairs of vertices in a weighted graph, even if the graph contains negative weight edges.

The Bellman-Ford algorithm is used to find the shortest paths from a source vertex to all other vertices in a weighted graph. It can handle graphs with negative weight edges, but it detects and reports negative weight cycles.