Sign in

Regular expressions, or regexes, are written in a condensed formatting language. In general, you can think of a regular expressions as a pattern which you give to a regex processor with some source data. The processor then parses that source data using that pattern, and returns chunks of text back for further manipulation.

There are three main reasons you would want to do this :

  • To check whether a pattern exists within some source data
  • To get all the instances of a complex pattern from some source data
  • To clean your source data using pattern generally through string splitting.


This algorithm is used to detect cycle in linked list.

Floyd’s cycle finding algorithm is a pointer algorithm which uses two pointers to find cycle in the given linked list.

Lets see how this algorithm uses these two pointers ---->

One pointer moves two step at a time while the other one moves one step at a time, this is somewhat like the story we have heard in our childhood in which hare 🐇 move faster than the tortoise 🐢 that is why it is also known as Hare and Tortoise algorithm.

If at some point of time, these two…

Aman Jamshed

If you're trying, you're already winning!🥂

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store