DD's Gibberish

A blog dedicated to coding

Pages

  • Tech Blog
  • Astronomy Blog
  • Personal Blog
Showing posts with label Complexity. Show all posts
Showing posts with label Complexity. Show all posts

Tuesday, March 2, 2021

Powers of 2 to remember for scalability questions

 





O(log N)
O(N)
O(N log N)
O(N^2)
O(2^N)
O(N!)

Source: Cracking the coding interview

Posted by dhiviya dhanasekar at 1:49 AM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: Complexity, System design
Older Posts Home
Subscribe to: Posts (Atom)

Labels

Algo Animations API Client Arrays ASCII async Atoms await BFS Binary Bit BST C Class Closure Code Complexity Crypto CS265 CSS DFS DOM Manip Dynamic Programming EventListeners File Fun Game Heap HTML Interview Java Javascript Jquery Leetcode LinkedList Map Matrix OOP Personal Project PHP Promise Python React Recursion Regex SASS Sort SQL SRE Stacks Strings SVG System design Traversal Tree Web development Web mining

Blog Archive

  • ▼  2021 (44)
    • ▼  June (2)
      • Get Distinct Shapes
      • Star Rating System
    • ►  May (2)
    • ►  April (21)
    • ►  March (14)
    • ►  February (5)
  • ►  2019 (1)
    • ►  February (1)
  • ►  2017 (2)
    • ►  April (1)
    • ►  March (1)
  • ►  2016 (20)
    • ►  August (7)
    • ►  July (8)
    • ►  June (1)
    • ►  March (4)
  • ►  2015 (61)
    • ►  November (1)
    • ►  September (14)
    • ►  August (46)

Total Pageviews

Watermark theme. Powered by Blogger.