EmilWijayasekara

EmilWijayasekara

Welcome to my GitHub! I'm Emil Wijayasekara, a final-year Computer Science student at the University of Sri Jayewardenepura. I'm passionate about computer hardware, data privacy, graphic design, and cybersecurity. My projects focus on solving real-world problems with secure and user-friendly tech solutions.

EmilWijayasekara-backend-test-02

first-contributions

🚀✨ Help beginners to contribute to open source projects

ForesterFannels-garment-retail-analytics-and-optimization-system

This project, developed as a second-year university assignment, focuses on database management systems using a MySQL database and a PHP-based frontend. It aims to enhance garment retail operations through efficient data management and user-friendly interfaces.

gesture-controlled-bluetooth-speaker

Gesture-Controlled Bluetooth Speaker uses an ESP32-CAM and Edge Impulse to control a Bluetooth speaker with hand gestures. Perform actions like play, pause, skip tracks, and adjust volume effortlessly. Explore the intersection of embedded systems and AI-driven interfaces.

Hackerrank-java-preparation

A collection of Java problems designed to improve programming skills and prepare for competitive coding challenges. Each problem includes a description, sample input/output, and a solution. Earn badges and stars as you progress.

LeetCode-1-TwoSum

LeetCode Problem 1.Two Sum - This repository contains my solution to the classic "Two Sum" problem from LeetCode. The problem entails finding two numbers in an array that sum up to a given target.

LeetCode-1051-Height-Checker

LeetCode Problem 1051. Height Checker - determining the number of students in a school lineup whose heights do not match the expected non-decreasing order for an annual photo. The task is to compare the given array of student heights with the array representing the expected order and count the indices where disparities occur.

LeetCode-Solutions_Difficulty-Easy

Embark on my LeetCode learning adventure! Follow along as I tackle coding challenges, sharing my solutions and learning experiences. Join me in honing our coding skills together! 🚀 #LeetCode #CodingJourney

Selenium-automation-testing-with-webdriver-test-01

This repository contains a Java-based Selenium test script, Example2.java, demonstrating the automation of interactions with the Guru99 Demo Website for flight reservation. The script covers login, flight details input, and airline selection, providing a foundation for Selenium testing in a web environment.

EmilWijayasekara/first-contributions

🚀✨ Help beginners to contribute to open source projects

EmilWijayasekara/LeetCode-1-TwoSum

LeetCode Problem 1.Two Sum - This repository contains my solution to the classic "Two Sum" problem from LeetCode. The problem entails finding two numbers in an array that sum up to a given target.

EmilWijayasekara/LeetCode-1051-Height-Checker

LeetCode Problem 1051. Height Checker - determining the number of students in a school lineup whose heights do not match the expected non-decreasing order for an annual photo. The task is to compare the given array of student heights with the array representing the expected order and count the indices where disparities occur.

EmilWijayasekara/LeetCode-13-Roman-to-Integer

LeetCode Problem 12. Integer to Roman - The task is to sum the values of these symbols according to the rules of Roman numeral representation, with the added complexity of subtraction when a smaller numeral precedes a larger one. The goal is to return the integer value equivalent to the given Roman numeral string.

EmilWijayasekara/LeetCode-14-Longest-Common-Prefix

LeetCode Problem 14. Longest Common Prefix - The problem is to find the longest common prefix in an array of strings. The solution sorts the array and compares the first and last strings, returning the common prefix. If the array is empty or null, it returns an empty string.

EmilWijayasekara/LeetCode-1422-Maximum-score-after-splitting-a-string

LeetCode Problem 1422. Maximum Score After Splitting a String - The problem involves maximizing the score by splitting a binary string into two parts and counting zeros on the left and ones on the right. The goal is to iterate through possible splits and return the highest achievable score.

EmilWijayasekara/LeetCode-1816-Truncate-Sentence

LeetCode Problem 1816. Truncate Sentence - Given a sentence s​​​​​​ and an integer k​​​​​​. You want to truncate s​​​​​​ such that it contains only the first k​​​​​​ words. Return s​​​ after truncating it.

EmilWijayasekara/LeetCode-20-Valid-Parentheses

LeetCode Problem 20. Valid Parentheses -Focuses on determining the validity of a given string consisting of parentheses, braces, and brackets. The solution employs a stack-based approach to efficiently check if the arrangement of symbols follows the rules

EmilWijayasekara/LeetCode-2441-Largest-Positive-Integer-That-Exists-With-Its-Negative

LeetCode Problem 2441.Largest Positive Integer That Exists With Its Negative - The problem requires finding the largest positive integer in an array such that its negative counterpart also exists in the array. The objective is to return this maximum positive integer, or -1 if no such integer is found.

EmilWijayasekara/LeetCode-2469-Convert-the-Temperature

LeetCode Problem 2469. Convert the Temperature - This problem entails converting a Celsius temperature to its corresponding values in Kelvin and Fahrenheit, utilizing precise conversion formulas, and returning the results in a two-element array with specified precision.

EmilWijayasekara/LeetCode-2620-Counter-30-Days-of-JavaScript-Day-2

Leetcode Problem 2620 Counter - Function that takes an initial value n and returns a new function. The returned function, when called, will return n and then increment it for subsequent calls, creating a counter.

EmilWijayasekara/LeetCode-2667-Create-Hello-World-Function-30-Days-of-JavaScript-Day-1

LeetCode Problem 2667. Create Hello World Function - In this problem we have to write a function createHelloWorld. It should return a new function that always returns "Hello World".

EmilWijayasekara/LeetCode-2960-Count-Tested-Devices-After-Test-Operations

LeetCode Problem 2960. Count Tested Devices After Test Operations - testing devices based on their battery percentages. For each tested device, its battery percentage is decremented by 1, and the operation is propagated to subsequent devices, with the goal of determining the total number of tested devices.

EmilWijayasekara/LeetCode-2974-Minimum-Number-Game

LeetCode Problem 2974. Minimum Number Game - A given array of even length. In each round, two players remove and append elements in a specific order, and the task is to return the resulting array after all rounds are completed.

EmilWijayasekara/LeetCode-9-Palindrome-Number

LeetCode Problem 9. Palindrome Number - Within this repository, you'll find my solution to the "Palindrome Number" problem on LeetCode. This challenge involves determining whether a given integer is a palindrome or not. My approach converts the integer to a string, allowing for a simple comparison of characters from both ends.

EmilWijayasekara/single-price-grid-component-master

An implementation of frontend mentor code challenge

EmilWijayasekara/singly-linked-list-in-java

A simple implementation of Singly Linked Lists in Java

EmilWijayasekara/testimonials-grid-section

An implementation of frontend mentor code challenge (Testimonials grid section)