1500 most common data structures and algorithms solutions

Programming is very important for developing web and mobile application software. Do you know programming? So you are a programmer (developer). But wait, How to describe you are a better programmer? That is main point. Whose detection comes under test. Such as which is best suitable path to visit our destination.

In similar way we can be find out a best programmer which know about programming concepts, logical skills, possible test cases, understand problem and data structure and algorithm concept etc.

Here are some examples that are commonly asked in interviews. The main objective of these programs is to provide a relative solution from one language to another. Which can prove useful for programmers who are moving from one language to another. Here given solution of c, c++, java, go, kotlin, node, c#, ruby, python etc. You can use our tool to make online convertor. Here mentioned some standard online tool.

Online java to python converter Online java to c# converter Online Java To PHP Converter Online java to vb.net converter Online java to javascript converter Online java to swift converter Java to c++ converter online Java to typescript converter online Java to dart converter online Java to ruby converter online Java to scala converter online Java to groovy converter online Java to golang converter online

When we are write similar code in one language to another language it can reduce code standard and quality. In this case please submit your solution in comment section. We are also accept your support and suggestions to improve post content. You can also provide other language solution in comment section.

• 1 Insert node at beginning of linked list
• 2 Insert node at end of linked list
• 3 Insert node at middle of linked list
• 4 Insert a node at last nth position of linked list
• 5 Remove every k-th node of the linked list
• 6 Delete middle of linked list
• 7 Remove duplicates from a sorted linked list
• 8 Remove duplicates from an unsorted linked list
• 9 Delete a Linked List node at a given position
• 10 Delete N nodes after M nodes of a linked list
• 11 Find length of linked list
• 12 Find length of loop in linked list
• 13 Insert node at beginning of circular linked list
• 14 Insert node at end of circular linked list
• 15 Sorted insert for circular linked list
• 16 Delete every Kth node from circular linked list
• 17 Segregate even and odd nodes in a Linked List
• 18 Delete all the even nodes of a Circular Linked List
• 19 Delete middle node of a circular single linked list
• 20 Delete all odd position nodes from circular linked list
• 21 Count nodes in Circular linked list
• 22 Convert singly linked list into circular linked list
• 23 Check if a linked list is circular linked list
• 24 Find minimum and maximum elements in Circular Linked List
• 25 Sum of the nodes of a Circular Linked List
• 26 Exchange first and last nodes in Circular Linked List
• 27 Reverse a Circular Linked List
• 28 Deletion a node from Circular Linked List
• 29 Sum of the alternate nodes of Circular linked list
• 30 Insert node at beginning of doubly linked list
• 31 Insert node at end of doubly linked list
• 32 Insert value in sorted way of doubly linked list
• 33 Delete a node in a Doubly Linked List
• 34 Find length of Doubly Linked List
• 35 Find the largest node in Doubly linked list
• 36 Delete all Prime Nodes from a Circular Singly Linked List
• 37 Sort a linked list of 0s, 1s and 2s
• 38 Make middle node head in a linked list
• 39 Reverse a linked list
• 40 Split a Circular Linked List into two halves
• 41 Reverse a Doubly Linked List
• 42 Remove duplicates from an unsorted doubly linked list
• 43 Remove duplicates from a sorted doubly linked list
• 44 Remove last node of the linked list
• 45 Sum of nodes which are greater than upcoming nodes of linked list
• 46 Delete all Prime Nodes from a Singly Linked List
• 47 Sum of all distinct nodes in a linked list
• 48 Find the second last node of a linked list
• 49 Delete a doubly linked list node at a given position
• 50 Delete all occurrences of a given key in a doubly linked list
• 51 Delete all Prime Nodes from a doubly linked list
• 52 Delete all the even nodes from a Doubly Linked List
• 53 Delete all nodes which are divisible by X in doubly linked list
• 54 Delete alternate nodes of a Doubly Linked List
• 55 Inorder Tree Traversal of a Binary Tree
• 56 Preorder Tree Traversal of a Binary Tree
• 57 Sorted merge of two sorted doubly linked lists
• 58 Postorder Tree Traversal of a Binary Tree
• 59 Level order Tree Traversal
• 60 Reverse Level Order Traversal of Binary Tree
• 61 Pairwise swap elements of a given linked list
• 62 Delete all Even position nodes from circular linked list
• 63 Level order traversal line by line
• 64 Level order traversal in spiral form
• 65 Reverse Level Order traversal in spiral form
• 66 Sum of smaller elements of nodes in a linked list
• 67 Find the Second Smallest Element in a Linked List
• 68 Sum of the alternate nodes of linked list
• 69 Move all occurrences of an element to end in a linked list
• 70 Alternating split of a given Singly Linked List
• 71 Print the last k nodes of the linked list in reverse order
• 72 Print all Leaf nodes of a binary tree from left to right
• 73 Bubble Sort For a Linked List
• 74 Generic Linked List
• 75 Boundary Traversal of binary tree
• 76 Print left view of a binary tree
• 77 Print right view of a binary tree
• 78 Print nodes in top view of binary tree
• 79 Density of binary tree in single Traversal
• 80 Print all internal nodes of a binary tree using stack
• 81 Delete all nodes in a linked list
• 82 Detect loop in a linked list
• 83 Check if all leaves are at same level
• 84 Find n-th node of inorder traversal in binary tree
• 85 Find n-th node in postorder traversal of a Binary Tree
• 86 Lowest common ancestor in a binary tree
• 87 Kth ancestor of a node in binary tree
• 88 Intersection of two sorted llnked lists
• 89 Print the Middle of a given linked list
• 90 Check palindrome in given Linked List
• 91 Adjacency list representation of graph
• 92 Adjacency matrix representation of graph
• 93 Depth First Traversal for a Graph
• 94 Breadth First Traversal for a Graph
• 95 Find Mother Vertex in a Graph
• 96 Transitive Closure of a Graph using DFS
• 97 Detect Cycle in a Directed Graph
• 98 Detect Cycle in an Undirected Graph
• 99 Transpose a directed graph
• 100 Count number of edges in an undirected graph
• 101 Number of sink nodes in a graph
• 102 Sorted order insertion of linked list
• 103 Rotate a linked list
• 104 Binary Search
• 105 Move all negative elements at the end of array
• 106 Display all True Boolean expression
• 107 Display all palindromic substring by max length
• 108 Length of longest palindrome in linked list
• 109 Check if graph is strongly connected or not
• 110 Check if a graph is bipartite or not
• 111 Count all possible paths between two vertices
• 112 Display palindrome in rotated string
• 113 K’th Largest element in Binary Search Tree
• 114 K’th smallest element in Binary Search Tree
• 115 Delete a node in binary search tree
• 116 Implement stack using array
• 117 Implement queue using linked list
• 118 Fibonacci series
• 119 Minimum number of edges between two vertices
• 120 Find Minimum cost from source node to destination
• 121 Find Maximum cost from source node to destination
• 122 Print all path between given vertices
• 123 Check if path exists between two vertices in a directed graph
• 124 Find given sequence is a valid topological sort or not
• 125 Print a Topological Sort in Directed Acyclic Graph
• 126 Print Bottom view of binary tree
• 127 Check Children Sum Property in a Binary Tree
• 128 Check if binary tree is Continuous Tree
• 129 Check if binary tree is Foldable Binary Tree
• 130 Check if given binary tree is complete binary tree or not
• 131 Check if two nodes are cousins in a Binary Tree
• 132 Check whether a given binary tree is perfect or not
• 133 Clone a given binary tree
• 134 Construct Binary Tree from a Linked List
• 135 Construct Binary Tree from given parent array
• 136 Construct Tree from given Inorder and Postorder
• 137 Construct Tree from given Inorder and Preorder
• 138 Construct a full Binary Tree from an array
• 139 Construct a tree from Inorder and Level order
• 140 Convert a binary tree to Max Heap
• 141 Convert a given binary tree to Doubly Linked List
• 142 Convert binary tree to it's mirror
• 143 Convert binary tree to threaded binary tree
• 144 Binary tree down-right conversion
• 145 Delete a Binary Tree
• 146 Delete a node in binary tree
• 147 Diagonal Sum of a Binary Tree
• 148 Diagonal Traversal of Binary Tree
• 149 Vertical Sum of given Binary Tree
• 150 Find ancestors of given node in a Binary Tree
• 151 Find height of binary tree
• 152 Reverse the path from given node to root node
• 153 Print Bottom-Left View of a Binary Tree
• 154 Print Bottom-Right View of a Binary Tree
• 155 Print vertical Traversal of binary tree
• 156 Detect and Remove Loop in a Linked List
• 157 Clone a linked list nodes
• 158 Delete a node from linked list without head pointer
• 159 Print linked list from middle into left-right order
• 160 Print linked list from middle into right-left order
• 161 Rearrange linked list in spiral order
• 162 Rearrange linked list in increasing order
• 163 Segregate even and odd nodes in ascending order
• 164 Sort linked list which is already sorted on absolute values
• 165 Insertion in binary search tree
• 166 Print all subsets with given sum
• 167 Spiral form of matrix
• 168 Print longest bitonic subarray
• 169 Print all bitonic subarray
• 170 Merge k sorted arrays
• 171 Check if a given graph is tree or not
• 172 Add two numbers represented by linked list
• 173 Create linked list from an given array
• 174 Insert a node in sorted linked list
• 175 Move last node to front in linked list
• 176 Reverse a Linked List in groups of given size
• 177 Reverse alternate K nodes in a Linked List
• 178 Reverse the group of even elements in a Linked List
• 179 Reverse first K elements of given linked list
• 180 Find Next Sparse Number
• 181 Check if a given number is perfect number or not
• 182 Sum of alternate leaf nodes in bst
• 183 Sum of all leaf nodes of binary search tree
• 184 Check if array is preorder of bst
• 185 Check if array is postorder of bst
• 186 Check if array is inorder of BST
• 187 Check if a binary tree is BST or not
• 188 Transform a BST to greater sum tree
• 189 Find a pair with given sum in BST
• 190 Diagonal traversal of a matrix
• 191 Diamond shape in odd square matrix
• 192 Trie insertion
• 193 Count the occurrence of array elements
• 194 Binary Max Heap Tree Node Insertion
• 195 Bucket Sort
• 196 Sum of k smallest elements in BST
• 197 Print BST keys in the given range
• 198 Remove BST keys outside the given range
• 199 Remove all leaf nodes from the binary search tree
• 200 Print a given matrix in reverse spiral form
• 201 Print all permutations of a string
• 202 Egyptian Fraction Problem
• 203 Divide and Conquer
• 204 Remove all the Odd digit sum nodes from a circular linked list
• 205 Generate a random n bit binary string
• 206 Zeckendorf’s Theorem
• 207 Delete all odd nodes of a circular linked list
• 208 Algorithm
• 209 Print binary tree levels in ascending order
• 210 Remove all fibonacci nodes from a circular single linked list
• 211 Print a given matrix in anticlockwise spiral form
• 212 Reversal spiral of diamond element in square matrix
• 213 Find all subarray with given sum
• 214 Count Total words in Trie
• 215 Rotate matrix elements in given size
• 216 Sort array elements by frequency
• 217 Implement Threaded Binary Search Tree
• 218 Trie Deletion
• 219 Display N Ugly Numbers
• 220 Print Tribonacci Numbers
• 221 Find Super Ugly Number
• 222 Rotate matrix elements
• 223 Trie Search Word Element
• 224 Trie Bottom Up Traversal
• 225 Display trie tree elements
• 226 Spiral view of diamond element in square matrix
• 227 Reverse fibonacci series
• 228 Reverse tribonacci series
• 229 Find the longest common prefix using Trie
• 230 Print Binary Search Tree in Min Max Fashion
• 231 Print leaf node in Threaded Binary Search Tree
• 232 Second largest element in BST
• 233 Sorted array to balanced BST
• 234 Add all greater values to every node in a given BST
• 235 Add all smallest values to every node in a given BST
• 236 Delete a path by given leaf node in BST
• 237 Delete a path from given node to root node in BST
• 238 Delete sorted sequence in Binary Search Tree
• 239 Delete nodes which are greater than or equal to given value in BST
• 240 Check if a given BST is height balanced
• 241 Check if a sorted sub sequence is part of BST
• 242 Check if two BST contain same set of elements
• 243 Count BST nodes that lie in a given range
• 244 Find median of binary search tree
• 245 Find the closest element in Binary Search Tree
• 246 Inorder Successor in Binary Search Tree
• 247 Find Inorder Predecessor in Binary Search Tree
• 248 Inorder predecessor and successor for a given key in BST
• 249 Lowest Common Ancestor in a Binary Search Tree
• 250 Find maximum element between two nodes of BST
• 251 Print all even nodes of Binary Search Tree
• 252 Print all odd nodes of Binary Search Tree
• 253 Convert doubly linked list is spiral form
• 254 Count frequency of given node in doubly linked list
• 255 Remove a node from the end of the doubly linked list
• 256 Delete initial n nodes in a doubly linked list
• 257 Delete last n nodes from end of doubly linked list
• 258 Delete the last node from doubly linked list
• 259 Perform quick sort in doubly linked list
• 260 Sorted insertion in doubly linked list
• 261 Sort the biotonic doubly linked list
• 262 Rotate of Doubly linked list by n nodes
• 263 Check if palindrome exists in doubly linked list
• 264 Convert a doubly linked list anticlockwise spiral form
• 265 Convert a doubly linked list into reversal anti clockwise spiral form
• 266 Detect rotational palindrome in doubly linked list
• 267 Find middle element in doubly linked list
• 268 Check if given key is exist in doubly linked list
• 269 Find pairs with given sum in doubly linked list
• 270 Find the smallest node in doubly linked list
• 271 Remove a given node from the circular doubly linked list
• 272 Construct a linked list from 2D matrix
• 273 Insertion sort in doubly linked list
• 274 Insert node at beginning of circular doubly linked list
• 275 Insert node at end of circular doubly linked list
• 276 All Topological Sort in Directed Acyclic Graph
• 277 Binary Min Heap Tree Node Insertion
• 278 Binary Max Heap Tree Node Deletion
• 279 Binary Min Heap Tree Node Deletion
• 280 Implement max heap using array
• 281 Implement min heap using array
• 282 Ternary Min heap
• 283 Zigzag traversal of matrix
• 284 Traversal binary min heap array
• 285 Simplest implementation of Fibonacci Heap
• 286 Merge two binary max heap arrays
• 287 Merge two binary min heap arrays
• 288 Tower of hanoi solution
• 289 Sum of digits of a number
• 290 Check if a given number is pure number
• 291 Check if a given number is sparse or not
• 292 Check if a number is fibonacci number or not
• 293 Check if a number is perfect square
• 294 Check if a number is prime or not
• 295 Check if a number is power of another number
• 296 Check if a number is semiprime or not
• 297 Generate Random number
• 298 Catalan number series
• 299 Lychrel number
• 300 Lucas number
• 301 Happy Number
• 302 Abundant Number
• 303 Disarium Number
• 304 Deficient Number
• 305 Twisted Prime Number
• 306 Circular Prime Number
• 307 Narcissistic Number
• 308 Kaprekar Number
• 309 Two Matrix Multiplication
• 310 Two Matrix Addition
• 311 Anticlockwise spiral view of diamond element in matrix
• 312 Duck Number
• 313 Pronic Number
• 314 Harshad Number
• 315 Pell Number
• 316 Automorphic Number
• 317 Mersenne Prime Number
• 318 Fermat number
• 319 Iccanobif Numbers
• 320 Perrin numbers
• 321 GCD of two numbers
• 322 Pattern Programming
• 323 LCM of two numbers
• 324 Alternative sorting of an array elements
• 325 Check if a given array is pairwise sorted or not
• 326 Check if an array is rotated sorted order
• 327 Combine array elements by occurrence sequence
• 328 Factorial of a number
• 329 Check if a matrix is symmetric
• 330 Check number is armstrong or not
• 331 Check number is palindrome or not
• 332 Sort elements by frequency
• 333 Two matrix subtraction
• 334 Sparse matrix implementation
• 335 Count all sorted rows in a matrix
• 336 Count frequencies of negative elements in matrix
• 337 Diagonal bottom up traversal of matrix in 45 degree
• 338 Find the maximum and minimum element in a matrix
• 339 Find distinct common elements in rows of a matrix
• 340 Find maximum element of each row in a matrix
• 341 Print K’th element in spiral form of matrix
• 342 Scalar matrix multiplication
• 343 Find frequencies of even and odd numbers in a matrix
• 344 Reverse the diamond elements in square matrix
• 345 Replace corner element in matrix
• 346 Shift row elements in a matrix
• 347 Rotate each ring of the matrix in anticlockwise form
• 348 Conversion from Decimal to roman number
• 349 Fibonacci sequence
• 350 Find Nth Kynea Number
• 351 Print all combinations of balanced parentheses
• 352 Print all solutions in N-Queen Problem
• 353 Check if matrix is lower triangular
• 354 Check if matrix is upper triangular
• 355 Bubble Sort Program
• 356 Count Sort Program
• 357 Even Odd Sort
• 358 Insertion Sort
• 359 Quick Sort Example
• 360 Radix sort example
• 361 Selection Sort
• 362 Shell Sort
• 363 Count divisible pairs in an array
• 364 Count subarray with given sum
• 365 Display Inversions pairs in array
• 366 Find Equilibrium index of given array
• 367 Find all symmetric pairs in an array
• 368 Find element that appears only once in array
• 369 Find floor and ceil of a number in sorted array
• 370 Find k closest numbers in an unsorted array
• 371 Find max length subarray with given sum
• 372 Find max sum subarray in an array
• 373 Rotate middle diamond element in matrix by clockwise
• 374 Rotate middle diamond element in matrix by anticlockwise
• 375 Swap diagonal elements in matrix
• 376 Reverse column elements of diamond shape in matrix
• 377 Square of diagonal elements in matrix
• 378 Print Half clockwise and Half anticlockwise spiral view of a matrix
• 379 Find out normal and trace in square matrix
• 380 Determine whether matrix is Markov matrix or not
• 381 Find if given matrix is Toeplitz or not
• 382 Find the row with maximum number of 1s
• 383 Rotate a Matrix by 180 degree
• 384 Print matrix in snake pattern
• 385 Program to check idempotent matrix
• 386 Find missing elements from an array
• 387 Find pair with greatest product in array
• 388 Find the rotation count in rotated sorted array
• 389 Split the array and add the first part to end
• 390 Sort elements in sorted and rotated array
• 391 Sort a given binary array
• 392 Sort an array of 0s 1s and 2s
• 393 Segregate positive and negative numbers in array
• 394 Find the largest pair sum in an unsorted array
• 395 Move all zeroes to end of array
• 396 Find smallest element in sorted rotated array
• 397 Reorder an array according to given indexes
• 398 Merge two sorted arrays without extra space
• 399 Print all possible combinations of given sum from 1 to n
• 400 Swap the elements of lower and upper triangular matrix
• 401 Sum of k smallest elements in array
• 402 Sum of k largest elements in array
• 403 Check whether binary tree is form of max heap
• 404 Check whether binary tree is form of min heap
• 405 Pascal's triangle patterns
• 406 Print all possible paths from top left to bottom right of matrix
• 407 Pyramid Programs
• 408 Print all distinct pairs with given difference in array
• 409 Find the largest and second largest element in an array
• 410 Find the largest and smallest element in array
• 411 Find the nearest smaller element on left side in an array
• 412 Find the smallest and second smallest element in an array
• 413 Find minimum element of each row in a matrix
• 414 Find minimum element in each column of the matrix
• 415 Find maximum element in each column of the matrix
• 416 Swap characters in string
• 417 Find k closest numbers in an unsorted array
• 418 Check if a given array is form of max heap
• 419 Check if a given array is form of min heap
• 420 Find k largest elements in array
• 421 Find k smallest elements in array
• 422 Find kth largest element in array
• 423 Find kth smallest elements in array
• 424 Find maximum element in min heap
• 425 Find minimum element in max heap
• 426 Iterative Heap Sort
• 427 Find the median in a running stream of integers
• 428 Heap sort in decreasing order using min heap
• 429 K maximum sum combinations from two arrays
• 430 K minimum sum combinations from two arrays
• 431 Max heap to min heap conversion
• 432 Min heap to max heap conversion
• 433 Merge Two Binary Min Heap Tree
• 434 Merge two Binary Max Heap Tree
• 435 Print all nodes less than a given value in a Min Heap
• 436 Print all nodes less than a given value in a Max Heap
• 437 Display Wave Patterns
• 438 Display Staircase Pattern
• 439 Draw Swastika Pattern
• 440 Display mirror image of swastika pattern
• 441 Display Kite Pattern
• 442 Display Hut Star Pattern
• 443 Display Trapezium Pattern
• 444 Print Left Arrow Patterns
• 445 Print Right Arrow Patterns
• 446 Print H pattern
• 447 Check balanced parentheses using Stack
• 448 Display Butterfly Pattern
• 449 Print rhombus pattern
• 450 Execute BFS in disconnected graph
• 451 Bellman Ford Algorithm
• 452 Check if graph is strongly connected or not
• 453 Clone a Directed Graph
• 454 DFS for disconnected graph
• 455 Show degree of vertex in directed graph
• 456 Iterative Depth First Search
• 457 Find a universal sink of a given directed graph
• 458 Dijkstra’s shortest path algorithm
• 459 Find Sum of dependencies in a graph
• 460 List all negative cycles in directed graph
• 461 Maximum weight cycle in an directed graph
• 462 Maximum weight cycle in an undirected graph
• 463 Minimum weight cycle in an directed graph
• 464 Minimum weight cycle in an undirected graph
• 465 Show path in Bellman Ford algorithm
• 466 Print all path in Dijkstra’s algorithm
• 467 Program For Sine-Wave Pattern
• 468 Print X patterns
• 469 Print all cycle in graph by given length
• 470 Find minimum weight cycle on every node of a graph
• 471 Floyd Warshall Algorithm
• 472 Print K pattern
• 473 Print V pattern
• 474 Print Z pattern
• 475 Print A pattern
• 476 Camel Case Program
• 477 Check if stack elements are pairwise consecutive
• 478 Print all Spanning Tree in Graph
• 479 Print Ugly Numbers
• 480 Capitalize each word in string
• 481 Capitalize first letter in word
• 482 Check pangrams in given string
• 483 Check if a string is substring of another string
• 484 Check if a string is suffix of another string
• 485 Check if one string is a subsequence of another string
• 486 Check if two given strings are isomorphic
• 487 Transform string character to opposite case
• 488 Find and replace given pattern by given character
• 489 Move all spaces at beginning of string
• 490 Move all spaces at end of string
• 491 Move all spaces at the middle of string
• 492 Print all rotations in string
• 493 Print all substrings of a given string
• 494 Remove extra spaces from a string
• 495 Remove numbers from string
• 496 Sum of digits in a string
• 497 Find number of uppercase and lowercase letters in a string
• 498 Remove spaces from a given string
• 499 Distinct permutations of the string
• 500 Check if given number is stable or unstable
• 501 Check if number is power of 2
• 502 Convert Binary to Decimal number
• 503 Convert Binary to Hexadecimal number
• 504 Convert Binary to Octal number
• 505 Convert Octal to Binary number
• 506 Convert decimal to binary number
• 507 Convert decimal to hexadecimal number
• 508 Convert decimal to octal number
• 509 Convert octal to decimal number
• 510 Convert octal to hexadecimal number
• 511 Convert hexadecimal to binary number
• 512 Convert hexadecimal to decimal number
• 513 Convert hexadecimal to octal number
• 514 Find the factors of a number
• 515 Find the frequency of digits in a number
• 516 Find the frequency of each digit in a number
• 517 Find nth last digit of a number
• 518 Find number of digits in a number
• 519 Warnsdorff’s algorithm for knight’s tour problem
• 520 Print N pattern
• 521 Find duplicate rows in a binary matrix
• 522 Calculate area of circle
• 523 Calculate area of rectangle
• 524 Calculate area of triangle
• 525 Find area of parallelogram
• 526 Calculate area of trapezoid
• 527 Find the sum of factors of a given number
• 528 Find the sum of all odd factors of a number
• 529 Find the sum of all even factors of a number
• 530 Display Trinomial triangle
• 531 Display Hosoya’s Triangle
• 532 Print Fibonacci triangle
• 533 Calculate area of right angle triangle
• 534 Calculate area of equilateral triangle
• 535 Calculate area of square
• 536 Find area of Icosahedron
• 537 Find volume of Icosahedron
• 538 Find the area of pentagon
• 539 Find the area of ellipse
• 540 Find the surface area of pentagonal prism
• 541 Find the surface area of sphere
• 542 Find the surface area of Hexagonal Prism
• 543 Find the volume of hexagonal prism
• 544 Find the surface area of cube
• 545 Find the volume of cube
• 546 Find the volume of a cylinder
• 547 Find the volume of a cone
• 548 Find the volume of a sphere
• 549 Display S symbol pattern
• 550 Print Floyd's triangle
• 551 Find the length of circular linked list
• 552 Print a given matrix in reverse waveform
• 553 Print matrix in z form
• 554 Print a given matrix in waveform
• 555 Delete middle element of a stack
• 556 Evaluate postfix expression
• 557 Find the next greater element on right side
• 558 Reverse a number using stack
• 559 Implementation stack using linked list
• 560 Sort array using stack
• 561 Print all palindromic paths from top left to bottom right
• 562 Print Y pattern
• 563 Print double headed arrow pattern
• 564 Print the horizontal ladder pattern
• 565 Print B star pattern
• 566 Print reverse floyd's triangle
• 567 Print the Pentagonal pattern
• 568 Print the hollow Pentagonal pattern
• 569 Print the ladder pattern
• 570 Print G pattern
• 571 Print the R pattern
• 572 Print diagonal star pattern
• 573 Print W pattern
• 574 Print the octagonal pattern
• 575 Print M pattern
• 576 Print Hut Star Pattern
• 577 Print hexagonal star pattern
• 578 Transform string to url slug
• 579 Display leibniz harmonic Triangle
• 580 Print rectangle pattern
• 581 Calculate simple interest
• 582 Calculate compound interest
• 583 Print cube star pattern
• 584 Print L pattern
• 585 Print Heart pattern
• 586 Print X inside rectangular box
• 587 Print star pattern
• 588 Check leap year
• 589 Find all triplets with zero sum
• 590 Find three largest element in array
• 591 Find three smallest element in array
• 592 Reverse the array elements
• 593 Segregate even and odd numbers in array
• 594 Move all negative elements at the beginning of array
• 595 Shuffle the array elements
• 596 Print flying machine pattern
• 597 Find average of array
• 598 Find maximum sum subarray of given size
• 599 Segregate 0s and 1s in an array
• 600 Random traversal of binary search tree
• 601 Find distance between two nodes of a Binary Search Tree
• 602 Binary Tree to Binary Search Tree Conversion
• 603 Determine whether given two BST are identical or not
• 604 Print all paths from root node to leaf
• 605 Print all paths from leaf node to root
• 606 Iterative postorder traversal
• 607 Find the sum of longest path from root to leaf node
• 608 Find the sum of maximum depth nodes of Binary Tree
• 609 Sum of leaf nodes at minimum level
• 610 Print all the nodes at certain level in a binary tree
• 611 Find the area of a Hexagon
• 612 Find the area of a Octagon
• 613 Find the surface area of a cone
• 614 Find the surface area of a torus
• 615 Find the volume of a torus
• 616 Find surface area of dodecahedron
• 617 Find surface area of octahedron
• 618 Find surface area of hemisphere
• 619 Find volume of Hemisphere
• 620 Find surface area of cuboid
• 621 Find volume of cuboid
• 622 Split a number into three parts
• 623 Generate multiplication table of given number
• 624 Find next node of same level of given key in binary tree
• 625 Display 6 pointed star pattern
• 626 Check if two arrays are identical or not
• 627 Sum of two binary strings
• 628 Roman to decimal conversion
• 629 Find the triangle area by using sas
• 630 Convert degree to radian
• 631 Convert radian to degree
• 632 Convert milliradian to degree
• 633 Convert gradian to degree
• 634 Convert gradian to radian
• 635 Convert celsius to kelvin
• 636 Convert kelvin to celsius
• 637 Convert kelvin to fahrenheit
• 638 Convert fahrenheit to kelvin
• 639 Convert fahrenheit to celsius
• 640 Convert celsius to fahrenheit
• 641 Convert the square yard to square meter
• 642 Convert the square metre to square yard
• 643 Convert the square foot to square yard
• 644 Convert the square inch to square yard
• 645 Convert hectare to square kilometer
• 646 Convert hectare to square yard
• 647 Print collate shape of given size
• 648 Print L shape of given size
• 649 Print chevron shape of given size
• 650 Reverse a queue using stack
• 651 Dynamic Programming
• 652 Sum of unique elements in array
• 653 Count internal nodes in binary tree
• 654 Count leaf nodes in binary tree
• 655 Find the minimum node in a binary tree
• 656 Find the max key in a binary tree
• 657 Find if there is a subarray with 0 sum
• 658 Find all common elements in two arrays
• 659 Find the most repeated element in an array
• 660 Find first repeating element in array
• 661 Print all subarrays with 0 sum
• 662 Find all missing elements of a range
• 663 Find the unique elements in array
• 664 Check whether given two sets are disjoint or not
• 665 Find all distinct divisible pairs in array
• 666 Check if array is subset of another array
• 667 Find a longest length word in Trie
• 668 Check if two strings are equal
• 669 Reverse the string elements
• 670 Sum of two string numbers
• 671 Find largest number in string
• 672 Reverse words in a given string
• 673 Rotate each words in a string
• 674 Left and right rotation of string
• 675 Count number of words in a string
• 676 Find the length of longest word in string
• 677 Find longest word in string
• 678 Remove specific word from string
• 679 Sum of numbers in string
• 680 Construct BST from level order traversal
• 681 Find minimum node in binary search tree
• 682 Find maximum node in binary search tree
• 683 Merge K sorted linked lists
• 684 Convert string to number
• 685 Replace substring with a another string
• 686 Find longest substring of unique characters
• 687 Find longest substring with repeating characters
• 688 Reverse alternate k characters in a string
• 689 Remove consecutive duplicate characters in a string
• 690 Find left leaf node in a binary search tree
• 691 Find right leaf node in a binary search tree
• 692 Second smallest element in BST
• 693 Check if a number is divisible by 4
• 694 Multiply two string numbers
• 695 Remove consecutive vowels from string
• 696 Count special characters in string
• 697 Remove vowels from a string
• 698 Count number of vowels in a string
• 699 Print isosceles trapezoid shape
• 700 Print simple 5 point star pattern
• 701 Reverse string using recursion
• 702 Reverse a number using recursion
• 703 Reverse array using recursion
• 704 Reverse linked list using recursion
• 705 Recursive Bubble Sort
• 706 Reverse stack using recursion
• 707 Reverse queue using recursion
• 708 Recursive selection sort
• 709 Recursive insertion sort
• 710 Level Order Tree Traversal Using Recursion
• 711 Print stack in reverse order
• 712 Find second largest element in an array using recursion
• 713 Find a missing number in an array
• 714 Find element in sorted rotated array
• 715 Find median of two sorted arrays
• 716 Find smallest pair sum in an array
• 717 Count number of occurrences in a sorted array
• 718 Find fixed point in array
• 719 Find pairs with given difference in array
• 720 Find peak element in array
• 721 Find common elements in three sorted array
• 722 Find the closest pair from two sorted arrays
• 723 Find pair with given sum in sorted and rotated array
• 724 Find a pair with maximum product in array
• 725 Find unique elements in sorted array
• 726 Find floor of a number in a sorted array
• 727 Merge sort
• 728 Comb Sort
• 729 Cycle Sort
• 730 Bogo Sort
• 731 Stooge Sort
• 732 Cocktail Sort
• 733 Gnome Sort
• 734 Introsort
• 735 Timsort
• 736 Tree sort
• 737 Bitonic Sort
• 738 Smoothsort
• 739 Pancake Sort
• 740 Pigeonhole Sort
• 741 Tag Sort
• 742 Draw a chart
• 743 Count inversions in an array
• 744 Count all pairs of given product
• 745 Find middle element in circular linked list
• 746 Bubble sort using two stack
• 747 Sort linked list using recursion
• 748 Sum of n natural numbers
• 749 Sum of natural numbers in a range
• 750 Sum of n fibonacci numbers
• 751 Postfix to prefix conversion
• 752 Postfix To Infix Conversion
• 753 Prefix to Postfix Conversion
• 754 Prefix to infix conversion
• 755 Infix to prefix conversion
• 756 Infix to postfix conversion
• 757 AVL Tree Insertion
• 758 AVL Tree Deletion
• 759 AVL tree with duplicate key
• 760 Red Black Tree insertion
• 761 Splay tree insertion
• 762 Splay tree deletion
• 763 Word Break Problem
• 764 Print the given geometric progression
• 765 Find N-th element in geometric progression series
• 766 Find the sum of geometric series
• 767 Find the length of longest arithmetic progression
• 768 Remove all the Even digit sum nodes from a circular linked list
• 769 Round Robin Scheduling
• 770 FCFS CPU Scheduling
• 771 FCFS Disk Scheduling Algorithm
• 772 SSTF Disk Scheduling
• 773 Find the largest absolute value in array
• 774 Find minimum element in array using recursion
• 775 Find max element in array using recursion
• 776 Strand Sort
• 777 Solve Sudoku Puzzle
• 778 Sudoku Puzzle Generator
• 779 Add two polynomials using Linked List
• 780 Convert a number from decimal to other base
• 781 Calculate power of a number using recursion
• 782 Add two numbers using bitwise operators
• 783 Generating Pythagorean Triples
• 784 Number system conversion
• 785 Find the union of two sorted arrays
• 786 Modular multiplicative inverse
• 787 Multiplication of two polynomials using linked list
• 788 Find modular node in a linked list
• 789 Find loop node in linked list
• 790 Find first node of loop in a linked list
• 791 Find the balanced node in a linked list
• 792 Find fractional node in linked list
• 793 Find all subset sum in a linked list
• 794 Sort a linked list using merge sort
• 795 Quicksort on singly linked list
• 796 Remove vowels from linked list
• 797 Arrange vowels and consonants in a linked list
• 798 Find a extra node in two linked list
• 799 Clone a linked list with next and random field
• 800 Find sum of all perfect numbers in linked list
• 801 Sum of factorials of prime numbers in linked list
• 802 Find probability of a key in linked list
• 803 Count frequency of key in linked list
• 804 Sum of all odd frequency nodes of the linked list
• 805 Find product of the alternate nodes of linked list
• 806 Subtraction of the alternate nodes of linked list
• 807 Sum of nodes in a linked list
• 808 Calculate product of linked list nodes
• 809 Find all unique elements in linked list
• 810 Count minimum frequency elements in a linked list
• 811 Count all prime nodes of a linked list
• 812 Sum of palindromic numbers in a linked list
• 813 Arrange even and odd elements of a linked list
• 814 Find second largest element in linked list
• 815 Find largest element in linked list
• 816 Find the largest and second largest node in a linked list
• 817 Find largest and smallest elements in linked list
• 818 Find the first duplicate element in the linked list
• 819 Find a peak element in linked list
• 820 Find intersection point of two linked list
• 821 Bitonic point in the given linked list
• 822 Check if a number is jumbled or not
• 823 Sieve of eratosthenes
• 824 Sieve of Atkin
• 825 Sieve of Sundaram
• 826 Bitwise Sieve
• 827 Delete even nodes from linked list
• 828 Delete odd nodes from linked list
• 829 Remove all common nodes in two linked lists
• 830 Delete all non prime nodes in linked list
• 831 Segregate prime and non prime nodes in a linked list
• 832 Find sum and product of prime nodes in linked list
• 833 Find average of all nodes in a linked list
• 834 Find sum and product of divisible key in linked list
• 835 Sort the linked list elements by node frequency
• 836 Find the maximum sum from root to leaf path in Binary Tree
• 837 Print cousins of given node in a binary tree
• 838 Flatten binary tree in order of post-order traversal
• 839 Flatten a binary tree into linked list
• 840 Flatten binary tree nodes in level order from
• 841 Extract leaves of a binary tree in a doubly linked list
• 842 Find top three elements in binary tree
• 843 Find all duplicate subtrees in binary tree
• 844 Tilt of binary tree
• 845 Delete leaf node with given value
• 846 Delete entire nodes of a binary tree
• 847 Rod Cutting Problem
• 848 Reverse a string using stack
• 849 Reverse each word in a string
• 850 Check a number for permutable prime
• 851 Check if a number is primorial prime or not
• 852 Powerful Number
• 853 Check if a given number is factorial of other
• 854 Check if number is a prime power number
• 855 Check if a number is a mystery number
• 856 Find Nth odd fibonacci number
• 857 Find Nth even fibonacci number
• 858 Find the next fibonacci number
• 859 Find the previous fibonacci number
• 860 Count digits in a factorial
• 861 Count all perfect divisors of a number
• 862 Find average of levels in binary tree
• 863 Print binary tree level in sorted order
• 864 Check if given number is emirp number or not
• 865 Count of common divisible of two numbers in a range
• 866 Check whether a number is duck number or not
• 867 Count all x divisible number in a range
• 868 Check if a number is an unusual number or not
• 869 Count Even and Odd numbers in a range
• 870 Check if a number is Triperfect Number
• 871 Count factorial numbers in given range
• 872 Count the number of possible triangles
• 873 Print the nodes at odd levels of a tree
• 874 Print the nodes at even levels of a tree
• 875 Print Levels of all nodes in a Binary Tree
• 876 Print all palindromic levels of a binary tree
• 877 Print all prime levels of a binary tree
• 878 Print all nodes between the given two levels of a binary tree
• 879 Print alternate nodes in level order of a binary tree
• 880 Print all K-sum levels in a Binary Tree
• 881 Print all subsequences of given size
• 882 Generating all possible subsequences
• 883 Rat in a Maze
• 884 Count of common multiples of two numbers in a range
• 885 Print all possible combinations of given size
• 886 Find all solutions in a maze
• 887 Graph coloring
• 888 Print given row in pascal triangle
• 889 Convert given binary tree to its sum tree
• 890 Convert binary tree into min max product
• 891 Check if the number is balanced
• 892 Morris traversal for Postorder
• 893 Morris traversal for Inorder
• 894 Morris traversal for Preorder
• 895 Reverse alternate levels of a binary tree
• 896 Invert the levels of binary tree
• 897 Find longest length subsequence of given sum
• 898 Calculate size of a tree
• 899 Count odd paths in Binary Tree
• 900 Count Even paths in Binary Tree
• 901 Count of Fibonacci paths in a Binary tree
• 902 Size of binary tree without recursion
• 903 Sum of all nodes in a binary tree
• 904 Sum of all left leaves nodes in a binary tree
• 905 Sum of all right leaves nodes in a binary tree
• 906 Find the sum of the node having child node x
• 907 Find sum of all nodes of the given perfect binary tree
• 908 Find the Sum of all full nodes in a Binary Tree
• 909 Print middle level of perfect binary tree
• 910 Find the height of stratified perfect Binary Tree
• 911 Find minimum depth of a Binary Tree
• 912 Check if two trees are mirror
• 913 Check For Symmetric Binary Tree
• 914 Find largest subtree sum in a tree
• 915 Sum of all nodes at given level in Binary Tree
• 916 Find nth node in preorder traversal
• 917 Count the number of visible nodes in Binary Tree
• 918 Count full nodes in a Binary tree
• 919 Count half nodes in a Binary Tree
• 920 Level order traversal with direction change of given intervals
• 921 Replace each node in binary tree with the sum of its inorder predecessor and successor
• 922 Construct Special Binary Tree from given Inorder Traversal
• 923 Construct tree from given string parenthesis expression
• 924 Sum of heights of all every nodes in a binary tree
• 925 Print all subtrees of given sum in binary tree
• 926 Find subtree with given sum in a Binary Tree
• 927 Convert Ternary Expression to a Binary Tree Using Stack
• 928 Check if a given Binary Tree is Sumtree
• 929 Check if leaf traversal of two Binary Trees is same or not
• 930 Check whether a binary tree is a full binary tree or not
• 931 Root to leaf path sum equal to a given number
• 932 Check if all levels of two trees are anagrams or not
• 933 Inplace rotate square matrix by 90 degrees
• 934 Implement Leftist Tree
• 935 Implement Skew Heap
• 936 Euler tour of Binary Tree
• 937 Find number of node exist in Euler Tour of Binary Tree
• 938 Fenwick Tree
• 939 Find the distinct elements common to all rows of a matrix
• 940 Check if the matrix is a binary matrix
• 941 Red Black tree node deletion
• 942 Binomial Heap Node deletion
• 943 Construct Binomial Heap
• 944 Maximum sum path in a Matrix
• 945 Traverse a given Matrix using Recursion
• 946 Convert given Matrix into sorted Spiral Matrix
• 947 Traverse matrix in L shape
• 948 Pattern Searching in Trie tree
• 949 Sort the minor diagonal elements of a matrix
• 950 Sort the major diagonal elements of a matrix
• 951 Display Diagonally Bottom-Up matrix using Recursion
• 952 Find all subsequences with given sum
• 953 Sort matrix elements
• 954 Flood fill Algorithm
• 955 Find leaders in an array
• 956 Stepping Numbers
• 957 Find k-cores of an undirected graph
• 958 Minimum sum path in a Matrix
• 959 Print all possible rotations of a given Array
• 960 Print all left rotations of given array
• 961 Print K th right rotation of array elements
• 962 Print K th left rotation of array elements
• 963 Find maximum element in a sorted and rotated array
• 964 Perform Bitwise XOR in a Binary array
• 965 Calculate the Hamming distance between two strings
• 966 Find a rotation with maximum hamming distance
• 967 RGB to HSL color
• 968 Hex to RGB color
• 969 Convert RGB to hex color
• 970 RGB to HSV color
• 971 Find the whole and fractional part of double number
• 972 HSV to RGB color
• 973 RGB to CMYK color
• 974 CMYK to RGB Color
• 975 HSL to RGB color
• 976 Find the number of islands
• 977 Find maximum triplet in array
• 978 Find the element that appears twice in array
• 979 Find the two duplicate elements in array
• 980 Find the element that appears once in array
• 981 Find the element that appears once in array Set B
• 982 Find the all elements that appears n times
• 983 Implement tower of hanoi using stack
• 984 Tracking present maximum element in a stack
• 985 Tracking present minimum element in a stack
• 986 Sort a stack using recursion
• 987 Sort stack using another stack
• 988 Reverse stack using another stack
• 989 Delete all even elements from a stack
• 990 Remove all particular element from a stack
• 991 Stock Span Problem
• 992 Sort a stack using temporary two stack
• 993 Find the Nth element in array after K left rotations
• 994 Sort a rotated sorted array
• 995 Find element at given index after a number of rotations
• 996 Find the distinct elements in a given array
• 997 Count smaller elements on right side
• 998 Find nearest smallest element of left side in array
• 999 Minimum add to make parentheses valid
• 1000 Bead Sort
• 1001 Bidirectional bubble sort
• 1002 Interpolation Sort
• 1003 Rearrange positive and negative numbers in array
• 1004 Convert number to words
• 1005 Find the minimum distance between two numbers
• 1006 Move all zeros to the beginning of the array
• 1007 Move all zero to middle of array
• 1008 Sum of elements in an array
• 1009 Convert number to digits array
• 1010 Move a given element from end of arrays
• 1011 Find Second largest element in an array
• 1012 Front and Back Search in unsorted array
• 1013 Find minimum distance from zero to other elements
• 1014 Convert linked list to array
• 1015 Find floor and ceil in an unsorted array
• 1016 Find Mean and median of an unsorted array
• 1017 Find max distance between similar occurrences
• 1018 Sum of all distinct elements in array
• 1019 Maximize the median of array elements
• 1020 Distance between two closest minimum elements
• 1021 Find the frequency of a element in array
• 1022 Composite Number
• 1023 Find the composite numbers from 1 to n
• 1024 Find the sum of composite elements in array
• 1025 Find closest number in array
• 1026 Sum of xor of all pairs in an array
• 1027 Hamiltonian Cycle
• 1028 Print all Hamiltonian path present in a graph
• 1029 Count square submatrices with all ones
• 1030 Maximum size square sub-matrix with all 1s
• 1031 Find all pairs in array
• 1032 Find sum of all bitwise and pairs in an array
• 1033 Find all pairs whose sum exists in the array
• 1034 Find all pairs whose sum exists in the array
• 1035 Double the first element and move zero to end
• 1036 Search element in row and column sorted matrix
• 1037 Find the smallest contiguous sum pair in an array
• 1038 Find closest higher value for every element in array
• 1039 Find frequency of smallest element in an array
• 1040 Find kth element in two sorted arrays
• 1041 Magic Square of Odd Order
• 1042 Magic Squares of Even Order
• 1043 Print all intervals of given number
• 1044 Difference between two large numbers
• 1045 Print all palindromic paths of binary tree
• 1046 Cryptarithmetic Puzzle
• 1047 Find longest path in maze
• 1048 Find longest increasing path in a matrix
• 1049 Subset sum using backtracking
• 1050 Find max number using k swap
• 1051 Locate the center path of given maze by using footprint
• 1052 Permutation with spaces
• 1053 Tug of War
• 1054 K partition with equal sum
• 1055 Longest common subsequence
• 1056 Print all longest common subsequence
• 1057 Maximum path sum from leaf to leaf
• 1058 Find safe place in landmines tracks
• 1059 Find all subsets using backtracking
• 1060 Surrounded Regions
• 1061 Generate n bit gray code
• 1062 Find permutation of numbers divisible by k
• 1063 Find all distinct subsets of given sum
• 1064 Find maximum size subset with given sum
• 1065 Split an array into two equal sum subarrays
• 1066 Split array in three equal sum subarrays
• 1067 Split a number into smaller numbers
• 1068 Find all subsequences with given sum and length
• 1069 Find all perfect square root of n digit
• 1070 Find all possible path with one magical key in maze
• 1071 Middle to top down level order traversal in binary tree
• 1072 Print all possible words from phone digits
• 1073 Print the DFS traversal step wise
• 1074 Generate all cyclic permutations of a number
• 1075 Reverse a doubly circular linked list
• 1076 Find sum of even and odd nodes in a linked list
• 1077 Program to unfold a folded linked list
• 1078 Fold Linked List
• 1079 Longest zig zag path in a binary tree
• 1080 Transfer the sum of all contiguous elements to right side zeros in a linked list
• 1081 Selection sort in a linked list
• 1082 Smallest of three integers without comparison operators
• 1083 Count set bits in an integer
• 1084 Turn off the rightmost set bit
• 1085 Find Maximum sum of k consecutive nodes in linked list
• 1086 Maximum sum contiguous nodes in the given linked list
• 1087 Reverse each word in a linked list node
• 1088 Add the given digit to a number stored in a linked list
• 1089 Reverse a sublist in linked list
• 1090 Longest increasing sublist in a linked list
• 1091 Construct BST from given preorder traversal using stack
• 1092 Check if two stacks are equal
• 1093 Add two numbers represented by stack
• 1094 Remove repeated digits in a given number
• 1095 Count total set bits in all numbers from 1 to n
• 1096 Count total bits in a number
• 1097 Count total unset bits in all numbers from 1 to n
• 1098 Find position of all active bits in a number
• 1099 Find position of k-th active bits in a number
• 1100 Find position of rightmost set bit
• 1101 Find most significant set bit of a number
• 1102 Find the kth least significant bit of a number
• 1103 Change all bits after most significant bit
• 1104 Change all odd position bit of a number
• 1105 Toggle all even bits of a number
• 1106 Activate all bits of a number
• 1107 Change first and last bits of a number
• 1108 Check if all bits of a number is active
• 1109 Toggle the last n bits
• 1110 Find nth magic number
• 1111 Swap two bits in an integer
• 1112 Swap all even and odd bits of a number
• 1113 Activate all the even position bits of a number
• 1114 Reverse the bits of a number
• 1115 Implement queue using stack
• 1116 Check whether a given binary tree is complete or not
• 1117 Find largest multiple of 3 in array of digits
• 1118 Efficiently implement n queues in a single array
• 1119 Print top view of a binary tree using level order traversal
• 1120 Implement queue using doubly linked list
• 1121 Priority queue using doubly linked list
• 1122 Deque implementation using doubly linked list
• 1123 Quicksort on doubly linked list
• 1124 Bubble sort on doubly linked list
• 1125 Merge sort on doubly linked list
• 1126 Implement circular queue using linked list
• 1127 Find minimum absolute difference in array
• 1128 Implement priority queue with pair
• 1129 Reverse first k elements of queue
• 1130 Convert binary tree to circular doubly linked list
• 1131 Find mirror of a given node in binary tree
• 1132 Construct a mirror tree from the given binary tree
• 1133 Find the deepest node in binary tree
• 1134 Deepest left leaf node in a binary tree
• 1135 Get level of a node in a binary tree
• 1136 Find sum of all subsets of a given array
• 1137 Print sums of all subsets of a given set
• 1138 Find the length of largest subsequence with positive sum
• 1139 Next greater node in linked list
• 1140 Merge two sorted lists
• 1141 Merge two sorted linked lists using recursion
• 1142 Check if two numbers have opposite signs
• 1143 Hamming distance of two integers
• 1144 Check if a number is bleak
• 1145 Check if a number is power of 8 or not
• 1146 Subtract two numbers using bitwise operators
• 1147 Check if a number has two adjacent active bits
• 1148 Check a number is even or odd without using arithmetic operators
• 1149 Check whether a given number is even or odd
• 1150 Check whether the number has only active first and last bits
• 1151 Count the number of active and inactive bits of a number
• 1152 Check if a number has same number of set and unset bits
• 1153 Add one to given number
• 1154 Conversion from binary to gray code
• 1155 Conversion from gray to binary code
• 1156 Multiplication of two numbers with shift operator
• 1157 Xor of two numbers without using XOR operator
• 1158 Find the length of longest consecutive 1s in binary representation
• 1159 Print first n numbers with exactly two set bits
• 1160 Remove all the even digit sum nodes from a doubly linked list
• 1161 Find the sum of all nodes which is divisible by K in doubly linked list
• 1162 Perform XNOR of two numbers
• 1163 BCD addition of two decimal numbers
• 1164 Generate largest number with given x active and y inactive bits
• 1165 Find all prime factors of a number
• 1166 Print all factors of number in pair
• 1167 Product of factors of number
• 1168 Huffman coding using priority queue
• 1169 Hamming decoding example
• 1170 Canonical Huffman Coding
• 1171 Construct Diamond Tree
• 1172 Print leftmost and rightmost nodes of a binary tree
• 1173 Append the elements of queue in mirror-inverse order
• 1174 Sum of nodes in top view of binary tree
• 1175 Sum and product of internal nodes in binary tree
• 1176 Pairwise swap leaf nodes in a binary tree
• 1177 Product of all leaf nodes of binary tree
• 1178 Print left and right leaf nodes in Binary Tree
• 1179 Construct skewed binary tree
• 1180 Josephus circle using circular linked list
• 1181 Ternary Max heap
• 1182 K-ary Heap
• 1183 Print all the leaf nodes of binary heap
• 1184 Sum of bit differences among all pairs
• 1185 Sum of bit differences for numbers from 0 to N
• 1186 Find the sum of bit differences of numbers using recursion
• 1187 Find the pair with maximum sum in a matrix
• 1188 Pair with maximum difference in a matrix
• 1189 Check if two numbers are equal using bitwise operators
• 1190 Find even occurring elements in an array of limited range
• 1191 Find 1s complement of an Integer
• 1192 Calculate XOR from 1 to n
• 1193 Swap three variables without using fourth variable
• 1194 Active all the bits in given range of a number
• 1195 Swap two numbers using bitwise operator
• 1196 Check whether all the bits are unset in the given range
• 1197 Remove nth bit of a number
• 1198 Shift active bits to the right side
• 1199 Append a set bit in given position of a number
• 1200 Count all unset bit in given range
• 1201 Remove all even parity nodes from linked list
• 1202 Find sum and product of all even digit sum in a Singly Linked List
• 1203 Product of the node values of a Singly Linked List
• 1204 Shift the vowels node at beginning of linked list
• 1205 Print the nodes of linked list at given indexes
• 1206 Find the common nodes in two singly linked list
• 1207 Find K smallest leaf nodes in a given Binary Tree
• 1208 Largest subarray with equal number of 0s and 1s
• 1209 Detect cycle in a linked list in linear time
• 1210 Find union and intersection of two linked lists
• 1211 Find out distance between similar characters in a string
• 1212 Check whether one array is constructed by pair of another array
• 1213 Find the even product pairs in an array
• 1214 Sort map by value in ascending order
• 1215 Calculate GCD using euclid algorithm
• 1216 KMP algorithm for pattern searching
• 1217 Turn off a particular bit in a number
• 1218 Bit difference between two numbers
• 1219 Count number of bits to be flipped to convert A to B
• 1220 Find the sum of bit differences among all pairs
• 1221 Copy set bits in a range
• 1222 Count number with consecutive 1's in given length
• 1223 Check that if given number is expressed sum of consecutive or not
• 1224 Find 2s complement of a binary string
• 1225 Check whether consecutive decreasing active bits exist in a number
• 1226 Check if a number has bits in alternate pattern
• 1227 Find nearest power of 2 less than or equal to a number
• 1228 Highest power of two that divides a given number
• 1229 Find all powers of 2 less than or equal to a given number
• 1230 Find the numbers occurring odd number of times
• 1231 Swap two nibbles in a byte
• 1232 Swap all adjacent bits in given number
• 1233 Swap every two bits in bytes
• 1234 Compare two numbers without using comparison operator
• 1235 Check whether given number is neon number or not
• 1236 Generic root of a number
• 1237 Strong number program
• 1238 Find square root of quadratic equation
• 1239 Check whether a number is positive or negative or zero
• 1240 Group the array elements by occurrence sequence
• 1241 Find longest subarray with 0 sum
• 1242 Longest consecutive subsequence
• 1243 Count distinct elements in every window of given size
• 1244 Check if two arrays are permutations of each other
• 1245 Find all distinct symmetric pairs in an array efficiently
• 1246 Check pair with given product in an array
• 1247 Find common elements in all rows of a given matrix efficiently
• 1248 Find pairs with given sum in an array
• 1249 Convert an array to reduced form
• 1250 Count substring with equal number of 0s 1s and 2s
• 1251 Count pairs whose products exist in array
• 1252 Maximum distance between two occurrences of same element
• 1253 Find the length of each path in binary tree
• 1254 Count the pairs of amicable numbers
• 1255 Check arithmetic progression in array
• 1256 Check if stack contains given array element present or not
• 1257 Print stack elements from Bottom to Top
• 1258 B Tree node insertion
• 1259 K dimensional tree insertion
• 1260 Find the minimum in K dimensional tree
• 1261 Node deletion in K dimensional tree
• 1262 Sum of two numbers represented as arrays
• 1263 Convert the fractional whole number to binary
• 1264 Efficiently find the power of number
• 1265 Construct segment tree from array
• 1266 Find the frequency of characters in a string
• 1267 Print the characters by frequency
• 1268 Find the character having kth largest frequency
• 1269 Top k frequent elements in array
• 1270 Count of elements which are not at the correct position
• 1271 Count of anagrams of each string in between two arrays
• 1272 Print the repeating K digits number in string
• 1273 Check if K palindromic strings can be formed from a given string
• 1274 Count the elements having frequency equal to its value
• 1275 Find uncommon characters of the two strings
• 1276 Check if rearrange of characters can such that no two adjacent are same
• 1277 Count of substrings of length K with exactly K distinct characters
• 1278 Highest power of 2 greater than or equal to given number
• 1279 Check if number is multiple of 3
• 1280 Efficiently multiply a number by 7
• 1281 Finding all subsets of a given set
• 1282 Lucky numbers program
• 1283 Babylonian method for square root
• 1284 Find ceiling in a sorted array
• 1285 Find next bigger number with same number of set bits
• 1286 Merge sort for singly linked list
• 1287 Rabin-karp algorithm for pattern searching
• 1288 Min cost path in matrix
• 1289 Levenshtein edit distance
• 1290 Binomial coefficient using dynamic programming
• 1291 Print all permutations with repetition of characters
• 1292 Longest Bitonic Subsequence
• 1293 Count elements present in first array but not in second
• 1294 Segment tree update query
• 1295 Sum of all even frequency elements in matrix
• 1296 Sum of all maximum frequency elements in matrix
• 1297 Sum of all odd frequency elements in an array
• 1298 Find all odd frequency elements from an Array
• 1299 Find most occurring node in linked list
• 1300 Splitting an array with coprime products
• 1301 Check if two numbers are coprime or not
• 1302 Implement B + Tree
• 1303 Check if a number is Flavius Number
• 1304 Krishnamurthy number program
• 1305 Nelson Number Program
• 1306 Tech Number Program
• 1307 Find the repeating and the missing element using xor
• 1308 Reverse digits of a number
• 1309 Print all initials sequences of given length
• 1310 Check if a number is multiple of 5 or not
• 1311 Knight Tour Problem
• 1312 Calculate power without using division and multiplication
• 1313 DFA based division
• 1314 Find middle of singly linked list using recursion
• 1315 Sum triangle of array using recursion
• 1316 Delete a linked list using recursion
• 1317 Check divisibility by 7 without modulus operator
• 1318 Find the next smallest palindrome in an array
• 1319 Find day of the week for a given date
• 1320 Addition of two numbers by using prefix and postfix
• 1321 Josephus problem using recursion
• 1322 Sum of nodes having sum of subtrees of opposition parties
• 1323 Remove all adjacent duplicate characters using recursion
• 1324 Remove three consecutive duplicates from string
• 1325 Count occurrences of a substring recursively
• 1326 Print k size combinations in given array
• 1327 Check if number is power of 4
• 1328 Check if number is power of 3
• 1329 Check whether a given number is an Polydivisible number or not
• 1330 Check whether the given number is euclid number or not
• 1331 Check whether the given number is moran number or not
• 1332 Check whether the given number is nude number or not
• 1333 Check whether the given number is buzz number or not
• 1334 Check whether the given matrix is latin square or not
• 1335 Convert number to string
• 1336 Unset least K significant bits of a given number
• 1337 Find largest number without using relational operator
• 1338 Find the minimum and maximum of integers without using branching
• 1339 Find the absolute value of integer without using branching
• 1340 Largest sum contiguous subarray
• 1341 Efficiently print all paths in binary tree using recursion
• 1342 Find the first non-repeating character of string
• 1343 Block swap algorithm for array rotation
• 1344 Reversal algorithm for array rotation
• 1345 Clockwise rotation of linked list
• 1346 Clockwise spiral traversal of a binary tree
• 1347 Anticlockwise spiral traversal of a binary tree
• 1348 Reverse Clockwise spiral traversal of a binary tree
• 1349 Reversal Anti clockwise spiral traversal of a binary tree
• 1350 Maximum spiral sum in binary tree
• 1351 Check if array can be sorted with single swap
• 1352 Reverse inorder traversal using morris traversal
• 1353 Check whether given binary is skewed binary tree
• 1354 Longest subsequence having maximum sum
• 1355 Count the number of longest increasing subsequence
• 1356 Print nodes at k distance from root
• 1357 Count the minimum number of elements required to given sum
• 1358 Find nodes which are not part of any cycle in a directed graph
• 1359 Copy linked list using recursion
• 1360 Binary search on singly linked list
• 1361 Recursive selection sort for singly linked list
• 1362 Print node at corresponding level in binary tree
• 1363 Print the middle nodes of each level of a binary tree
• 1364 Print even and odd numbers in given range using recursion
• 1365 Remove all duplicate adjacent characters from a string using stack
• 1366 Count balanced nodes present in a binary tree
• 1367 N ary tree implementation
• 1368 Find the all Kth ancestor nodes in an N-ary tree
• 1369 Print the all leaf nodes in N-ary tree
• 1370 Check if permutation of number is power of 2 or not
• 1371 Find length of longest straight path from a given binary tree
• 1372 Print the longest leaf to leaf path in a binary tree
• 1373 Find the first Sorted path in binary tree
• 1374 Print all sorted path from root to leaf in binary tree
• 1375 Print the longest path from root to leaf in a binary tree
• 1376 Check if a pair of leaf node sum exists in given binary tree
• 1377 Find maximum GCD value in binary tree path
• 1378 Strongly connected components
• 1379 Triple order traversal of a binary tree
• 1380 Double order traversal of a binary tree
• 1381 Split a numeric string into fibonacci sequence
• 1382 Convert given decimal number into an irreducible fraction
• 1383 Maximum Bitwise AND value in binary tree path from root to leaf nodes
• 1384 Find parent of leaf nodes in binary tree
• 1385 Print the nodes of binary tree having a grandchild
• 1386 Nth Pentanacci Number
• 1387 Mountain Sequence Pattern
• 1388 Check if any permutation of string is palindrome
• 1389 Check if inorder of binary tree is form of palindrome or not
• 1390 Count tree paths whose permutation is palindrome
• 1391 Rotate bits of a number
• 1392 Find height of n-ary tree
• 1393 Minimum value node having maximum depth in an N-ary Tree
• 1394 Replace every node with depth in n-ary tree
• 1395 Replace node with depth in a binary tree
• 1396 Sum of nodes in binary tree whose grandparents exists
• 1397 Find perfect square using binary search
• 1398 Find the nearest next perfect square of a number
• 1399 Kth smallest element in a perfect binary search tree
• 1400 Longest subsequence with different adjacent characters
• 1401 Inorder traversal between two binary tree nodes
• 1402 Print path from root to a given node in a binary tree
• 1403 Print all the paths in the binary tree whose xor is non-zero
• 1404 Print node in forward and backward direction in doubly linked list
• 1405 Generating all sub sequence of an array of limited size
• 1406 Generating all subarrays of an array
• 1407 Print reverse character bridge pattern
• 1408 Count the number of ways to traverse a Matrix
• 1409 Digital root of a large number using recursion
• 1410 Find digital root of a large number efficiently
• 1411 Print triangle separated pattern
• 1412 Sum of upper triangle and lower triangle
• 1413 Find the distinct strings present in a given array
• 1414 Treap implementation
• 1415 Number of ways to partition a set into k subsets
• 1416 Print all N digit strictly increasing numbers
• 1417 Print zigzag string pattern
• 1418 Max sum of M non-overlapping subarrays of size K
• 1419 Sum of XOR of all subarrays
• 1420 Sum of XOR of all possible subsets
• 1421 Sort array elements using builtin method
• 1422 Implement interval tree
• 1423 Ternary Search Tree Insertion
• 1424 Huffman Tree Example
• 1425 Ternary Search Tree Deletion
• 1426 Reverse delete algorithm for minimum spanning tree
• 1427 Efficiently implementing adjacency list in directed graph
• 1428 Prim's algorithm using adjacency matrix
• 1429 Prim's algorithm using adjacency list
• 1430 Articulation points in a graph
• 1431 Count number of subgraphs in a graph
• 1432 Check if removing a given edge disconnects a graph
• 1433 Minimum increment operations to make array unique
• 1434 Find surpasser count of each element in array
• 1435 Count pairs with Odd XOR occurrence
• 1436 Remove duplicates from sorted array
• 1437 Random character selection from string
• 1438 Replace elements with greatest element on right side
• 1439 Find the number of repeated words in a string
• 1440 Remove duplicate words from string
• 1441 Print all possible strings of length N in a set
• 1442 Calculate value of ncr efficiently
• 1443 Print all palindromic partitions of a string
• 1444 Coin change problem using recursion
• 1445 Coin change problem using dynamic programming
• 1446 Change gender words in a given string
• 1447 Perform string shifts by intervals
• 1448 Container with most water
• 1449 Equal subset sum partition
• 1450 Minimum time required to rot all oranges
• 1451 Count negative numbers in a sorted matrix
• 1452 Maximum subarray sum modulo M
• 1453 Maximum sum subarray using divide and conquer
• 1454 Maximum circular subarray sum solution
• 1455 Maximum equilibrium sum in an array
• 1456 BST to a tree with sum of all smaller keys
• 1457 Floor value in binary search tree
• 1458 Ceil value in binary search tree
• 1459 Check if two strings differ by one character
• 1460 Edit distance using recursion
• 1461 Calculating edit distance using dynamic programming
• 1462 Permutation coefficient program
• 1463 Toggle alphabet characters in a string
• 1464 Reverse a string without affecting special characters
• 1465 0-1 knapsack problem using dynamic programming
• 1466 Generate all the binary strings of N bits
• 1467 Print all binary strings without consecutive 1s
• 1468 Generate all binary strings from given pattern
• 1469 Check if large number is divisible by 20
• 1470 Check if large number is divisible by 6
• 1471 Check if large number is divisible by 11
• 1472 Check if large number is divisible by 3
• 1473 Number divisible by 8 using bitwise
• 1474 Number divisible by 9 using bitwise
• 1475 Check if large number is divisible by 25
• 1476 Convert string to char array
• 1477 Convert char array to string
• 1478 Find least average subarray of k length
• 1479 Print all palindrome permutations of a string
• 1480 Find maximum average subarray of k length
• 1481 Maximum number of edges in a bipartite graph
• 1482 Find min and max element in a binary tree
• 1483 Find the maximum leaf node in a binary tree
• 1484 Find the minimum leaf node in a binary tree
• 1485 Max average of subtree values in a given binary tree
• 1486 Find minimum subset product of an array
• 1487 Possible ways to break a string using brackets
• 1488 Minimum number of deletion required to make two strings anagram
• 1489 Kth non repeating character in a string
• 1490 Print alphabets from A to Z
• 1491 Minimum number of append character needed to make a string palindrome
• 1492 Minimum number of perpend character needed to Make a string palindrome
• 1493 Minimum number of characters to be removed to make a string alternate
• 1494 Number of flips to make binary string alternate
• 1495 Sort an array which contains 1 to n values
• 1496 Caesar Cipher
• 1497 Split string by word
• 1498 Program to convert string to integer
• 1499 Split the string into N equal parts
• 1500 Example of variable length arguments