datastructures Singly LinkedList implementation in JAVA 1) each element in a linked list is called a node. 2) It is similar to an array, each node in the linked list has the data part and a link to the next node. 3) linked lists have O(1) time complexity for insertion or dele... datastructuresjavajava Cycle in Linked list I’ll show three different ways in which we can detect if theres a loop in a Linked List. A set is an abstract data type that stores unique values, in this approach we loop the linked list while storing the values on the ... datastructuresdatastructures Reverse Lists, Add them, Reverse the sum and return the sum as a List I came around this problem while solving questions on leetcode. This is a very good problem of linked lists. Basically the problem says: You are given two linked lists, you have to add those lists by reversing them and a... linkedlistsdatastructuresjavaprogrammingprogramming What does "Big-O notation" mean anyway? If you are a programmer, chances are that you have stumbled over the term "Big-O notation". Big-O notation is used to specify the computational complexity of your program or data structure. In JavaScript you would implem... datastructurescomputersciencedatastructures Build Array from Permutation – Solution to LeetCode Problem Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an array of distinct integ... algorithmsdatastructuresleetcodeleetcode Let's Talk About Sets Baby... This can prove super helpful for finding out if something belongs to a set of values or if you need to figure out how many unique values exist in a a given set of data. First of all, how do we create a set? Well, to crea... setsdatastructuresjavascriptjavascript Your own array in JavaScript Next, we should get an item from the array at any index, so let's implement the get method that accepts the index as a parameter and returns the item or data at that particular index. The above method returns the item pr... programmingarraydatastructuresjavascriptjavascript Recursion - Data Structures and Algorithms In Data Structures and Algorithms Recursion is one of the first concept which is very important to understand, since it makes you think in cycles.Its like a fractal but it should have an end. Example Problems on Recursio... algorithmsdatastructurescareerbeginnersbeginners Applying tree traversal algorithms to DOM In this article we'll put those learnings to use for an n-ary tree i.e. DOM. We'll see how we can locate DOM elements using various CSS selectors without using inbuilt APIs like getElementById, getElementsByClassname or ... htmlalgorithmsdatastructuresjavascriptjavascript Data Structures in TypeScript - Hash Table A Hash table is a data structure with a highly efficient lookup, which store key values pairs. Each key is generated by a hash function based on the value being stored. Also, the hash table has to handle collisions that ... hashtabledatastructurestypescriptdatastructures System Design goal: efficient property reads from multiple sources Source (Layer) Sources can be property files, system properties, or they can be coming from a key-value store or database. Each added layer can retrieve data from a source. Rather than have source_s and _layer_s be the s... threadsafedatastructuresjavasystemdesignsystemdesign Data Structures: Bidirectional Map In computer science, a bidirectional map is an associative data structure in which the (key,value) pairs form a one-to-one correspondence. Also known as bijective map. It is not widely used data structure in web developm... oopalgorithmsdatastructurescomputerscienceoop String Hashing in C++ Today, we use hashing algorithm in data structures, cryptography, and searching etc. In this tutorial we will implement a string hashing algorithm in C++ and use it in a data structure called hash table. We shall use Pol... algorithmsdatastructurescppbeginnerscpp Understanding Java Memory Allocation: Stack vs. Heap Because all variables created on the stack are wiped forever when a method ends, the memory size of a Java stack is typically significantly smaller than that of a Java heap area. Unlike a Java stack, where memory is allo... heapdatastructuresjavastackjava Road to algorithm world Time complexity is a measure of how fast an algorithm runs, and it is expressed using notation. Space complexity is a measure of how much auxiliary memory an algorithm takes, and it is also expressed by using notation. B... algorithmsdatastructuresjavabigojava How to Implement a Stack in C# Why Would You Use a Stack? In fact, people use stacks all the time. When you hit the back button, it "pops" the most recent item off the stack and redirects the user there. Push is the insert functionality of the stack c... csharpdatastructuresdatastructures How to insert a node in a Circular Linked List? C++ A Circular Linked List is a variation of Linked List where the first and the last node are also linked to each other, forming a circle. In an ordinary Linked List, the next pointer of the last node points to NULL but in ... algorithmsprogrammingdatastructurescppcpp LeetCode WalkThru: 'Sqrt(x)' and 'Valid Perfect Square' Output is a positive integer; decimal points must be truncated (taken off). Since this is a math-based question, we can consider a wide slew of built in Math methods provided in JavaScript. Return the square root any pos... algorithmsjavascriptdatastructuresbeginnersbeginners How To Implement a Queue in C# We will be covering the queue data structure. You should use a queue data structure whenever you want to handle items in a first in, first out ( FIFO ) order. The two main operations of a queue are Enqueue and Dequeue. I... csharpdatastructuresdatastructures Introduction to Data Structures Lists contain multiple values in an ordered sequence. Values inside the lists are called items and are comma-separated.. List Methods - this method adds an item to the end of the list - ordering of items in a list Lists ... algorithmsdatastructuresbeginnersinterviewprepbeginners change "Polyon" to "Polygon" Thanks for all these suggestions. I am not going to accept the pull requests because all the changes were made to fullbook.md rather than the individual files. I have since removed the (automatically generated) fullback.... datastructures Taking PR's for fixing typos? I noticed a typo in 02_oop.md where diner should be dunder Sorry I have had this project so far on the back burner that I haven't had time to look at it. I think that typo got fixed. In general I welcome pull requests, b... datastructures Fix bug in removelast function of the linked list deque implementation Hi! I spotted: - An error in the removelast function of the linked list deque implementation. The function should be returning the current node's link's data, instead of current node's data. I verified this corrected beh... datastructures time for ith trial I thought about this for long and didn't get this, so I'm putting this. (I hope, I'm right.) time of the ith trial was being calculated with refrence to time before starting experiment. Thanks for your work and the feedb... datastructures Update 03_analysis.md duplicates7(L) should return True if L has any duplicates. The previous version did the opposite. Yes, you are right.... datastructures Update 10a_sorting.md It took me a while to parse this section, so I added some clarifying text and some clarifying comments to the code. Thanks for your efforts on this. Maybe we can find some better language here. I don't think the extra pr... datastructures

Singly LinkedList implementation in JAVA 1) each element in a linked list is called a node. 2) It is similar to an array, each node in the linked list has the data part and a link to the next node. 3) linked lists have O(1) time complexity for insertion or dele... datastructuresjavajava Cycle in Linked list I’ll show three different ways in which we can detect if theres a loop in a Linked List. A set is an abstract data type that stores unique values, in this approach we loop the linked list while storing the values on the ... datastructuresdatastructures Reverse Lists, Add them, Reverse the sum and return the sum as a List I came around this problem while solving questions on leetcode. This is a very good problem of linked lists. Basically the problem says: You are given two linked lists, you have to add those lists by reversing them and a... linkedlistsdatastructuresjavaprogrammingprogramming What does "Big-O notation" mean anyway? If you are a programmer, chances are that you have stumbled over the term "Big-O notation". Big-O notation is used to specify the computational complexity of your program or data structure. In JavaScript you would implem... datastructurescomputersciencedatastructures Build Array from Permutation – Solution to LeetCode Problem Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an array of distinct integ... algorithmsdatastructuresleetcodeleetcode Let's Talk About Sets Baby... This can prove super helpful for finding out if something belongs to a set of values or if you need to figure out how many unique values exist in a a given set of data. First of all, how do we create a set? Well, to crea... setsdatastructuresjavascriptjavascript Your own array in JavaScript Next, we should get an item from the array at any index, so let's implement the get method that accepts the index as a parameter and returns the item or data at that particular index. The above method returns the item pr... programmingarraydatastructuresjavascriptjavascript Recursion - Data Structures and Algorithms In Data Structures and Algorithms Recursion is one of the first concept which is very important to understand, since it makes you think in cycles.Its like a fractal but it should have an end. Example Problems on Recursio... algorithmsdatastructurescareerbeginnersbeginners Applying tree traversal algorithms to DOM In this article we'll put those learnings to use for an n-ary tree i.e. DOM. We'll see how we can locate DOM elements using various CSS selectors without using inbuilt APIs like getElementById, getElementsByClassname or ... htmlalgorithmsdatastructuresjavascriptjavascript Data Structures in TypeScript - Hash Table A Hash table is a data structure with a highly efficient lookup, which store key values pairs. Each key is generated by a hash function based on the value being stored. Also, the hash table has to handle collisions that ... hashtabledatastructurestypescriptdatastructures System Design goal: efficient property reads from multiple sources Source (Layer) Sources can be property files, system properties, or they can be coming from a key-value store or database. Each added layer can retrieve data from a source. Rather than have source_s and _layer_s be the s... threadsafedatastructuresjavasystemdesignsystemdesign Data Structures: Bidirectional Map In computer science, a bidirectional map is an associative data structure in which the (key,value) pairs form a one-to-one correspondence. Also known as bijective map. It is not widely used data structure in web developm... oopalgorithmsdatastructurescomputerscienceoop String Hashing in C++ Today, we use hashing algorithm in data structures, cryptography, and searching etc. In this tutorial we will implement a string hashing algorithm in C++ and use it in a data structure called hash table. We shall use Pol... algorithmsdatastructurescppbeginnerscpp Understanding Java Memory Allocation: Stack vs. Heap Because all variables created on the stack are wiped forever when a method ends, the memory size of a Java stack is typically significantly smaller than that of a Java heap area. Unlike a Java stack, where memory is allo... heapdatastructuresjavastackjava Road to algorithm world Time complexity is a measure of how fast an algorithm runs, and it is expressed using notation. Space complexity is a measure of how much auxiliary memory an algorithm takes, and it is also expressed by using notation. B... algorithmsdatastructuresjavabigojava How to Implement a Stack in C# Why Would You Use a Stack? In fact, people use stacks all the time. When you hit the back button, it "pops" the most recent item off the stack and redirects the user there. Push is the insert functionality of the stack c... csharpdatastructuresdatastructures How to insert a node in a Circular Linked List? C++ A Circular Linked List is a variation of Linked List where the first and the last node are also linked to each other, forming a circle. In an ordinary Linked List, the next pointer of the last node points to NULL but in ... algorithmsprogrammingdatastructurescppcpp LeetCode WalkThru: 'Sqrt(x)' and 'Valid Perfect Square' Output is a positive integer; decimal points must be truncated (taken off). Since this is a math-based question, we can consider a wide slew of built in Math methods provided in JavaScript. Return the square root any pos... algorithmsjavascriptdatastructuresbeginnersbeginners How To Implement a Queue in C# We will be covering the queue data structure. You should use a queue data structure whenever you want to handle items in a first in, first out ( FIFO ) order. The two main operations of a queue are Enqueue and Dequeue. I... csharpdatastructuresdatastructures Introduction to Data Structures Lists contain multiple values in an ordered sequence. Values inside the lists are called items and are comma-separated.. List Methods - this method adds an item to the end of the list - ordering of items in a list Lists ... algorithmsdatastructuresbeginnersinterviewprepbeginners change "Polyon" to "Polygon" Thanks for all these suggestions. I am not going to accept the pull requests because all the changes were made to fullbook.md rather than the individual files. I have since removed the (automatically generated) fullback.... datastructures Taking PR's for fixing typos? I noticed a typo in 02_oop.md where diner should be dunder Sorry I have had this project so far on the back burner that I haven't had time to look at it. I think that typo got fixed. In general I welcome pull requests, b... datastructures Fix bug in removelast function of the linked list deque implementation Hi! I spotted: - An error in the removelast function of the linked list deque implementation. The function should be returning the current node's link's data, instead of current node's data. I verified this corrected beh... datastructures time for ith trial I thought about this for long and didn't get this, so I'm putting this. (I hope, I'm right.) time of the ith trial was being calculated with refrence to time before starting experiment. Thanks for your work and the feedb... datastructures Update 03_analysis.md duplicates7(L) should return True if L has any duplicates. The previous version did the opposite. Yes, you are right.... datastructures Update 10a_sorting.md It took me a while to parse this section, so I added some clarifying text and some clarifying comments to the code. Thanks for your efforts on this. Maybe we can find some better language here. I don't think the extra pr... datastructures