DSA basic

ABHISHEK ANAND Strivers

Brute force method -  check one by one Q1.  Given an integer N, write a program to count the number of digits in N. Time complexity - O(log10(n))   h…