Interview Ready

Question 1

valid-anagram

Question 2

two-sum

Question 3

valid-palindrome

Answer 3

function isAlphanumeric(char) {
return /^[0-9a-zA-Z]+$/.test(char);
}

let formatted = s.toLowerCase().split(“”).filter(isAlphanumeric);

Question 4

best-time-to-buy-and-sell-stock

Answer 4

A) maxProfit = prices[i] - minPrice;

Question 5

valid-parentheses

Question 6

invert-binary-tree

Question 7

maximum-depth-of-binary-tree

Question 8

same-tree

Question 9

subtree-of-another-tree

Question 10

last-stone-weight

Answer 10

T

Question 11

missing-number

Question 12

group-anagrams

Question 13

top-k-frequent-elements

Question 14

product-of-array-except-self

Question 15

longest-consecutive-sequence

Question 16

3sum

Question 17

container-with-most-water

Question 18

longest-substring-without-repeating-characters

Question 19

longest-repeating-character-replacement

Question 20

find-minimum-in-rotated-sorted-array

Question 21

search-in-rotated-sorted-array

Question 22

reverse-linked-list

Question 23

merge-two-sorted-lists

Question 24

reorder-list

Question 25

remove-nth-node-from-end-of-list

Question 26

lowest-common-ancestor-of-a-binary-search-tree

Question 27

linked-list-cycle

Question 28

binary-tree-level-order-traversal

Question 29

validate-binary-search-tree

Question 30

kth-smallest-element-in-a-bst

Question 31

construct-binary-tree-from-preorder-and-inorder-traversal

Question 32

implement-trie-prefix-tree

Question 33

design-add-and-search-words-data-structure

Question 34

combination-sum

Question 35

word-search

Question 36

number-of-islands

Question 37

clone-graph

Question 38

pacific-atlantic-water-flow

Question 39

course-schedule

Question 40

house-robber

Question 41

longest-palindromic-substring

Question 42

palindromic-substrings

Question 43

decode-ways

Question 44

coin-change

Question 45

maximum-product-subarray

Question 46

word-break

Question 47

longest-increasing-subsequence

Question 48

unique-paths

Question 49

longest-common-subsequence

Question 50

maximum-subarray

Question 51

jump-game

Question 52

insert-interval

Question 53

merge-intervals

Question 54

non-overlapping-intervals

Question 55

meeting-rooms-ii

Question 56

rotate-image

Question 57

spiral-matrix

Question 58

set-matrix-zeroes

Question 59

sum-of-two-integers

Question 60

minimum-window-substring

Question 61

merge-k-sorted-lists

Question 62

binary-tree-maximum-path-sum

Question 63

serialize-and-deserialize-binary-tree

Question 64

word-search-ii

Question 65

find-median-from-data-stream

Question 66

min-cost-to-connect-all-points

Question 67

What is the Big O complexity of the Array.sort() method in Javascript?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer 67

D

Question 68

What is the time complexity of a Depth-First Search (DFS) algorithm on a graph with V vertices and E edges?

A) O(V)
B) O(E)
C) O(V + E)
D) O(V * E)

Answer 68

C) O(V + E)
The time complexity of Depth-First Search (DFS) on a graph with V vertices and E edges is typically O(V + E).

Question 69

What is the time complexity of a Breadth-First Search (BFS) algorithm on a graph with V vertices and E edges?

A) O(V)
B) O(E)
C) O(V + E)
D) O(V * E)

Answer 69

C) O(V + E)
The time complexity of Breadth-First Search (BFS) on a graph with V vertices and E edges is typically O(V + E).

Question 70

climbing-stairs

Question 71

What is the time complexity of Binary Search when searching for an element in a sorted array with n elements?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer 71

B) O(log n)

Binary Search has a time complexity of O(log n) when searching for an element in a sorted array with n elements.

Question 72

In which scenario should you consider using Topological Sort?

A) Calculating the shortest path in a weighted graph.
B) Finding the strongly connected components in a directed graph.
C) Detecting a cycle in an undirected graph.
D) Scheduling tasks with dependencies.

Answer 72

D) Scheduling tasks with dependencies.
Option C is incorrect because Topological Sort is not typically used for detecting cycles in undirected graphs. Instead, it is primarily used for directed acyclic graphs (DAGs).

Question 73

lru-cache