rhea0110 Goto Github PK

dummy-17

dummy-2

dummy-3

dummy-4

dummy-5

dummy-6

dummy-7

dummy-8

dummy-9

evaluate-the-postfix-expression-using-stack

Evaluate the postfix expression using Stack star_border Given a postfix expression, evaluate it using stack and print the final output.

expense-tracker

factorial-using-recursion-

Write a recursive function factorial that accepts an integer n as a parameter and returns the factorial of n, or n!. A factorial of an integer is defined as the product of all integers from 1 through that integer inclusive. For example, the call of factorial(4) should return 1 * 2 * 3 * 4, or 24. The factorial of 0 and 1 are defined to be 1. You may assume that the value passed is non-negative and that its factorial can fit in the range of type int.

fibonacci-sequence

The Fibonacci numbers are a sequence of numbers where each number after the first two is a sum of the prior two. As an illustration, here is a short sequence given starting values of (0, 1) is (0, 1, 1, 2, 3, 5, 8, 13). Write a program to generate and print the first n terms of the Fibonacci sequence where n >=1.

fibonacci-sequence-using-recursion

The Fibonacci numbers are a sequence of numbers where each number after the first two is a sum of the prior two. As an illustration, here is a short sequence given starting values of (0, 1) is (0, 1, 1, 2, 3, 5, 8, 13). Write a program to generate and print the first n terms of the Fibonacci sequence using recursion in reverse order.

find-count-of-a-number-in-a-sorted-list-with-duplicates

Find count of a number in a sorted list with duplicates star_border Given a sorted list of integers with duplicates, find the count of a given number in this list in O(log n).

find-first-occurrence-of-an-integer-in-a-sorted-list-with-duplicates-

Find first occurrence of an integer in a sorted list with duplicates star_border Given a sorted list of integers, find the position of first occurrence of a given number K in this list in O(log n) time.

find-remainder-

Write a program to find the remainder when an integer A is divided by an integer B.

github-integration---repo-try-

hand-reader-

insertion-sort-implementation

In this I will be sharing the Insertion sort implementation.

java

java programs

leerob.io

✨ My portfolio built with Next.js, MDX, Tailwind CSS, and Vercel.

live-profile

merge-sort-implementation

I will share the basic implementation of Merge Sort.

move-the-elements

Write a function moveElements which receives an array of n elements (both positive and negative) as input and shift all the negative elements to the right side of the array while maintaining the original order of the positive and negative elements. Note: consider 0 as a positive element. Suppose the array contains the following values: -6 7 13 10 -8 15 5 -9 2 -1 After a call to moveElements(arr, n); the array should store the following values: 7 13 10 15 5 2 -6 -8 -9 -1

multiplayer---try

my-first-c-program

basic coding withc programming

netflix-clone

next-tailwind-bp

partition-a-array

Given a randomly ordered array (arr) of n elements, function partitionArray(int arr[], int n, int x) partition the elements into two subsets such that elements <= x are in left subset and elements > x are in the right subset. Initial code of partitionArray(int arr[], int n, int x) which is given fails in some test cases. Identify those test cases and make the necessary changes in the function so that it gives the desired output in all the cases. Constraints : Don't rewrite the function only make the required changes in the given code.