Algorithms and Data Structures

noticable algorithms:

Intermediate:

• generating Uniformed random permutation and subsets for feature roll-out to users.
• generating NONUniformed random request to servers to test inter-arrival times on request distribution.
• Spiral_Ordering in N dimensional arrays with pure python and processing the arrays in shells by controling the direction plus multiple exporation on 2D arrays such as rotation and layer by layer exploration and pascal's triangle
• implemented CStyle arrays (ctypes) and Custom Array Class with preallocated memory with handy sorts of magic methods.
• returning valid IP addresses. ( also can be used with IPLocation service to examine the location of the IP addresses in data pipelines.)
• string-search using rabin-krap algorithm for linear-time complexity.source
• Floyd’s Tortoise and Hare algorithm (also called the cycle detection algorithm)
• Multiple Queue classes for different use cases.
• Multiple approaches for both Recursive and Iterative traversals of Trees plus balancing, completeness and more
• Computing LCA (lowest-common-ancestor); it is an essential calculation when rendering web pages, specifically when computing the Cascading Style Sheet (CSS) that is applicable to a particular Document Object Model (DOM)
• Often data is almost sorted. for example a server receives timestamped stock quotes and earlier quotes may arrive slightly after later quotes becuase of the difference in server loads and network routes. so implementing sorting algorithms based on heap data structure could be the most efficient way of sorting almost sorted streams

Advanced:

• full implementation of heap and Priority Queues
• full implementation of huffman Trees and huffman encoding techniques
• full implementation of Bloom-filter (similar to HashSet API) using Cython and python plus variants hashing mathodology used in HashTables (chaining and open-addressing) + implementing a very tiny email app to poppup 'save contant' if the recipient is not seen.
• full Implementation of three variants of dijoint_sets:
  • arrays
  • linked-list representation
  • compression path (using custom Info class)

and full implementation of their applications (connected components on an unidrected graph(both traditional DFS appraoch(for static graphs) and disjoint_sets approach(for dynamic graphs)))