A complete guide to writing great answers on RBR Forum
A great answer does more than just provide the correct option. It teaches the reader why the answer is correct and how to approach similar problems.
RBR Forum uses Markdown for formatting and KaTeX for math rendering. Here are the essentials:
**bold text***italic text*~~strikethrough~~> This is a blockquote- Item one
- Item two
- Nested item1. First step
2. Second step
3. Third step[Link text](https://example.com)| Header 1 | Header 2 |
|----------|----------|
| Cell 1 | Cell 2 |
| Cell 3 | Cell 4 |Use backticks for inline code and triple backticks for code blocks.
Use `printf("hello")` to print output.Add the language name after the opening triple backticks for syntax highlighting:
```c
#include <stdio.h>
int main() {
int arr[] = {64, 25, 12, 22, 11};
int n = sizeof(arr) / sizeof(arr[0]);
// Bubble sort
for (int i = 0; i < n - 1; i++)
for (int j = 0; j < n - i - 1; j++)
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
printf("Sorted array: ");
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
``````python
def binary_search(arr, target):
low, high = 0, len(arr) - 1
while low <= high:
mid = (low + high) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
low = mid + 1
else:
high = mid - 1
return -1
```Supported languages: c, cpp, python, java, javascript, sql, bash, haskell, prolog, and more.
RBR Forum supports LaTeX math rendering via KaTeX. Use $...$ for inline math and $$...$$ for display (block) math.
The time complexity is $O(n \log n)$ for merge sort.$$T(n) = 2T\left(\frac{n}{2}\right) + O(n)$$$$\sum_{i=1}^{n} i = \frac{n(n+1)}{2}$$
$$\prod_{i=1}^{n} i = n!$$
$$\sum_{i=0}^{\infty} x^i = \frac{1}{1-x}, \quad |x| < 1$$$$\frac{a}{b}, \quad \binom{n}{k} = \frac{n!}{k!(n-k)!}$$
$$\lim_{n \to \infty} \left(1 + \frac{1}{n}\right)^n = e$$$$A = \begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix}$$
$$\det(A) = a_{11}a_{22} - a_{12}a_{21}$$$O(n)$, $O(n \log n)$, $O(n^2)$, $O(2^n)$
$\Theta(n \log n)$, $\Omega(n)$
$$T(n) = aT\left(\frac{n}{b}\right) + O(n^d)$$$A \cup B$, $A \cap B$, $A \subseteq B$, $A \setminus B$
$\forall x \in S$, $\exists x$, $\neg p$, $p \implies q$
$|A \cup B| = |A| + |B| - |A \cap B|$$$P(A|B) = \frac{P(B|A) \cdot P(A)}{P(B)}$$
$$E[X] = \sum_{i} x_i \cdot P(X = x_i)$$
$$\text{Var}(X) = E[X^2] - (E[X])^2$$Everyone is here to learn. If someone asks a basic question, help them kindly. Condescending responses discourage participation.
Write your answers in your own words. If you reference external material, provide proper attribution with a link to the source.
The goal is to teach, not just answer. Explain your thought process so readers can apply the same logic to similar problems.
If your answer builds on someone else's work or comment, acknowledge them. Cite textbook references (e.g., "As per Cormen et al., Chapter 15").
If you find a mistake in your answer, edit it. If someone points out an error in the comments, update your answer rather than arguing.
Your reputation score reflects how much the community trusts your contributions. You earn (or lose) reputation based on votes and accepted answers.
| Action | Reputation |
|---|---|
| Your answer receives an upvote | +10 |
| Your answer is accepted | +15 |
| Your question receives an upvote | +5 |
| You accept an answer | +2 |
| Your post receives a downvote | -2 |
| You downvote an answer | -1 |
Tip: Consistently writing detailed, well-formatted answers is the fastest way to build reputation. A single highly-upvoted answer can earn you hundreds of points.
Badges reward specific achievements. Here are some badges related to answering:
Answer a question with a score of 1 or more
Answer with a score of 25 or more
Answer with a score of 100 or more
Ask a question and accept an answer
First answer to be accepted with a score of 10 or more
Accepted answer with a score of 40 or more
Answer your own question with a score of 3 or more
Post 5 answers with zero score and have a positive question record
Earn 200 reputation in a single day 50 times
View all badges: See the complete badge list to track your progress and discover new achievements.
Browse unanswered questions and share your knowledge. Every great answer helps someone prepare for their exam.