Tech-Interview-Prep
Study Roadmap
Problem Coverage
Problem Index
Browse by Difficulty
Easy
Medium
Hard
Tech-Interview-Prep
Index
Index
A
|
B
|
C
|
D
|
F
|
G
|
H
|
I
|
L
|
M
|
N
|
P
|
R
|
S
|
T
|
W
|
Z
A
add() (tries__approach_1.Trie method)
add_child() (tries__approach_1.TrieNode method)
addBinary() (in module add_binary__approach_1)
addTwoNumbers() (in module add_two_numbers__approach_1)
appendleft() (lru_cache__approach_1.LinkedList method)
B
binary_search() (in module find_first_and_last_position_of_element_in_sorted_array__approach_1)
build_tree() (in module construct_binary_tree_from_preorder_and_inorder_traversal__approach_1)
buildTree() (in module construct_binary_tree_from_preorder_and_inorder_traversal__approach_1)
C
canCompleteCircuit() (in module gas_station__approach_1)
canConstruct() (in module ransom_note__approach_1)
canJump() (in module jump_game__approach_1)
check_subtrees() (in module symmetric_tree__approach_1)
climbStairs() (in module climbing_stairs__approach_1)
compare_collections() (in module subsets__approach_1)
containsNearbyDuplicate() (in module contains_duplicate_ii__approach_1)
convert() (in module zigzag_conversion__approach_1)
countAndSay() (in module count_and_say__approach_1)
countPrimes() (in module count_primes__approach_1)
counts() (in module intersection_of_two_arrays_ii__approach_1)
D
deleteNode() (in module delete_node_in_a_linked_list__approach_1)
descendant_strings() (tries__approach_1.TrieNode method)
divide() (in module divide_two_integers__approach_1)
F
firstUniqChar() (in module first_unique_character_in_a_string__approach_1)
fizzBuzz() (in module fizz_buzz__approach_1)
from_list() (add_two_numbers__approach_1.ListNode class method)
(delete_node_in_a_linked_list__approach_1.ListNode class method)
(intersection_of_two_linked_lists__approach_1.ListNode class method)
(invert_binary_tree__approach_1.TreeNode class method)
(linked_list_cycle__approach_1.ListNode class method)
(merge_k_sorted_lists__approach_1.ListNode class method)
(merge_two_sorted_lists__approach_1.ListNode class method)
(palindrome_linked_list__approach_1.ListNode class method)
(remove_nth_node_from_end_of_list__approach_1.ListNode class method)
(reverse_linked_list__approach_1.ListNode class method)
(sort_list__approach_1.ListNode class method)
G
gameOfLife() (in module game_of_life__approach_1)
generate() (in module pascals_triangle__approach_1)
generateParenthesis() (in module generate_parentheses__approach_1)
genParen() (in module generate_parentheses__approach_1)
get() (lru_cache__approach_1.LRUCache method)
get_child() (tries__approach_1.TrieNode method)
get_range_str() (in module summary_ranges__approach_1)
getBit() (in module bitwise_and_of_numbers_range__approach_1)
(in module single_number_ii__approach_1)
getIntersectionNode() (in module intersection_of_two_linked_lists__approach_1)
getRandom() (insert_delete_getrandom_o1__approach_1.RandomizedSet method)
getSubstringBounds() (in module longest_palindromic_substring__approach_1)
groupAnagrams() (in module group_anagrams__approach_1)
H
hasCycle() (in module linked_list_cycle__approach_1)
hIndex() (in module h_index__approach_1)
I
inorder() (construct_binary_tree_from_preorder_and_inorder_traversal__approach_1.TreeNode method)
inorderTraversal() (in module binary_tree_inorder_traversal__approach_1)
insert() (insert_delete_getrandom_o1__approach_1.RandomizedSet method)
intersect() (in module intersection_of_two_arrays_ii__approach_1)
intToRoman() (in module integer_to_roman__approach_1)
invertTree() (in module invert_binary_tree__approach_1)
is_valid() (in module valid_sudoku__approach_1)
isAnagram() (in module valid_anagram__approach_1)
isHappy() (in module happy_number__approach_1)
isIsomorphic() (in module isomorphic_strings__approach_1)
isPalindrome() (in module palindrome_linked_list__approach_1)
(in module palindrome_number__approach_1)
(in module valid_palindrome__two_pointers)
isPowerOfThree() (in module power_of_three__approach_1)
isSameTree() (in module same_tree__approach_1)
isSubsequence() (in module is_subsequence__approach_1)
isSymmetric() (in module symmetric_tree__approach_1)
isValid() (in module valid_parentheses__approach_1)
isValidSudoku() (in module valid_sudoku__approach_1)
L
lengthOfLastWord() (in module length_of_last_word__approach_1)
lengthOfLongestSubstring() (in module longest_substring_without_repeating_characters__approach_1)
letterCombinations() (in module letter_combinations_of_a_phone_number__approach_1)
levelOrder() (in module binary_tree_level_order_traversal__approach_1)
LinkedList (class in lru_cache__approach_1)
ListNode (class in add_two_numbers__approach_1)
(class in delete_node_in_a_linked_list__approach_1)
(class in intersection_of_two_linked_lists__approach_1)
(class in linked_list_cycle__approach_1)
(class in merge_k_sorted_lists__approach_1)
(class in merge_two_sorted_lists__approach_1)
(class in palindrome_linked_list__approach_1)
(class in remove_nth_node_from_end_of_list__approach_1)
(class in reverse_linked_list__approach_1)
(class in sort_list__approach_1)
longestCommonPrefix() (in module longest_common_prefix__approach_1)
longestPalindrome() (in module longest_palindromic_substring__approach_1)
longestPalindromeAtCenter() (in module longest_palindromic_substring__approach_1)
LRUCache (class in lru_cache__approach_1)
M
majorityElement() (in module majority_element__hash_map)
maxArea() (in module container_with_most_water__approach_1)
maxDepth() (in module maximum_depth_of_binary_tree__approach_1)
maxProfit() (in module best_time_to_buy_and_sell_stock__approach_1)
maxSubArray() (in module maximum_subarray__approach_1)
merge() (in module merge_intervals__approach_1)
(in module merge_sorted_array__approach_1)
merge_2_lists() (in module merge_two_sorted_lists__approach_1)
merge_k_lists() (in module merge_k_sorted_lists__approach_1)
minimum() (in module merge_two_sorted_lists__approach_1)
(in module sort_list__approach_1)
missingNumber() (in module missing_number__approach_1)
myAtoi() (in module string_to_integer_atoi__approach_1)
myPow() (in module powx_n__approach_1)
mySqrt() (in module sqrtx__approach_1)
N
Node (class in lru_cache__approach_1)
none_ref() (lru_cache__approach_1.Node method)
P
parentheses_match() (in module valid_parentheses__approach_1)
permutations() (in module permutations__approach_1)
plusOne() (in module plus_one__approach_1)
preorder() (construct_binary_tree_from_preorder_and_inorder_traversal__approach_1.TreeNode method)
productExceptSelf() (in module product_of_array_except_self__approach_1)
put() (lru_cache__approach_1.LRUCache method)
R
RandomizedSet (class in insert_delete_getrandom_o1__approach_1)
rangeBitwiseAnd() (in module bitwise_and_of_numbers_range__approach_1)
remove() (insert_delete_getrandom_o1__approach_1.RandomizedSet method)
(lru_cache__approach_1.LinkedList method)
removeDuplicates() (in module remove_duplicates_from_sorted_array_ii__approach_1)
removeElement() (in module remove_element__approach_1)
removeNthFromEnd() (in module remove_nth_node_from_end_of_list__approach_1)
reverse() (in module reverse_integer__approach_1)
reverseList() (in module reverse_linked_list__approach_1)
reverseString() (in module reverse_string__approach_1)
reverseWords() (in module reverse_words_in_a_string__approach_1)
roman_subnumeral() (in module integer_to_roman__approach_1)
roman_to_int() (in module roman_to_integer__approach_1)
rotate() (in module rotate_image__approach_1)
S
search() (in module search_in_rotated_sorted_array__approach_1)
searchRange() (in module find_first_and_last_position_of_element_in_sorted_array__approach_1)
setZeroes() (in module set_matrix_zeroes__approach_1)
singleNumber() (in module single_number_ii__approach_1)
sort_list() (in module sort_list__approach_1)
sortedArrayToBST() (in module convert_sorted_array_to_binary_search_tree__approach_1)
sortList() (in module sort_list__approach_1)
strings_starting_with() (tries__approach_1.Trie method)
strStr() (in module find_the_index_of_the_first_occurrence_in_a_string__approach_1)
subsets() (in module subsets__approach_1)
sum_of_square_of_digits() (in module happy_number__approach_1)
summaryRanges() (in module summary_ranges__approach_1)
T
threeSum() (in module p_3sum__approach_1)
to_list() (add_two_numbers__approach_1.ListNode method)
(remove_nth_node_from_end_of_list__approach_1.ListNode method)
(reverse_linked_list__approach_1.ListNode method)
too_large() (in module reverse_integer__approach_1)
tree2list() (in module convert_sorted_array_to_binary_search_tree__approach_1)
TreeNode (class in binary_tree_inorder_traversal__approach_1)
(class in binary_tree_level_order_traversal__approach_1)
(class in binary_tree_zigzag_level_order_traversal__approach_1)
(class in construct_binary_tree_from_preorder_and_inorder_traversal__approach_1)
(class in convert_sorted_array_to_binary_search_tree__approach_1)
(class in invert_binary_tree__approach_1)
(class in maximum_depth_of_binary_tree__approach_1)
(class in same_tree__approach_1)
(class in symmetric_tree__approach_1)
Trie (class in tries__approach_1)
TrieNode (class in tries__approach_1)
twoSum() (in module two_sum__hash_map)
(in module two_sum__two_pointer)
(in module two_sum_ii_input_array_is_sorted__approach_1)
W
wordPattern() (in module word_pattern__approach_1)
Z
zigzagLevelOrder() (in module binary_tree_zigzag_level_order_traversal__approach_1)