👨‍💻
Cracking-Interview
Ctrlk
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
  • Stack and Queue
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
  • Dynamic Programming
  • Greedy Algorithms
  • Backtracking
  • Sub Array and Sliding Window Problems
  • Design
  • Maths
    • Formula
    • 1.Count Prime
    • 2.Pascal's Triangle
    • 3.Extra Long Factorials
    • 4.Factorial Trailing Zeroes
    • 5.Excel Sheet Column Number
    • 6.HCF and LCM
    • 7. Fizz Buzz
    • 8. Rearrange an array so that arr[i] becomes arr[arr[i]]
    • 9. XOR Queries of a Subarray
    • 10. Find second largest element
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • 💾DBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • 🖥️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • 🚙OOPS
    • Introduction and Definitions
  • 📨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
Powered by GitBook
On this page

Was this helpful?

Maths

1.Count Prime2.Pascal's Triangle4.Hamming Distance3.Extra Long Factorials4.Factorial Trailing Zeroes5.Excel Sheet Column Number6.HCF and LCM7. Fizz Buzz8. Rearrange an array so that arr[i] becomes arr[arr[i]]9. XOR Queries of a Subarray10. Find second largest element

Some Formula of Maths

Formula

Previous3. Snapshot ArrayNextFormula

Last updated 4 years ago

Was this helpful?