- jQuery | multiple elements Selector
- jQuery | [attribute!=value] Selector
- jQuery | [attribute$=value] Selector
- jQuery | [attribute|=value] Selector
- jQuery | multiple classes Selector
- JavaScript | Array reduce() Method
- JavaScript | Array from() Method
- JavaScript | Function Invocation
- How to append an element in an array in JavaScript?
- JavaScript | Function Definitions
- JavaScript | Function Parameters
- How to check if an array includes an object in JavaScript?

- How to swap two numbers without using a temporary variable?
- Remove duplicates from a given string
- Write a program to calculate pow(x,n)
- Program to find whether a no is power of two
- Lucky Numbers
- Write a function to get Nth node in a Linked List
- Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
- Detect loop in a linked list
- Find the node with minimum value in a Binary Search Tree
- Smallest power of 2 greater than or equal to n
- Write a function to delete a Linked List
- Print reverse of a string using recursion
- Write a program to Calculate Size of a tree | Recursion
- Write Code to Determine if Two Trees are Identical
- Write a Program to Find the Maximum Depth or Height of a Tree
- Write a program to Delete a Tree
- Check for Integer Overflow
- Write a program to print all permutations of a given string
- Little and Big Endian Mystery
- Write a function that counts the number of times a given int occurs in a Linked List
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- Write a program to add two numbers in base 14
- Write a function to get the intersection point of two Linked Lists
- Minimum number of jumps to reach end
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- Lowest Common Ancestor in a Binary Search Tree.
- Count set bits in an integer
- Given a linked list which is sorted, how will you insert in sorted way
- Find the two non-repeating elements in an array of repeating elements
- Compute the minimum or maximum of two integers without branching
- Compute the integer absolute value (abs) without branching
- Level Order Tree Traversal
- Block swap algorithm for array rotation
- A program to check if a binary tree is BST or not
- Merge two sorted linked lists
- Print reverse of a Linked List without actually reversing
- Count Inversions in an array | Set 1 (Using Merge Sort)
- Two elements whose sum is closest to zero
- Find the smallest and second smallest elements in an array
- Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
- Remove duplicates from a sorted linked list
- How to determine if a binary tree is height-balanced?
- Segregate 0s and 1s in an array
- Reverse a Doubly Linked List
- Split a Circular Linked List into two halves
- Root to leaf path sum equal to a given number
- Print list items containing all characters of a given word
- Maximum size square sub-matrix with all 1s
- Construct Tree from given Inorder and Preorder traversals
- Given a binary tree, print all root-to-leaf paths
- Practice questions for Linked List and Recursion
- Move last element to front of a given Linked List
- Pairwise swap elements of a given linked list
- Double Tree
- Print all combinations of points that can compose a given number
- Find the largest BST subtree in a given Binary Tree | Set 1
- Delete a node in a Doubly Linked List
- Ceiling in a sorted array
- Equilibrium index of an array
- Delete alternate nodes of a Linked List
- Maximum width of a binary tree
- A Product Array Puzzle
- Alternating split of a given Singly Linked List | Set 1
- Write you own Power without using multiplication(*) and division(/) operators
- Merge Sort for Linked Lists
- Identical Linked Lists
- Segregate Even and Odd numbers
- Find the two repeating elements in a given array
- Foldable Binary Trees
- Reverse a Linked List in groups of given size | Set 1
- Turn off the rightmost set bit
- Add 1 to a given number
- Print nodes at k distance from root
- Connect nodes at same level
- Print a given matrix in spiral form
- Sorted insert for circular linked list
- Print BST keys in the given range
- Program to count number of set bits in an (big) array
- Rearrange positive and negative numbers in O(n) time and O(1) extra space
- Sliding Window Maximum (Maximum of all subarrays of size k)
- Find the smallest window in a string containing all characters of another string
- Check if array elements are consecutive | Added Method 3
- Reverse alternate K nodes in a Singly Linked List
- Rabin-Karp Algorithm for Pattern Searching
- Segregate even and odd nodes in a Linked List
- Overlapping Subproblems Property in Dynamic Programming | DP-1
- Given an array arr[], find the maximum j - i such that arr[j] > arr[i]
- Maximum Length Bitonic Subarray | Set 1 (O(n) time and O(n) space)
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- A Boolean Array Puzzle
- Floor and Ceil from a BST
- Longest Common Subsequence | DP-4
- Optimized Naive Algorithm for Pattern Searching
- Sudoku | Backtracking-7
- Check if a binary tree is subtree of another binary tree | Set 1
- Add two numbers represented by linked lists | Set 1
- Average of a stream of numbers
- Delete a given node in Linked List under given constraints
- Length of the longest substring without repeating characters
- Find a Fixed Point (Value equal to index) in a given array
- Count total set bits in all numbers from 1 to n
- Connect nodes at same level using constant extra space
- Find the maximum element in an array which is first increasing and then decreasing
- Sorted Linked List to Balanced BST
- Sorted Array to Balanced BST
- Implement two stacks in an array
- Check whether two strings are anagram of each other
- Populate Inorder Successor for all nodes
- In-place conversion of Sorted DLL to Balanced BST
- Print all permutations with repetition of characters
- AVL Tree | Set 1 (Insertion)
- Print all interleavings of given two strings
- Interleaving of two given strings with no common characters
- Binomial Coefficient | DP-9
- Convert a given tree to its Sum Tree
- AVL Tree | Set 2 (Deletion)
- Add two numbers without using arithmetic operators
- 0-1 Knapsack Problem | DP-10
- Merge Two Balanced Binary Search Trees
- Find the maximum sum leaf to root path in a Binary Tree
- Pattern Searching | Set 6 (Efficient Construction of Finite Automata)
- Finite Automata algorithm for Pattern Searching
- Hamiltonian Cycle | Backtracking-6
- Swap bits in a given number
- Find a triplet that sum to a given value
- Maximum Sum Increasing Subsequence | DP-14
- Boyer Moore Algorithm for Pattern Searching
- Find subarray with given sum | Set 1 (Nonnegative Numbers)
- Find the smallest positive number missing from an unsorted array | Set 1
- Find the two numbers with odd occurrences in an unsorted array
- Merge two BSTs with limited extra space
- Floyd Warshall Algorithm | DP-16
- Find a sorted subsequence of size 3 in linear time
- Palindrome Partitioning | DP-17
- Largest subarray with equal number of 0s and 1s
- Word Wrap Problem | DP-19
- Partition problem | DP-18
- Construct Special Binary Tree from given Inorder traversal
- Count numbers that don't contain 3
- Maximum Product Subarray
- Magic Square
- Find a pair with the given difference
- Find day of the week for a given date
- Find a triplet from three linked lists with sum equal to a given number
- DFA based division
- Rotate a Linked List
- Replace every element with the greatest element on right side
- Maximum Length Chain of Pairs | DP-20
- Find four elements that sum to a given value | Set 1 (n^3 solution)
- Find four elements that sum to a given value | Set 2 ( O(n^2Logn) Solution)
- Check whether a given Binary Tree is Complete or not | Set 1 (Iterative Solution)
- Make a fair coin from a biased coin
- Maximum circular subarray sum
- Find the row with maximum number of 1s
- Median of two sorted arrays of different sizes
- Print unique rows in a given boolean matrix
- Check divisibility by 7
- Find the element that appears once
- Count the number of possible triangles
- Construct Full Binary Tree from given preorder and postorder traversals
- Lexicographic rank of a string
- Print all permutations in sorted (lexicographic) order
- Shuffle a given array using Fisher–Yates shuffle Algorithm
- Construct BST from given preorder traversal | Set 1
- Construct BST from given preorder traversal | Set 2
- Iterative Quick Sort
- An in-place algorithm for String Transformation
- Space and time efficient Binomial Coefficient
- Longest Palindromic Substring | Set 2
- Add two numbers represented by linked lists | Set 2
- Find the number of islands | Set 1 (Using DFS)
- Reservoir Sampling
- Given a sequence of words, print all anagrams together | Set 1
- Disjoint Set (Or Union-Find) | Set 1 (Detect Cycle in an Undirected Graph)
- Iterative Postorder Traversal | Set 1 (Using Two Stacks)
- Select a random number from stream, with O(1) space
- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Efficient Huffman Coding for Sorted Input | Greedy Algo-4
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Closest Pair of Points using Divide and Conquer algorithm
- Program to print last 10 lines
- Optimal Binary Search Tree | DP-24
- Efficient program to calculate e^x
- Sort a linked list of 0s, 1s and 2s
- Write your own strcmp that ignores cases
- Efficient program to print all prime factors of a given number
- Morris traversal for Preorder
- Linked complete binary tree & its creation
- The Stock Span Problem
- Segment Tree | Set 1 (Sum of given range)
- Segment Tree | Set 2 (Range Minimum Query)
- Find the first circular tour that visits all petrol pumps
- Count words in a given string
- Largest Independent Set Problem | DP-26
- Flatten a multilevel linked list
- Arrange given numbers to form the biggest number | Set 1
- Maximum sum rectangle in a 2D matrix | DP-27
- Pancake sorting
- A Pancake Sorting Problem
- Find if there is a triplet in a Balanced BST that adds to zero
- Swap all odd and even bits
- Tug of War
- Find a pair with given sum in a Balanced BST
- Reverse Level Order Traversal
- Zigzag (or diagonal) traversal of Matrix
- Maximum Subarray Sum using Divide and Conquer algorithm
- Counting Sort
- Find position of the only set bit
- Convert a given Binary Tree to Doubly Linked List | Set 1
- Stock Buy Sell to Maximize Profit
- Write your own atoi()
- QuickSort on Doubly Linked List
- Minimum insertions to form a palindrome | DP-28
- Longest Common Substring | DP-29
- Print all possible combinations of r elements in a given array of size n
- Unbounded Binary Search Example (Find the point where a monotonically increasing function becomes positive first time)
- Random number generator in arbitrary probability distribution fashion
- Design a stack with operations on middle element
- Delete N nodes after M nodes of a linked list
- Check for Identical BSTs without building the trees
- Find the minimum element in a sorted and rotated array
- Convert a given Binary Tree to Doubly Linked List | Set 2
- Assembly Line Scheduling | DP-34
- Radix Sort
- Difference between sums of odd level and even level nodes of a Binary Tree
- Merge a linked list into another linked list at alternate positions
- Print Left View of a Binary Tree
- Add all greater values to every node in a given BST
- Extract Leaves of a Binary Tree in a Doubly Linked List
- Pairwise swap elements of a given linked list by changing links
- Splay Tree | Set 1 (Search)
- Splay Tree | Set 2 (Insert)
- Sum of all the numbers that are formed from root to leaf paths
- Given a linked list, reverse alternate nodes and append at the end
- Calculate the angle between hour hand and minute hand
- Given a linked list of line segments, remove middle points
- Swap nodes in a linked list without swapping data
- Point to next higher value node in a linked list with an arbitrary pointer
- Merge Sort for Doubly Linked List
- Rearrange a linked list such that all even and odd positioned nodes are together
- Add 1 to a number represented as linked list
- Print Binary Tree in 2-Dimensions
- Decimal Equivalent of Binary Linked List
- Unrolled Linked List | Set 1 (Introduction)
- Deletion from a Circular Linked List
- Program to print the diamond shape
- Program to find second most frequent character
- Find maximum (or minimum) in Binary Tree
- Change a Binary Tree so that every node stores sum of all nodes in left subtree
- How to implement decrease key or change key in Binary Search Tree?
- Insertion Sort
- QuickSort
- Selection Sort
- Bubble Sort
- Program to find sum of elements in a given array
- Program to check if a given year is leap year
- Program to multiply two matrices
- Program for Tower of Hanoi
- Program for addition of two matrices
- Program for subtraction of matrices
- Program to find area of a triangle
- Program to print first n Fibonacci Numbers | Set 1
- C Program to print Floyd's triangle
- Iterative Search for a key 'x' in Binary Tree
- Linked List | Set 1 (Introduction)
- Linked List | Set 2 (Inserting a node)
- Queue | Set 2 (Linked List Implementation)
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Circular Linked List | Set 2 (Traversal)
- Find Length of a Linked List (Iterative and Recursive)
- Search an element in a Linked List (Iterative and Recursive)
- Stack | Set 3 (Reverse a string using stack)
- Stack | Set 4 (Evaluation of Postfix Expression)
- Queue | Set 1 (Introduction and Array Implementation)
- Stack Data Structure (Introduction and Program)
- Check whether the length of given linked list is Even or Odd
- Program to sort an array of strings using Selection Sort
- Squareroot(n)-th node in a Linked List
- Rotate Linked List block wise
- Make middle node head in a linked list
- Program to print hollow rectangle or square star patterns
- Sorted insert in a doubly linked list with head and tail pointers
- Sum and Product of maximum and minimum element in Binary Tree