The array is a data structure that designed to store the group of homogeneous objects. The array element accessed by index.
The array can be bit array, dynamic array, parallel array, variable length array. The Array can be used when the data need access based on the index and maintain the insertion order. The deletion may take some extra effort.
Array section explains how to implement the Array and various applications related with Array operation.
|137 Find a pair of elements from an array || Write a program to find the pair of numbers from the array . |
|138 Boyer Moore string search algorithm || Boyer Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. Write a program to implement Boyer Moore string search algorithm |
|139 Knuth Morris Pratt string searching algorithm || String searching algorithm helps to search the occurrences of the word within the text string. Write a program to implement Knuth Morris Pratt string searching algorithm. |
|140 Karp Rabin algorithm is a string searching algorithm || Karp Rabin algorithm is a string searching algorithm that uses hashing to find any one of a set of pattern strings in a text.It mainly useful for detecting plagiarism. Write a program to implement Karp Rabin algorithm. |
|141 Regular expression matching || Write a program to implement Regular expression matching. If you give the string and expression, the program should match the regular expression. |
|142 Burrows Wheeler transform || Burrows Wheeler transform helps rearranges a character string into runs of similar characters and useful for string comparison. Write a program to implement Burrows Wheeler transform. |
|143 Huffman coding || Huffman coding is a lossless data compression algorithm that derives the table based on the estimated frequency of occurrence for each possible value of the source symbol. |
|144 Run-length encoding || Run-length encoding is a very simple form of data compression in which runs of data are stored as a single data value and count, rather than as the original run. |
|145 Longest palindromic substring || Write a program to find a maximum-length contiguous substring of a given string that is also a palindrome. |
|146 Word Break in Java || Break a string of characters of length n into a sequence of valid words. Assume that there is a data structure that tells you if a string is a valid word in constant time. |
|147 Median of two sorted array || Write a program to find meidan of the two sorted arrays |
|148 Regular expression matching || Write a program to implement Regular expression matching. If you give the string and expression, the program should match the regular expression. |
|149 Insert interval || Write a program to Insert interval |
|150 Two sum from array || Write a program to give two sum from array |
|151 Three sum from array || Write a program to give three sum from array |
|152 String to integer || Write a program convert from string to integer |
|153 Merge Sorted using Array || Write a program to sort the array of numbers using merge sort |
|154 Implement strstr using array || Write a program to implement strstr using array. |
|155 Edit distance || Edit distance is a way of quantifying dissimilar of two strings. The strings are to one another by counting the minimum number of operations required to transform one string into the other. |
|156 Integer to string || Write a program to convert integer to string. |