Closed kodeflap closed 2 years ago
I would like to work on this issue ✌️
Do we have to write binary search as well as linear search?
Hello check out the milestone for this issue
@kodeflap For dfs and bfs, should the input be an adjacency list?
yes
More than adding commenting use KDoc commenting method so that it will be easy to generate the documentation of code.
@kodeflap Ok will take care of that 😇
@kodeflap Just wanted to confirm, what should the dfs return? Should it return a boolean indicating whether a target element is found or should it return an array representing the depth first traversal?
It should return boolean indicating the value because, I am planning to get visualization for the above algorithm so it will be better to return boolean.
Are there any more searches left to add?
I think it's almost over for search. You can work on other dsa concepts like array, stack, queue, tree etc. Algorithm. You just needed to raise a new issue about specific topic you are working😃
Can I contribute to this issue?
Can I contribute to this issue?
This issue is almost done 😅. But you can work on other DSA concepts just open a issue🙂
Check out it task You have to implement the search algorithms in Kotlin.