aarushi-nema

[aarushi-nema]

RoundUp: Finance Tracking App

This project was part of my university course “Venturing into Entrepreneurship.” This was a group project so shout out to my wonderful team members: Prajwal Jagadeesh Kori, Subramania Suresh Sabarish, Phang Jin Jiat Matthias, and Mahir Murtaza, without whom this project wouldn’t have been such a wonderful success! My main role in the project was UI/UX design and technical feasibility…

[aarushi-nema]

[React-Firebase] Todo App

Functionality:In this project, I developed a todo application in React JS with a firebase backend to store all of the todo items. It has basic CRUD functionality within a React JS website utilizing the firestore cloud storage within firebase to manage the backend. All of the styling is done with Tailwind CSS. Languages and concepts:1. JavaScript – React2. TailWind CSS3. Firebase You can find…

[aarushi-nema]

Array Problems

Product Except Self

[aarushi-nema]

String Problems

Longest Repeating Character Replacement Longest Substring Without Repeating Characters Reverse String

[aarushi-nema]

Binary Tree Problems

Inorder Traversal (Recursive) Inorder Traversal (Iterative) Max depth of a binary tree

[aarushi-nema]

Blind 75

Two Sum

[aarushi-nema]

Linked Lists Problems

Here are a list of problems that are commonly asked in tech interviews: Basic operations: Create a linked list Add a node at beginning Add a node at end Add a node at given index Get length of linked list Delete linked list Delete a node at a given index Find the index of a the given value Print linked list Find the Middle of the Linked List Reverse the linked list (iterative approach)

[aarushi-nema]

Breast Cancer Classifier using Support Vector Machine

Breast Cancer Classifier using Support Vector Machine

Background: Breast cancer is the most common cancer among women in the world. It accounts for 25% of all cancer cases and affected over 2.1 Million people in 2015 alone. It starts when cells in the breast begin to grow out of control. These cells usually form tumors that can be seen via X-ray or felt as lumps in the breast area. Early diagnosis significantly increases the chances of survival.…

[aarushi-nema]

Coding Challenge Day 3: Problem 1: Closed Addressing Hash Table

Coding Challenge Day 3: Problem 1: Closed Addressing Hash Table

Question: Implement a closed addressing hash table with a modulo hash function to perform insertion and key searching #include <stdio.h> #include <stdlib.h> typedef struct _listnode{ int key; struct _listnode *next; } ListNode; typedef struct _linkedlist{ int size; ListNode *head; } HashTableNode; typedef struct _hashTable{ int hSize; //size of hash table int nSize; //number of inserted…

[aarushi-nema]

Coding Challenge Day 2: Problem 1: Balanced Parenthesis?

Coding Challenge Day 2: Problem 1: Balanced Parenthesis?

Question:  Check if parenthesis in expression is balanced. Here is the link to the question. package stacks; public class Symbol_checker { static class Stack{ int MAX= 10; char [] stack= new char[MAX]; int top=-1; public void push(char element){ if(top<MAX-1){ top++; stack[top]=element; } else { System.out.println("Stack is Full"); } } public Character pop…

[aarushi-nema]

Coding Challenge Day 1: Problem 1: Roman numeral to Integer

Coding Challenge Day 1: Problem 1: Roman numeral to Integer

Coding challenge introduction Question: Given a Roman numeral, the task is to find its corresponding decimal value. Here is the link to the details of the question My Solution: int romanToInt(char * s){ int i=0, number=0; while(s[i]!='\0'){ char current_char = s[i]; switch(current_char){ case 'I': if(s[i+1]=='V'){ number += 4; i++; } else if (s[i+1] == 'X'){ number += 9; i++; } else { number…

[aarushi-nema]

New Coding Challenge!

Hey!! I am back with a new coding challenge! I am planning to try it out for 100 days without keeping a cap on the number of questions I can solve in a day. Day 001: Roman Numerals to Integer (C programming language)

[aarushi-nema]

Episode 8 The One with Vocal Coaching

Episode 8 The One with Vocal Coaching

“Music once admitted to the soul becomes a sort of spirit and never dies.” This is an evocative reminder of the life of our guest, Ms. Divya RT. With her mellow voice that washes over you like the calming waves of the sea, she speaks to us about what music means to her, how it changed her life, and catapulted her into a career which she’d never anticipated. Her tryst with music started off as a…

[aarushi-nema]

Web Dev Project 9: Restaurant Website

Web Dev Project 9: Restaurant Website

Functionality:This project is a complete one-page responsive website that caters to a restaurant’s online presence. It includes a sticky navigation bar, about us section, menu, chef display, testimonials, and contact form. Languages and concepts:1. HTML2. CSS3. Javascript You can interact with the project on this link:https://aarushi-nema.github.io/webDev009_restaurant_Website/ You can find…

[aarushi-nema]

Stack: Evaluate Prefix Expression

Stack: Evaluate Prefix Expression

Question: Evaluate a given prefix expression Resources: https://www.youtube.com/watch?v=o6vj5l_W2h8&list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU&index=37 package additional_problems.stack; /** * 1. Assume that you are given a prefix expression and that there are only single digit numbers in the expression * 2. Start traversing from right to left * 3. If operand occurred then push into stack * 4. If…

[aarushi-nema]

Stack: Evaluate a postfix expression

Stack: Evaluate a postfix expression

Question: Evaluate a postfix expression package additional_problems.stack; /** * Note that every number must have spaces between them * 1. Start from the first element of the post fix expression * 2. If operand encountered, then push onto stack * 3. If operator encountered, pop the top two elements and evaluate operator2- operator1 * 4. Push result onto stack * 5. Once entire expression is…

[aarushi-nema]

Stack: Postfix to infix expression

Stack: Postfix to infix expression

Question: Convert Postfix to infix expression Resources: https://www.youtube.com/watch?v=1zqgyoZzda4&list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU&index=38 package additional_problems.stack; /** * 1. If operand is encountered then store in stack * 2. If operator occurs then pop top two elements and join them using the operator. Add parenthesis around the expression * 3. Push result onto the stack *…