Skip to content

issues Search Results · repo:OmkarPathak/Data-Structures-using-Python language:"Jupyter Notebook"

Filter by

10 results
 (89 ms)

10 results

inOmkarPathak/Data-Structures-using-Python (press backspace or delete to remove)

Not int or float. I want to use class which is I defined. Plus, I don t use any list or dictionary type inside my class. class Array(object): sizeOfArray: denotes the total size of the array to ...
  • miseon119
  • Opened 
    on Jul 14, 2022
  • #56

@OmkarPathak, In the delete method in linkedlist.py the last element will be deleted if the given key is not present and if only the head node is present then there will a reference error for prev node. ...
  • bharathikannann
  • 1
  • Opened 
    on Jun 8, 2021
  • #52

#Array.ipynb file The array elements can be accessed in constant time by using the index of the parliculnr element as the subscript.
  • RakeshJarupula
  • 3
  • Opened 
    on Feb 21, 2020
  • #32

enqueue(): rear = (rear + 1)%size This logic is not implemented, the present circular queue behaves more or less like queue.
  • kgarg8
  • 2
  • Opened 
    on Nov 1, 2019
  • #30

Your code breaks when you try to call insertAtEnd when the list is empty.
  • kgarg8
  • 1
  • Opened 
    on Nov 1, 2019
  • #29

It would be nice to add a method to the BST class so that given an unsorted array of integers a balanced BST is constructed. I m not sure whether it is already in the repo but I have not been able to find ...
  • rostow
  • 2
  • Opened 
    on Oct 5, 2019
  • #19

want to add this circular doubly linked list program in python . do please assign me @OmkarPathak
  • robotjellyzone
  • Opened 
    on Oct 1, 2019
  • #15

Hi Omkar!! Firstly, thanks for this awesome repo. I was facing trouble with opening the Queue.ipynb file, please check the attached image. capture
  • JoyJulianGomes
  • 2
  • Opened 
    on Dec 21, 2018
  • #10

Hi Omkar, Append and Pop will add and remove the elements at the end of list. Queue follows first come first serve property(FIFO). consider the following example a = [] a.enqueue(1) # adding the element ...
  • gsundeep-tech
  • 2
  • Opened 
    on Apr 2, 2018
  • #2
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Press the
/
key to activate the search input again and adjust your query.
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Press the
/
key to activate the search input again and adjust your query.
Issue search results · GitHub