@priyamannur
Software developer
Exploring..
Nothing here yet.
Feb 20, 2025 · 2 min read · Man I want to buy a cycle:( Okay so let’s see if a linked list has a cycle in the list. One way to do that is have a set and iterate the linked list iff there is any duplicity seen in the list Because every listNode has a different memory address, in...
Join discussionFeb 19, 2025 · 2 min read · Linked lists are basically arrays but dynamically allocated that means they may or may not be placed continuously. (Also they are my favourite, hence the blog). They are also unlike arrays dynamic in size that means you do not have to specify the amo...
Join discussionJul 19, 2024 · 2 min read · Breadth first search is used in graph algorithms for traversing through graph. It can be used to sort the graph, find cycles, solve mazes and sudokus. In this algorithm we traverse the neighbours of the nodes first and mark them down. We go on like t...
Join discussionJun 28, 2023 · 6 min read · Sorting is a method to arrange "items" in "certain ways". "Certain ways" can be ascending or descending and many. And "items" in terms of computer programming mean arrays ,strings etcetra. So to do that we have certain procedures. It isn't always tha...
Join discussion
Jun 17, 2023 · 5 min read · Yeah yeah I know it's difficult, trust me it is or atleast it was for me! I am absolutely an amateur if you find any mistakes maaf kar dena(forgive me in Hindi). So when I started my college in a tech branch , as an enthusiast I researched about this...
SSamruddhi commented