Nothing Special   »   [go: up one dir, main page]
Skip to content

ak-py/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
.idea
.idea
 
 
week_1
week_1
 
 
week_2
week_2
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 
add_binary.py
add_binary.py
 
 
add_two_numbers.py
add_two_numbers.py
 
 
alien_dict.py
alien_dict.py
 
 
analyze_user_web_pattern.py
analyze_user_web_pattern.py
 
 
cheapest_flights_k_stops.py
cheapest_flights_k_stops.py
 
 
continous_subarray_sum.py
continous_subarray_sum.py
 
 
count_range_sum.py
count_range_sum.py
 
 
evaluate_division.py
evaluate_division.py
 
 
find_duplicate.py
find_duplicate.py
 
 
generate_parenthesis.py
generate_parenthesis.py
 
 
house_robber.py
house_robber.py
 
 
house_robber_ii.py
house_robber_ii.py
 
 
house_robber_iii.py
house_robber_iii.py
 
 
k_closest_points.py
k_closest_points.py
 
 
longest_palindromic_substring.py
longest_palindromic_substring.py
 
 
lru_cache.py
lru_cache.py
 
 
merge_intervals.py
merge_intervals.py
 
 
min_remove_invalid_paranthesis.py
min_remove_invalid_paranthesis.py
 
 
min_to_remove_valid_parenthesis.py
min_to_remove_valid_parenthesis.py
 
 
partition_labels.py
partition_labels.py
 
 
peeking_iterator.py
peeking_iterator.py
 
 
product_except_self.py
product_except_self.py
 
 
recover_bst.py
recover_bst.py
 
 
rotting_oranges.py
rotting_oranges.py
 
 
same_tree.py
same_tree.py
 
 
search_matrix.py
search_matrix.py
 
 
search_matrix_ii.py
search_matrix_ii.py
 
 
shortest_path_grid.py
shortest_path_grid.py
 
 
subarray_sum.py
subarray_sum.py
 
 
surrounded_regions.py
surrounded_regions.py
 
 
susbsets.py
susbsets.py
 
 
three_sum.py
three_sum.py
 
 
top_k_frequent.py
top_k_frequent.py
 
 
top_k_frequent_words.py
top_k_frequent_words.py
 
 
trapping_rain_water.py
trapping_rain_water.py
 
 
unique_paths_ii.py
unique_paths_ii.py
 
 
valid_palindrome_ii.py
valid_palindrome_ii.py
 
 
word_break.py
word_break.py
 
 
word_search.py
word_search.py
 
 

Repository files navigation

  • Extract keywords (Input constrains, Data types, Scale of input)
  • Classify the Problem
    • What are the algorithms commonly used on this kind of problems?
  • Paraphrase the question
  • Understand test cases / Ask for more test cases
    • Function Signature
  • Clarifications / Edge Cases
  • Trade Off Analysis

    • Brute Force Solution

      • Outline your approach

      • Space & Time Complexity *& ***(call stack) - specify variables

        (In what situations is the solution good? In what situations is the solution bad?)

      • Analyze Inefficiency

        Bottlenecks, Unnecessary Word, Duplication Work

    • Optimal Solution

      • Outline your approach
      • Space & Time Complexity *& ***(call stack) - specify variables
      • Compare it with Brute Force
      • Ask interviewer: "Does this sound like a good approach?"
  • Implementation, keep comparing optimal solution and brute force solution, explain why this solution is better to show your understanding
  • Verification
    • Scan through
    • Run test cases - small/medium sized, one more likely to detect errors

About

practice with popular leetcode problems

Topics

challenge leetcode preperation

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages