A collection of solutions for all problem statements on the AlgoExpert Coding Interview platform.

Home Page: https://github.com/das-jishu/algoexpert-data-structures-algorithms

License: MIT License

Python 100.00%

algoexpert algoexperts algorithms algorithms-and-data-structures code coding-challenges coding-interviews data-structures interview-preparation interview-questions problem-solving

algoexpert-data-structures-algorithms's Issues

Questions please!

Hey can someone please provide the questions as well? or inform where to find the questions without an algoexpert subscription?

Algoexpert

Can't see difficulty levels

Find Loop Task Explenation

I found the explenation to the excercise "Find Loop" (5th excercise of LinkedLists) not very clear. So I made this graph, hope it might help someone:

Please also upload questions?

Sum of two lists issue

algoexpert-data-structures-algorithms/Medium/sum-of-linked-lists.py

Line 11 in e47ba65

def sumOfLinkedLists(linkedListOne, linkedListTwo):

Attempting to test with below list pairs:

[9, 9, 9, 8, 9]
[1, 1, 1, 1, 1]
will most probably generate a resultant list of [0, 1, 1, 0, 1, 1] --> 011011 which violates the idea of summation.

You could try to reverse the list with O(n) instead and then sum the values with the traditional way (head --> tail but due to reverse this would be actually old tail --> old head).

Recommend Projects