en
Feedback
Coding | Practice Questions Daily | C | C++ | Python | Java

Coding | Practice Questions Daily | C | C++ | Python | Java

Open in Telegram

Here we are Posting daily new C, C++, Java & Kotlin questions for practice. Share: https://t.me/coding_practice_questions Be Smart and be the Geek. 🤓💻 Improve your coding skill by solving these questions. Daily 3 questions of different lvl.

Show more
The country is not specifiedThe category is not specified
5 809
Subscribers
No data24 hours
No data7 days
No data30 days

Data loading in progress...

Tags Cloud
No data
Any problems? Please refresh the page or contact our support manager.
Incoming and Outgoing Mentions
---
---
---
---
---
---
Attracting Subscribers
December '24
December '240
in 0 channels
November '24
+5
in 0 channels
Get PRO
October '24
+5
in 0 channels
Get PRO
September '24
+124
in 0 channels
Get PRO
August '240
in 0 channels
Get PRO
July '240
in 0 channels
Get PRO
June '240
in 0 channels
Get PRO
May '240
in 0 channels
Get PRO
April '240
in 0 channels
Get PRO
March '24
+2
in 0 channels
Get PRO
February '240
in 0 channels
Get PRO
January '240
in 0 channels
Get PRO
December '230
in 0 channels
Get PRO
November '230
in 0 channels
Get PRO
October '23
+5 869
in 0 channels
Date
Subscriber Growth
Mentions
Channels
09 December0
08 December0
07 December0
06 December0
05 December0
04 December0
03 December0
02 December0
01 December0
Channel Posts
• FizzBuzz The FizzBuzz challenge is a popular problem in technical interviews. For a given maximum input value n, create a function that outputs integers from 1 to n. But, if an integer is divisible by three, then the number should be replaced with the word “Fizz.” Numbers divisible by five should say “Buzz” instead. And numbers divisible by both three and five should say “FizzBuzz.” For example, with an input of 17, the output should be: [1, 2 , ”Fizz”, 4, “Buzz”, “Fizz”, 7, 8, “Fizz“, “Buzz“, 11, “Fizz”, 13, 14, “FizzBuzz”, 16, 17] Solve in Language : Kotlin or Any Join @coding_practice_questions

2
• Permutation Palindrome A palindrome is a word or phrase that could be spelled the same forward and backward. Examples of palindromes include the words “level” and “racecar” as well as the phrase “taco cat.” Create a function that returns TRUE if an input string is a permutation of a palindrome — that is, if the string could somehow be rearranged to make a palindrome. For example, the strings “racecar,” “carrace,” and “gghhk” should return TRUE, while words such as “tammy” and “code” should return FALSE. For an additional challenge, allow your input to include phrase strings. You’ll need to find a way to remove all spaces in the input string before running your function. Solve in Language : Kotlin or Any Let's see who can solve this first. Join @coding_practice_questions
0