Skip to content
geeksforgeeks
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Tutorials
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
  • Practice
    • Build your AI Agent
    • GfG 160
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • Contests
    • Accenture Hackathon (Ending Soon!)
    • GfG Weekly [Rated Contest]
    • Job-A-Thon Hiring Challenge
    • All Contests and Events
  • DSA
  • Data Structures
  • Array
  • String
  • Linked List
  • Stack
  • Queue
  • Tree
  • Binary Tree
  • Binary Search Tree
  • Heap
  • Hashing
  • Graph
  • Trie
  • Segment Tree
  • Disjoint Set Union
  • Fenwick Tree
  • AVL Tree
  • Red-Black Tree
  • Advanced Data Structures
Open In App
Next Article:
Learn Algorithms with Javascript | DSA using JavaScript Tutorial
Next article icon

Learn Data Structures with Javascript | DSA using JavaScript Tutorial

Last Updated : 10 Feb, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

JavaScript (JS) is the most popular lightweight, interpreted programming language, and might be your first preference for Client-side as well as Server-side developments. But have you thought about using JavaScript for DSA? Learning Data Structures and Algorithms can be difficult when combined with JavaScript. For this reason, we have brought to you this detailed DSA tutorial on how to get started with Data Structures with JavaScript from scratch.

Data Structures with Javascript
Data Structures with JavaScript

How to start learning Data Structures with JavaScript?

The first and foremost thing is dividing the total procedure into little pieces which need to be done sequentially.

The complete process to learn DS from scratch can be broken into 3 parts.

  1. Learn about Time and Space complexities
  2. Learn the basics of individual Data Structures
  3. Practice Problems on Data Structures

1. Learn about Complexities

Here comes one of the interesting and important topics. The primary motive to use DSA is to solve a problem effectively and efficiently. How can you decide if a program written by you is efficient or not? This is measured by complexities. Complexity is of two types.

  1. Time Complexity: Time complexity is used to measure the growth of execution time of an algorithm as the size of the input increases.
  2. Space Complexity: Space complexity refers to the amount of memory required by an algorithm as a function of the size of the input. 
    You will also come across the term Auxiliary Space very commonly in DSA, which refers to the extra space used in the program other than the input data structure.

2. Learn Data Structures

Here comes the most crucial and the most awaited stage of the roadmap for learning data structure and algorithm – the stage where you start learning about DSA. The topic of DSA consists of two parts: 

  • Data Structures
  • Algorithms 

Though they are two different things, they are highly interrelated, and it is very important to follow the right track to learn them most efficiently. If you are confused about which one to learn first, we recommend you to go through our detailed analysis on the topic: What should I learn first- Data Structures or Algorithms?

Here we have followed the flow of learning a data structure and then the most related and important algorithms used by that data structure.

1. Array in JavaScript

The array is a data structure that allows you to store multiple values in a single variable. Arrays are used to hold collections of data, and each value in an array is called an element. Arrays can store elements of any data type, including numbers, strings, objects, and even other arrays.

  • Array Data Structure Guide in JavaScript
  • Practice Problems on Arrays in JavaScript
  • Top Array Problem Interviews in JavaScript

2. String in JavaScript

A string is a sequence of characters used to represent text. Strings are primitive data types but can also be treated as objects when using methods and properties. Strings are immutable, meaning once a string is created, it cannot be changed.

  • Guide on Strings in JavaScript
  • Practice Problems on String in JavaScript
  • JavaScript String Interview Questions

3.  Linked List in JavaScript

A linked list in JavaScript is a linear data structure where each element (called a node) contains data and a reference (or pointer) to the next node in the sequence. Unlike arrays, linked lists do not have indexed access, and elements are dynamically allocated in memory.

  • Linked List Data Structure Guide in JavaScript
  • Top 50 Problems on Linked List for Interviews

4. Searching Algorithms

Searching algorithms in JavaScript help find elements in datasets. Linear Search checks each element sequentially, while Binary Search divides the array in half for faster searches in sorted data. Jump Search jumps ahead in blocks, and Interpolation Search estimates positions based on value distribution. Each algorithm offers varying levels of efficiency depending on the dataset's structure.

  • Guide on Searching Algorithms in JavaScript
  • Practice Problems on Searching in JavaScript

5. Sorting Algorithm

Sorting algorithms in JavaScript arrange data in a specific order. Bubble Sort, Selection Sort, and Insertion Sort are simple comparison-based algorithms, while Merge Sort and Quick Sort are more efficient, using divide-and-conquer strategies.

  • Guide on Sorting Algorithms in JavaScript
  • Practice Problems on Sorting in JavaScript
  • Top Problems on Sorting in JavaScript

6. Hash

A hash in JavaScript is a data structure that stores key-value pairs for fast retrieval. Hash functions convert keys into fixed-size values, allowing quick access. Hashing is commonly used in dictionaries, caches, and databases for efficient data operations.

  • Guide on Hashing in JavaScript
  • Hashing based Interview Questions in JS

7. Two Pointer

The Two Pointer technique in JavaScript uses two pointers to traverse a data structure, typically an array, at different speeds or positions. This method is often applied to problems like finding pairs, checking for specific conditions, or merging sorted arrays.

  • Guide on Two Pointer in JavaScript

8. Recursion

Recursion in JavaScript is a technique where a function calls itself to solve a problem by breaking it into smaller subproblems of the same type. Every recursive function must have a base case, which stops the recursion, and a recursive case, where the function calls itself with a smaller input.

  • Guide on Recursion in JavaScript
  • Recursion Practice Problems
  • Top 50 Problem on Recursion

9. Stack in JavaScript

A stack is a data structure that follows the Last In, First Out (LIFO) principle. This means that the last element added to the stack will be the first one to be removed. Stacks are commonly used for managing function calls, tracking history (e.g., undo operations), and parsing expressions

  • Stack Guide in JavaScript
  • Top 50 problems on Stack for Interview in JavaScript

10. Queue in JavaScript

A Queue in JavaScript is a linear data structure that follows the FIFO (First In, First Out) principle, where elements are added at the end and removed from the front. It can be implemented using an array with push() for enqueue and shift() for dequeue operations.

  • Queue Guide in JavaScript
  • Top 50 problems on Queue for Interview in JS

11. Tree in JavaScript

A Tree in JavaScript is a hierarchical data structure where each node has a value and references to child nodes. It is commonly used for representing hierarchical relationships like the DOM, file systems, or organizational structures.

  • Tree Guide in JavaScript
  • Types in Tree Data Structure
  • Top 50 Tree Coding Problems in JavaScript

12. Priority Queue in JavaScript

A Priority Queue in JavaScript is a special type of queue where elements are dequeued based on priority rather than the order they were added. It can be implemented using a heap (binary heap for efficiency) or an array with sorting.

  • Priority Queue Guide in JavaScript

13. Map in JavaScript

A Map in JavaScript is a collection of key-value pairs where keys can be of any data type. It maintains the insertion order and provides efficient methods for adding, deleting, and retrieving values.

  • Map Guide in JavaScript

14.  Set in JavaScript

A Set in JavaScript is a collection of unique values, meaning it does not allow duplicate entries. It provides methods to add, delete, and check the existence of elements efficiently.

  • Set Guide in JavaScript

15. Graph in JavaScript

A Graph in JavaScript is a data structure consisting of nodes (vertices) connected by edges. It can be represented using an adjacency list or an adjacency matrix and is used for modeling networks, relationships, and paths. 

  • Graph Guide in JavaScript
  • Top 50 Graph Coding Problems in JavaScript
  • Graph Representation in JavaScript

3. Built-in Data Structures in JavaScript

Let’s see what inbuilt data structures JavaScript offers us:

Data Structure

Internal Implementation

Static or Dynamic

JavaScript Arrays

Contiguous Memory Allocation

Dynamic Nature

JavaScript Strings

Array of Unicode characters

Dynamic Nature

JavaScript Objects

Hashing key-value pair

Dynamic Nature

JavaScript Sets

Hash Tables or Search trees

Dynamic Nature

JavaScript Maps

Hash Tables

Dynamic Nature

4. Practice Problems on Data Structures and Algorithms (DSA)

For practicing problems on individual data structures and algorithms, you can use the following links: 

  • Practice problems on Arrays
  • Practice problems on Strings
  • Practice problems on Linked Lists
  • Practice problems on Stack
  • Practice problems on Queue
  • Practice problems on Tree
  • Practice problems on Graph
  • Practice problems on Sorting algorithm
  • Practice problems on Searching algorithm
  • Practice problems on Greedy algorithm
  • Practice problems on Divide And Conquer algorithm
  • Practice problems on Recursion algorithm
  • Practice problems on Backtracking algorithm
  • Practice problems on Dynamic Programming algorithm

Apart from these, there are many other practice problems that you can refer based on their respective difficulties: 

  • School-level
  • Basic level
  • Easy level
  • Medium level
  • Hard level

You can also try to solve the most asked interview questions based on the list curated by us at: 

  • Must-Do Coding Questions for Companies
  • Top 50 Array Coding Problems for Interviews
  • Top 50 String Coding Problems for Interviews
  • Top 50 Tree Coding Problems for Interviews
  • Top 50 Dynamic Programming Coding Problems for Interviews

You can also try our curated lists of problems below articles:

  • SDE SHEET – A Complete Guide for SDE Preparation
  • DSA Sheet by Love Babbar
     

Next Article
Learn Algorithms with Javascript | DSA using JavaScript Tutorial

P
pinkigfg
Improve
Article Tags :
  • Data Structures
  • JavaScript
  • Web Technologies
  • DSA
  • Tutorials
Practice Tags :
  • Data Structures

Similar Reads

  • Learn Data Structures with Javascript | DSA using JavaScript Tutorial
    JavaScript (JS) is the most popular lightweight, interpreted programming language, and might be your first preference for Client-side as well as Server-side developments. But have you thought about using JavaScript for DSA? Learning Data Structures and Algorithms can be difficult when combined with
    8 min read
  • Learn Algorithms with Javascript | DSA using JavaScript Tutorial
    This Algorithms with Javascript tutorial is designed to help you understand and implement fundamental algorithms using the versatile JavaScript programming language. Whether you are a beginner in programming or looking to enhance your algorithmic skills, this guide will walk you through essential co
    15+ min read

    • Mathematical

    • JavaScript Program to Check for Palindrome Number
      We are going to learn about Palindrome Numbers in JavaScript. A palindrome number is a numerical sequence that reads the same forwards and backward, It remains unchanged even when reversed, retaining its original identity. Example: Input : Number = 121Output : PalindromeInput : Number = 1331Output :
      4 min read
    • JavaScript - Factorial of a Number in JS
      The factorial of a non-negative integer is the product of all positive integers less than or equal to that number. It’s denoted by “n!” where n is the integer. Here are the various methods to find the factorial of a number in JavaScript. Logicx!= 1*(x-3)*(x-2)*(x-1).......xNote: Factorials of negati
      3 min read
    • JavaScript Program to Find GCD or HCF of Two Numbers
      GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest positive integer that divides both numbers without leaving a remainder. GCD ( a, b ) = [ |a.b| ] / [ lcm(a, b) ]or,HCF of factors = Product of the Numbers/ LCM of numbersExample: Input: a = 20, b = 28Output: 4
      3 min read
    • JavaScript Program to Find LCM of Two Numbers
      In this article, we are going to learn about finding the LCM of two numbers by using JavaScript. LCM (Least Common Multiple) of two numbers is the smallest positive integer that is divisible by both numbers without leaving a remainder. It's a common multiple of the numbers. LCM of two numbers = Prod
      4 min read
    • Check a Number is Prime or Not Using JavaScript
      A prime number is a whole number greater than 1, which has no positive divisors other than 1 and itself. In other words, prime numbers cannot be formed by multiplying two smaller natural numbers. For example: 2, 3, 5, 7, 11, and 13 are prime numbers.4, 6, 8, 9, and 12 are not prime numbers because t
      5 min read
    • JavaScript Program to Find Prime Factors
      In this article, we will see all the methods to find the prime factors of a number using JavaScript. Methods to Find Prime Factors: Table of Content Using loops and Math.pow() MethodRecursive Approach with Spread OperatorSieve of Eratosthenes AlgorithmMethod 1: Using loops and Math.pow() MethodIn th
      3 min read
    • JavaScript Program for Sieve of Eratosthenes
      In this article, we will be demonstrating a JavaScript program for the Sieve of Eratosthenes algorithm. The Sieve of Eratosthenes algorithm is an efficient way of getting all the prime numbers that exist in the given range e.g., Input: n =10Output: 2 3 5 7 Input: n = 20 Output: 2 3 5 7 11 13 17 19Ap
      2 min read
    • JavaScript Program to Compute Power of a Number
      In this article, we will demonstrate different approaches for computing the Power of a Number using JavaScript. The Power of a Number can be computed by raising a number to a certain exponent. It can be denoted using a^b, where the 'a' represents the base number & the 'b' represents the number t
      3 min read

    Recursion

    • Recursion Guide in JavaScript
      Recursion is a process in which a function calls itself as a subroutine. This allows the function to be repeated several times, as it can call itself during its execution. Recursion is often used to solve problems that can be broken down into smaller, similar subproblems. Syntax:[GFGTABS] JavaScript
      4 min read
    • Applications of Recursion in JavaScript
      Recursion is a programming technique in which a function calls itself directly or indirectly. Using a recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc. Recursion is a t
      7 min read
    • JavaScript Program to Print N to 1 using Recursion
      In this article, we will see how to print N to 1 using Recursion in JavaScript. What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. In the recursive program, the solution to the base
      1 min read
    • JavaScript Program to Print 1 to N using Recursion
      In this article, we will see how to print 1 to N using Recursion in JavaScript. What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. In the recursive program, the solution to the base
      2 min read
    • JavaScript Program to Check for Palindrome String using Recursion
      Given a string, write a recursive function that checks if the given string is a palindrome, else, not a palindrome. A string is called a palindrome if the reverse of the string is the same as the original one. For example - “madam”, “racecar”, etc. What is Recursion?The process in which a function c
      3 min read
    • JavaScript Program for Sum of Digits of a Number using Recursion
      We are given a number as input and we have to find the sum of all the digits contained by it. We will split the digits of the number and add them together using recursion in JavaScript. Table of Content Recursively Summing DigitsUsing string manipulation with recursionRecursively Summing DigitsIn th
      2 min read

    Array

    • Create an Array of Given Size in JavaScript
      The basic method to create an array is by using the Array constructor. We can initialize an array of certain length just by passing a single integer argument to the JavaScript array constructor. This will create an array of the given size with undefined values. Syntax cosnt arr = new Array( length )
      4 min read
    • JavaScript - Access Elements in JS Array
      These are the following ways to Access Elements in an Array: 1. Using Square Bracket NotationWe can access elements in an array by using their index, where the index starts from 0 for the first element. We can access using the bracket notation. [GFGTABS] JavaScript const a = [10, 20, 30, 40, 50]; co
      2 min read
    • JavaScript - Max Element in an Array
      These are the following ways to find the largest element in JS array: Note: You must add a conditional check for checking whether the given array is empty or not, if the array is not empty then you can use the given below approaches to find out the largest element among them. 1. Using the Spread Ope
      4 min read
    • JavaScript Program to Check an Array is Sorted or Not
      In this article, we will learn how to check if the array is sorted in JavaScript. JavaScript Array is a single variable that is used to store elements of different data types. Now, we have to find whether the array is sorted or not. Examples: Input : const arr = [1, 2, 3, 4, 5]; Output : trueInput :
      4 min read
    • Reverse an Array in JavaScript
      Here are the different methods to reverse an array in JavaScript 1. Using the reverse() MethodJavaScript provides a built-in array method called reverse() that reverses the elements of the array in place. This method mutates the original array and returns the reversed array. [GFGTABS] JavaScript let
      3 min read
    • Javascript Program to Move all zeroes to end of array
      Given an array of random numbers, Push all the zero's of a given array to the end of the array. For example, if the given arrays is {1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0}, it should be changed to {1, 9, 8, 4, 2, 7, 6, 0, 0, 0, 0}. The order of all other elements should be same. Expected time complexity i
      3 min read
    • JavaScript Program for Left Rotate by One in an Array
      In this article, we are going to learn about left Rotation by One in an Array by using JavaScript, Left rotation by one in an array means shifting all elements from one position to the left, with the last element moving to the first position. The order of elements is cyclically rotated while maintai
      5 min read

    Searching

    • Binary Search In JavaScript
      Binary Search is a searching technique that works on the Divide and Conquer approach. It is used to search for any element in a sorted array. Compared with linear, binary search is much faster with a Time Complexity of O(logN), whereas linear search works in O(N) time complexity Examples: Input : ar
      3 min read
    • JavaScript Program to Find Index of First Occurrence of Target Element in Sorted Array
      In this article, we will see the JavaScript program to get the first occurrence of a number in a sorted array. We have the following methods to get the first occurrence of a given number in the sorted array. Methods to Find the Index of the First Occurrence of the element in the sorted arrayTable of
      6 min read
    • JavaScript Program to find the Index of Last Occurrence of Target Element in Sorted Array
      In this article, we will see the JavaScript program to get the last occurrence of a number in a sorted array. We have the following methods to get the last occurrence of a given number in the sorted array. Methods to Find the Index of the Last Occurrence of the Target Element in the Sorted ArrayUsin
      4 min read
    • Count number of occurrences (or frequency) in a sorted array
      Given a sorted array arr[] and an integer target, the task is to find the number of occurrences of target in given array. Examples: Input: arr[] = [1, 1, 2, 2, 2, 2, 3], target = 2Output: 4Explanation: 2 occurs 4 times in the given array. Input: arr[] = [1, 1, 2, 2, 2, 2, 3], target = 4Output: 0Expl
      9 min read
    • JavaScript Program to Find the Square Root
      Given a number N, the task is to calculate the square root of a given number using JavaScript. There are the approaches to calculate the square root of the given number, these are: Approaches to Find the Square Root of Given Number in JavaScript: Table of Content Using Math.sqrt() MethodUsing JavaSc
      5 min read

    Sorting

    • Sorting Algorithms in JavaScript
      Sorting is an important operation in computer science that arranges elements of an array or list in a certain order (either ascending or descending). Example: Input: [64, 34, 25, 12, 22, 11, 90]Output: [11, 12, 22, 25, 34, 64, 90] Input: [1, 2, -3, 3, 4, 5]Output: [-3, 1, 2, 3, 4, 5] Table of Conten
      6 min read
    • Bubble Sort algorithm using JavaScript
      Bubble sort algorithm is an algorithm that sorts an array by comparing two adjacent elements and swapping them if they are not in the intended order. Here order can be anything like increasing or decreasing. How Bubble-sort works?We have an unsorted array arr = [ 1, 4, 2, 5, -2, 3 ], and the task is
      4 min read
    • JavaScript Program for Selection Sort
      What is Selection Sort in JavaScript?Selection sort is a simple and efficient algorithm that works on selecting either the smallest or the largest element of the list or array and moving it to the correct position. Working of Selection SortConsider the following arrayarr = [ 64, 25, 12, 22, 11]This
      3 min read
    • JavaScript Program for Insertion Sort
      What is Insertion Sort Algorithm?Insertion sorting is one of the sorting techniques that is based on iterating the array and finding the right position for every element. It compares the current element to the predecessors, if the element is small compare it with the elements before. Move ahead to a
      4 min read
    • JavaScript Program for Merge Sort
      What is Merge Sort Algorithm?Merge sort is one of the sorting techniques that work on the divide and conquer approach. The Given array is divided in half again and again and those parts are arranged in sorted order and merged back to form the complete sorted array. Working of Merge SortTo Understand
      3 min read
    • JavaScript Program to Merge two Sorted Arrays into a Single Sorted Array
      In this article, we will cover how to merge two sorted arrays into a single sorted array in JavaScript. Given there are two sorted arrays, we need to merge them into a single sorted array in JavaScript. We will see the code for each approach along with the output. Below are the possible approaches t
      3 min read
    • Javascript Program For Counting Inversions In An Array - Set 1 (Using Merge Sort)
      Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array is sorted in the reverse order, the inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an invers
      5 min read
    • JavaScript - Union of Arrays
      In JavaScript, finding the union of multiple arrays means combining their elements into a single array with only unique values. Here are several methods to compute the union of JavaScript Arrays Using Spread Operator with Set - Most PopularWe can use the Set object along with the spread operator to
      3 min read
    • Quick Sort(Lomuto Partition) Visualization using JavaScript
      GUI(Graphical User Interface) helps in better in understanding than programs. In this article, we will visualize Quick Sort using JavaScript. We will see how the array is being partitioned using Lomuto Partition and then how we get the final sorted array. We will also visualize the time complexity o
      4 min read
    • How to Create an Array using Intersection of two Arrays in JavaScript ?
      In this article, we will try to understand how to create an array using the intersection values of two arrays in JavaScript using some coding examples. For Example: arr1 = [1, 3, 5, 7, 9, 10, 14, 15]arr2 = [1, 2, 3, 7, 10, 11, 13, 14]result_arr = [1, 3, 7, 10, 14]Approach 1: We will see the native a
      3 min read
    • JavaScript Program for Quick Sort
      What is Quick Sort Algorithm?Quick sort is one of the sorting algorithms that works on the idea of divide and conquer. It takes an element as a pivot and partitions the given array around that pivot by placing it in the correct position in the sorted array. The pivot element can be selected in the f
      4 min read

    Hashing

    • Hashing in JavaScript
      Hashing is a popular technique used for storing and retrieving data as fast as possible. The main reason behind using hashing is that it performs insertion, deletion, searching, and other operations Why use Hashing?In hashing, all the operations like inserting, searching, and deleting can be perform
      6 min read
    • Set in JavaScript
      A Set in JavaScript is used to store a unique collection of items, meaning no duplicates are allowed. Sets internally use a hash table which makes search, insert and delete operations faster than arrays. Please note that a hash table data structure allows these operations to be performed on average
      4 min read

    String

    • JavaScript Strings
      A JavaScript String is a sequence of characters, typically used to represent text. In JavaScript, there is no character type (Similar to Python and different from C, C++ and Java), so a single character string is used when we need a character.Like Java and Python, strings in JavaScript are immutable
      6 min read
    • Palindrome in JavaScript
      We will understand how to check whether a given value is a palindrome or not in JavaScript. A palindrome is a word, phrase, number, or any sequence that reads the same forward and backward. For instance, "madam" and "121" are palindromes. To perform this check we will use the following approaches: T
      3 min read
    • Javascript Program To Check Whether Two Strings Are Anagram Of Each Other
      Write a function to check whether two given strings are anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, "abcd" and "dabc" are an anagram of each other. Method 1 (Use Sorting): Sort b
      6 min read
    • Javascript Program To Reverse Words In A Given String
      Example: Let the input string be "i like this program very much". The function should change the string to "much very program this like i" Examples:  Input: s = "geeks quiz practice code" Output: s = "code practice quiz geeks" Input: s = "getting good at coding needs a lot of practice" Output: s = "
      4 min read
    • How to Get Character of Specific Position using JavaScript ?
      Get the Character of a Specific Position Using JavaScript We have different approaches, In this article we are going to learn how to Get the Character of a Specific Position using JavaScript Below are the methods to get the character at a specific position using JavaScript: Table of Content Method 1
      4 min read
    • How to generate all combinations of a string in JavaScript ?
      We are going to see if we can generate all the possible combinations of a given string using JavaScript methods or concepts. You are given a string, containing different characters, you need to generate all combinations of a string by selecting a character at once and then re-arranging that characte
      4 min read

    Linked List

    • Implementation of LinkedList in Javascript
      In this article, we will be implementing the LinkedList data structure in Javascript. A linked list is a linear data structure where elements are stored in nodes, each containing a value and a reference (or pointer) to the next node. It allows for efficient insertion and deletion operations. Each no
      5 min read
    • Javascript Program For Searching An Element In A Linked List
      Write a function that searches a given key 'x' in a given singly linked list. The function should return true if x is present in linked list and false otherwise. bool search(Node *head, int x) For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then functi
      3 min read
    • Javascript Program For Inserting A Node In A Linked List
      We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.All programs discussed in this post consider the following representations of the linked list.  [GFGTABS] JavaScript // Linked List Class // Head of list let he
      7 min read
    • Javascript Program For Inserting Node In The Middle Of The Linked List
      Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node. Examples: Input : list: 1->2->4->5 x = 3Output : 1->2->3
      4 min read
    • Javascript Program For Writing A Function To Delete A Linked List
      A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. This article focuses on writing a function to delete a linked list. Implementation: [GFGTABS] JavaScript // Javascript program to de
      2 min read
    • Javascript Program For Deleting A Linked List Node At A Given Position
      Given a singly linked list and a position, delete a linked list node at the given position. Example: Input: position = 1, Linked List = 8->2->3->1->7Output: Linked List = 8->3->1->7Input: position = 0, Linked List = 8->2->3->1->7Output: Linked List = 2->3->1-
      3 min read
    • Javascript Program For Finding Length Of A Linked List
      Write a function to count the number of nodes in a given singly linked list. For example, the function should return 5 for linked list 1->3->1->2->1. Iterative Solution: 1) Initialize count as 0 2) Initialize a node pointer, current = head.3) Do following while current is not NULL a) cur
      3 min read
    • Javascript Program For Rotating A Linked List
      Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer. For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list should be modified to 50->60->10->20->30->40. Assume that k is smal
      5 min read
    • Javascript Program For Finding The Middle Element Of A Given Linked List
      Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list
      4 min read
    • JavaScript Program to Reverse a Linked List
      A linked list is a data structure where elements are stored in nodes, and each node points to the next node in the sequence. Reversing a linked list involves changing the direction of the pointers, making the last node the new head and the head the new tail. Below are the approaches to reverse a lin
      3 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences