feat: add new questions for bs23

Co-authored-by: Moursalin Emon <[email protected]>

docs/companies/bs23.md

@@ -104,4 +104,64 @@ In the context of the Software Development Life Cycle (SDLC), which model emphas
 </article>
 
 ## Onsite Coding Round
-This round is a mixture of coding problems and MCQs. The topics are the same as the online MCQ round.
+This round is a mixture of coding problems and MCQs. The topics are the same as the online MCQ round.
+
+<article>
+
+Given a number `n`, write a program to reverse the digits of the number
+</article>
+
+<article>
+
+Given a number `n`, write a program to find if the number is an armstrong number or not.
+
+An Armstrong number is a number that is equal to the sum of its digits, each raised to the power of the number of digits in the number. For example, `153` is an Armstrong number because `1^3+5^3+3^3=153`
+</article>
+
+<article>
+
+Write a program to print a string by removing 
+- leading, trailing space, 
+- if there's two or more space between two chars replace it with one space.
+</article>
+
+<article>
+
+Write a program which will do the following for i = 1 to N . 
+- if i is divisible by 3 then print 'Star', 
+- if i is divisible by 5 'Coder' 
+- if i is divisible by 3 and 5 both print 'StarCoder' 
+- else just print the number
+</article>
+
+<article>
+
+Given an array and k, print the array after k right shift
+</article>
+
+<article>
+
+Given a number `n`, print its factorial i.e. `n!`
+</article>
+
+<article>
+
+Given an unsorted array, print the longest size of consecutive elements: 
+
+Ex: Input: `5 3 2 1` After Sort: `1 2 3 5` Ans: `3`
+</article>
+
+<article>
+
+Given two integers N (upto 18 digits) and M(≤100):
+Digits of the New Number:
+- The new number should be formed by permuting the digits of N.
+- The new number must not have any leading zeros.
+- The new number must be divisible by M.
+find the num of numbers that match these conditions.
+```
+Input: 104 2
+Output: 3
+→104, 140, 410
+```
+</article>