CSS-Typography

rohit-br-k — Sat, 11 Sep 2021 17:06:23 +0000

Typography is a main thing when it comes to front-end designing.
Here, we can look more into typography tips.👇

Font-family 😊

1.In font-family, mostly we can use serif and sans-serif.sans- 

 serif is widely used in modern-websites and we can use serif 

 in luxury websites.

2.In sans-serif , we can use Inter, Opensas, roboto, 

   Montserrat , worksans , lato etc

3.In serif , we can use Merriweather, aleso, playfair-display, 

   cormorant , cardo, lora etc

font-size😒

1.Normal text 16px-32px

2.font-size of Long text can be more than 20px.

3.Headlines 50px and font-weight:600

4.For any text don't go more than font-weight:400 expect 

  headlines

paragraphs🤦‍♂️

1.Don't make paragraph so long and Use less than 75 characters 

 per line.

2.if paragraphs are long , user's will find it difficult to 

 read the information that you are trying to convey through 

 it.

line-height😢

1.For Normal text, line-height should be in between 1.5 and 2

2.For big Text go for less than 2

Letter-spacing👌

1.Decrease letter spacing in headlines

2.For small headlines , make every letter in uppercase With 

  low letterspacing

Don't do🤞

1.Don't justify text

2.Small blocks are fine

3.Don't center long text blocks

Thanks so much for your awesome time. Let's get together again soon.

Circular Queue using python..!

rohit-br-k — Thu, 02 Sep 2021 07:35:42 +0000

Queue is similar to stack but it follows F.I.F.O method.

Queue can developed by using normal python list and also with linked-list.Here,Queue with linked-list is preferred because time-complexity and space-complexity is good compared to Queue with normal python list.

In Queue with python list, the enqueue and dequeue will end in worst case with increase in inputs.So,the better version of this is circular queue.

Circular Queue is used in Traffic System,Memory Management,CPU Scheduling But here with increase in data's the time-complexity will become worst but space complexity can be reduced with fixed size.So it's always good to implement Queue using linked list if time-complexity is preferred.

We can look into the implementation of Circular Queue in python:
Here we go,

#we need Queue class to initialize fixed empty list with start and top
class CircularQ:
    def __init__(self,maxSize):
        self.data = maxSize *[None]
        self.maxSize = maxSize
        self.start = -1
        self.top = -1
    def __str__(self):
        return str(self.data)

    def isEmpty(self,value):
        if self.top and self.star == -1:
            return True
        else:
            return False

    def isFull(self):
        if self.top+1 == self.maxSize and self.start == 0:
            return True
        elif self.start+1 == self.top:
            return True
        else:
            return False

    def insert(self,value):
        self.top+=1
        self.data[self.top] = value
        self.start=0

    def delete(self):
        first = self.data[self.start]
        start = self.start

        if self.start == self.top:
            self.start =-1
            self.top=-1

        elif self.start+1 == self.maxSize:
            self.start = 0

        else:
            self.start+=1
        self.data[start] = None
        return first



circular = CircularQ(5)
circular.insert(1)
circular.insert(2)
circular.insert(3)
circular.insert(4)
circular.insert(5)
circular.delete()
circular.delete()
print(circular)

Thank You,
I hope everyone will have a good health and a better future...!!

You Can Support Me..👇

DEV Community: rohit-br-k