Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

(possible_optimizations_and_improvement_of_complexities): shrinivas_kane #122

Closed
wants to merge 14 commits into from

Conversation

shrinivaskane
Copy link
Contributor

  1. Optimized Bubble Sort Code
  2. Added empty list and invalid index check for finding duplicates in an array
  3. Added input validation for reverse inplace
  4. Modified algorithm in Longest Dictionary word for keyword check to make it more reliable
  5. Added meaningful function names and comments to look and tell
  6. Removed unnecessary type conversion for numbers in English
  7. Used Localized stack instead of global stack for balancing symbols
  8. Edited comment to add meaningful info for balanced binary search tree
  9. Removed unwanted code and empty queue check for Circular Queue
  10. Used iterative solution to improve space complexity of the solution for Pallindrome
  11. Used iterative solution to improve space complexity of the solution for multiplication

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant