* feat: add LeetCode problem 69
Here is the code for the problem 69 of leetcode as there are many ways to do it we programmers need to find the most optimal way to solve a problem statement so i used binary-search approach inorder to solve it.
All suggestions are accepted!!!
* Update 69.c
I have updated the solution according to the suggestions.
* Update 69.c
* Update 69.c
* Fix : memory allocation method
"new" is not used in C , because of that the compiler was giving compilation error.
Instead malloc was used for memory allocation.
* updating DIRECTORY.md
* Update data_structures/graphs/kruskal.c
Co-authored-by: Stepfen Shawn <m18824909883@163.com>
* updating DIRECTORY.md
---------
Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
Co-authored-by: Stepfen Shawn <m18824909883@163.com>
* feat: remove nth node from end of list (leetcode #19)
* fix: update the leetcode #19 solution to introduce node pointing to head
---------
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: add Letter combinations of phone book problem (#17)
* fix: add newline at the end of the file
* fix: add brief description of the algorithm
---------
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: add Longest Palindrome Substring solution
* fix: update formatting and allocate new results string
* fix: update formatting, fix bug related to the string copy
* fix: add parantheses for one line if statement
* fix: add comments for library inclusions
* feat: add LeetCode problem 540
* feat: Added a description to the LeetCode problem 540
* feat: Added details in the description of the LeetCode problem 540
* feat: Changed a word in @details of the LeetCode problem 540
* feat: add solution for the 3Sum Closest problem (#16)
* fix: Update formatting
* fix: update compare function to avoid overflow in generic case
* chore: apply suggestions from code review
---------
Co-authored-by: David Leal <halfpacho@gmail.com>
* add leetcode Verifying an Alien Dictionary
* updating DIRECTORY.md
* Update 953.c
add blank line at the end
---------
Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* add leetcode Binary Tree Maximum Path Sum
* Update leetcode/src/124.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* add leetcode Maximum Bags With Full Capacity of Rocks
* Update leetcode/src/2279.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update leetcode/src/2279.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update leetcode/src/2279.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* add leetcode Determine if Two Strings Are Close
* Update 1657.c
add comments
* Update leetcode/src/1657.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* add leetcode Frequency of the Most Frequent Element
* Update 1838.c
small fix
* Update leetcode/src/1838.c
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat:leetcode Delete the Middle Node of a Linked List solution (2095)
* Update README.md
* Update README.md
* Update DIRECTORY.md
Co-authored-by: David Leal <halfpacho@gmail.com>
* add leetcode Lowest Common Ancestor of a Binary Tree
* Update leetcode/src/236.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* fix function nam
* update struct name.
* add comments
* Update leetcode/src/236.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* add Number of Ways to Select Buildings
* Update 2222.c
add new line at the end
* Rename README.md to DIRECTORY.md
* Update leetcode/src/2222.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* fix review notes
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* add leetcode Maximum Erasure Value
* Update 1695.c
add new line at the end
* Rename README.md to DIRECTORY.md
* chore: apply suggestions from code review
* Update DIRECTORY.md
* Update leetcode/DIRECTORY.md
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
...Move All Balls to Each Box LeetCode problem.
* add Minimum Number of Operations to Move All Balls to Each Box leetcode
* chore: apply suggestions from code review
* Update leetcode/src/1769.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* add Maximize the Confusion of an Exam leetcode
* Update leetcode/src/2024.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* Update 2024.c
fix build
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* add Minimum Deletions to Make String Balanced
* Update 1653.c
add new line at the end
* Rename README.md to DIRECTORY.md
* chore: apply suggestions from code review
* Update leetcode/src/1653.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* Update leetcode/src/1653.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* Update leetcode/src/1653.c
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
* Update 1653.c
remove redundant define
* Update leetcode/src/1653.c
Co-authored-by: John Law <johnlaw.po@gmail.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
Co-authored-by: John Law <johnlaw.po@gmail.com>
