❇️ Java Coding Challenge

Challenge: မေးခွန်း

Given an array of integers and a target number, print all unique pairs that sum up to the target.

Example:

Input: {2, 4, 3, 5, 7, 8, -1}, Target = 7

Output:
(2, 5)
(4, 3)
(-1, 8)

Approach: ချဉ်ကပ်နည်း
Visited numbers တွေကို သိမ်ဆည်းဖို့ HashSet ကိုသုံးပါ။ ပြီးတော့ complement (target - num) ဖြစ်လားမဖြစ်လား check လုပ်ပါ။


Java Code:

import java.util.HashSet;

public class PairSum {
    public static void main(String[] args) {
        int[] arr = {2, 4, 3, 5, 7, 8, -1};
        int target = 7;

        findPairs(arr, target);
    }

    public static void findPairs(int[] arr, int target) {
        HashSet<Integer> seen = new HashSet<>();

        for (int num : arr) {
            int complement = target - num;

            if (seen.contains(complement)) {
                System.out.println("(" + complement + ", " + num + ")");
            }
            seen.add(num);
        }
    }
}

ဒီ solution က duplicates ဖြစ်ခြင်းကို avoids လုပ်ပေးမျာဖြစ်ပါတယ်။Time complexity ကတော့ O(n) ဖြစ်ပါတယ်။
အားလုံးကို list or array အနေနဲ့ return ပြန်ချင်ရင်တော့ print မထုတ်ပဲ store အရင်လုပ်ပါ။

#java
#Programming

💻 Programming Fundamentals မှာ Master ဖြစ်အောင်ဘာတွေလေ့လာရမှာလဲ ? :

The Programming Tree
|
|── Core Concepts
| ├── Variables & Data Types
| ├── Operators (Arithmetic, Logical, Comparison)
| ├── Conditionals (if, else, switch)
| └── Loops (for, while, do-while)
|
|── Data Structures
| ├── Arrays / Lists
| ├── Strings
| ├── Stacks & Queues
| ├── Hash Maps / Dictionaries
| └── Trees / Graphs / Sets
|
|── Functions & Recursion
| ├── Function Declaration & Parameters
| ├── Return Values
| └── Recursive Thinking
|
|── Object-Oriented Programming (OOP)
| ├── Classes & Objects
| ├── Encapsulation
| ├── Inheritance
| └── Polymorphism & Abstraction
|
|── Memory & Pointers
| ├── Stack vs Heap
| ├── Pointers / References
| └── Garbage Collection
|
|── Error Handling
| ├── try-catch-finally
| ├── Exceptions
| └── Debugging
|
|── Algorithms
| ├── Sorting (Bubble, Merge, Quick)
| ├── Searching (Binary, Linear)
| ├── Greedy / Recursion / Backtracking
| └── Dynamic Programming
|
|── Complexity Analysis
| ├── Big O Notation
| └── Time & Space Efficiency
|
|── File I/O
| ├── Reading/Writing Files
| └── Working with JSON / CSV
|
|── Programming Paradigms
| ├── Procedural
| ├── OOP
| └── Functional (map, filter, reduce)
|
|── Tools & Practices
| ├── IDEs & Editors
| ├── Git / Version Control
| ├── Code Formatting & Linters
| └── Testing & Debugging
|
|── အခုမှစပြီး programming language ကိုသင်မှာဆိုရင်
| ├── Python – Easy & powerful
| ├── JavaScript – Web development
| ├── Java / C++ – OOP & performance
| └── C – Low-level understanding
|
|── Best Practices
| ├── Clean Code & Naming
| ├── Commenting & Documentation
| └── DRY & KISS Principles
|
|── END __

Python မှာ Lambda Function ဆိုတာ ဘာလဲ ?

Lambda function ဆိုတာက Python မှာ အမည်မရှိတဲ့ function (anonymous function) တစ်ခုဖြစ်ပါတယ်။ အမည်ရှိ function တွေကို def သုံးပြီး သတ်မှတ်သလိုမဟုတ်ဘဲ၊ lambda function တွေကို lambda ဆိုတဲ့ keyword နဲ့ သတ်မှတ်ပါတယ်။ Lambda function တွေမှာ argument အများအပြားပါနိုင်ပေမယ့် statement တစ်ကြောင်းတည်းသာ ပါရပါမယ်။

Example:

l = lambda x,y : x*y
print(a(5, 6))

Output : 30

Programming Language တွေနဲ့ အသုံးပြုမူ💻

#programming
#usage

🔰 Python String Methods များ