Algorithms Problem Solving Series
This is part of my series on Algorithms Problem Solving Series, where I document posts about algorithms problems I solved.
This is live document and will be updated everytime I solve new problems.
Algorithms Problem Solving Series
- 001: Jewels and Stones
- 002: Ransom Note
- 003: Sum of nodes
- 004: Subtract product and sum
- 005: Cloned Binary Tree
- 006: Group the people
- 007: Equal Reversed Arrays
- 008: Reduce to zero
- 009: Even Number of Digits
- 010: Deepest Leaves Sum
- 011: Tree to greater sum
- 012: to Lower case
- 013: Balanced Strings
- 014: Number of Students
- 015: Destination City
- 016: Maximum 69 Number
- 017: Shuffle the array
- 018: Insert into Binary Search Tree
- 019: Construct Binary Search Tree from Preorder Traversal
- 020: Odd in Matrix
- 021: Sort the Matrix Diagonally
- 022: Discount for prices
- 023: Running Array Sum
- 024: Number of Good Pairs
- 025: Binary Tree Inorder Traversal
- 026: Can Reach End
- 027: Truncate Sentence
- 028: Minimum Operations
- 029: Check Permutation
- 030: Decode String
- 031: Decode the Message
- 032: Convert Sorted Array to Binary Search Tree
Have fun, keep learning, and always keep coding!