Skip to content

Add new problem to solve #3

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.

Sign up for GitHub

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

Open
ajesusflores wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add new problem to solve #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,7 @@ The project is a .NET Core application that includes code samples for some of th
* Given a string, find the longest subsequence consisting of a single character.
* Insert an int item in a sorted linkedlist so that list remains sorted.
* Remove duplicate ints from a sorted linkedlist.
* Invert a binary tree.


## Functions ##
Expand Down Expand Up @@ -50,4 +51,4 @@ The project is a .NET Core application that includes code samples for some of th

## Feedback ##

Please use [GitHub issues](https://github.com/jerrak0s/CsharpInterviewQuestions/issues) for bug reports and feature requests
Please use [GitHub issues](https://github.com/jerrak0s/CsharpInterviewQuestions/issues) for bug reports and feature requests