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

Adding Leet Code Problems 3 and 234 #107

Closed
wants to merge 1 commit into from

Conversation

Ruksina01
Copy link
Contributor

Longest Substring Without Repeating Characters:
Problem Statement: Find the length of the longest substring without repeating characters in a given string.

  • Complexity:
    Time Complexity: O(n)
    Space Complexity: O(1)

Palindrome Linked List
Problem Statement: Determine if a singly linked list is a palindrome.

  • Complexity:
    Time Complexity: O(n)
    Space Complexity: O(1)

Each solution is implemented in C++ and follows a clear and efficient approach to solve the respective problems.
Proper comments are included for clarity and understanding.

Copy link

Thank you for submitting your pull request! 🙌 We'll review it as soon as possible. In the meantime, please ensure that you star the repository and follow me in github,otherwise PR will not merged. If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊

@Ruksina01
Copy link
Contributor Author

hey @abhisek247767 , can you check my PR for leetcode problems?

@abhisek247767
Copy link
Owner

@Ruksina01 first raised issue then do PR . one things one problem one issue and one PR at a time. I hope you understand

@Ruksina01
Copy link
Contributor Author

@abhisek247767
I’ll cancel this PR and submit each problem individually.

@Ruksina01 Ruksina01 closed this Oct 19, 2024
@abhisek247767
Copy link
Owner

ok

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.

2 participants