DSA Series Day 15: Evaluate Reverse Polish Notation in Java, Python and Rust
Day 15 of the Tekraze DSA series. Evaluate Reverse Polish Notation with a stack in O(n), with tested Java, Python and Rust code, tips and FAQs.
Day 15 of the Tekraze DSA series. Evaluate Reverse Polish Notation with a stack in O(n), with tested Java, Python and Rust code, tips and FAQs.
Day 14 of the Tekraze DSA series. Design a Min Stack with O(1) push, pop, top and getMin, with tested Java, Python and Rust code, tips and FAQs.
Day 13 of the Tekraze DSA series. Solve Valid Parentheses with a stack in O(n) time, with tested Java, Python and Rust code, tips and FAQs.
Day 12 of the Tekraze DSA series. Solve Minimum Window Substring with a sliding window in O(m + n) time, with tested Java, Python and Rust code and FAQs.
Day 11 of the Tekraze DSA series. Solve Longest Repeating Character Replacement with a sliding window in O(n) time, with tested Java, Python and Rust code and FAQs.
Day 10 of the Tekraze DSA series. Solve Longest Substring Without Repeating Characters with a sliding window in O(n) time, with tested Java, Python and Rust code, tips and FAQs.
Day 9 of the Tekraze DSA series. Solve Container With Most Water with two pointers in O(n) time, with tested Java, Python and Rust code, tips and FAQs.
Day 7 of the Tekraze DSA series. Solve Two Sum II on a sorted array with two pointers in O(n) time and O(1) space, with tested Java, Python and Rust code, tips and FAQs.
Day 8 of the Tekraze DSA series. Solve 3Sum with sorting and two pointers in O(n²) time, with tested Java, Python and Rust code, duplicate skipping tips and FAQs.
Day 6 of the Tekraze DSA series. Solve Valid Palindrome with the two pointer pattern in O(n) time and O(1) space, with tested Java, Python and Rust code, tips and FAQs.
A hack sheet for the Tekraze DSA series. Learn arrays, linked lists, stacks, queues, hash maps, trees, heaps, graphs and tries with visuals, a Big O cheat table, a decision table and tested Java, Python and Rust code.
Day 5 of the Tekraze DSA series. Solve Group Anagrams with a hash map, from a sorted key to a letter count key, with tested Java, Python and Rust code, tips and FAQs.