Sadit

METI Internship 2026

আজকে একটা গুরুত্বপূর্ণ সুযোগের কথা শেয়ার করছি, যেটা অনেকের কাজে আসতে পারে। বিশেষ করে যারা বিশ্ববিদ্যালয়ে পড়ছো বা সবে পাস করে বের হয়েছো, তাদের জন্য এটি সত্যিকার অর্থেই একটি বড় সুযোগ।

METI Internship Program হলো জাপান সরকারের Ministry of Economy, Trade and Industry-এর একটি আন্তর্জাতিক ইন্টার্নশিপ প্রোগ্রাম। এই প্রোগ্রামের মাধ্যমে বিশ্বের বিভিন্ন দেশের শিক্ষার্থী ও গ্র্যাজুয়েটরা জাপানের কোম্পানিতে internship করার সুযোগ পায়।

বাংলাদেশ OECD/DAC তালিকাভুক্ত দেশ হওয়ায় বাংলাদেশি শিক্ষার্থী ও গ্র্যাজুয়েটরাও এই প্রোগ্রামে আবেদন করতে পারবে।

এই প্রোগ্রামটি Fully Funded।

যারা On-site অর্থাৎ জাপানে গিয়ে internship করবে, তারা সাধারণত যে সুবিধাগুলো পাবে:
• Round-trip বিমান টিকিট
• থাকার সম্পূর্ণ ব্যবস্থা
• প্রতিদিন ৩,০০০ ইয়েন ভাতা
• ভিসা প্রসেসিং সহায়তা
• জাপানি ভাষার প্রশিক্ষণ
• Insurance কভারেজ

আর যারা Online internship করবে, তারা প্রতিদিনের কাজের বিপরীতে ১,০০০ ইয়েন সমতুল্য ভাতা পাবে নিজের দেশের মুদ্রায়।

যোগ্যতা:
• বয়স ১৮ থেকে ৩৯ বছরের মধ্যে হতে হবে
• ২৪ আগস্ট ২০২৬ অনুযায়ী বয়স গণনা করা হবে
• বিশ্ববিদ্যালয়ের final year student অথবা undergraduate/master’s graduate হতে হবে
• ইংরেজিতে ভালো দক্ষতা থাকলেই হবে
• IELTS বাধ্যতামূলক নয়
• বর্তমানে জাপানে বসবাস করছেন না এমন হতে হবে
• কোনো application fee নেই

সময়সূচি:
Online Course: ২৪ আগস্ট – ১৮ সেপ্টেম্বর ২০২৬

On-site Internship in Japan:
১ম টার্ম: ৭ অক্টোবর – ২৬ নভেম্বর ২০২৬
২য় টার্ম: ৪ নভেম্বর – ২০ ডিসেম্বর ২০২৬

মোট সময়কাল প্রায় ৬ সপ্তাহ। এর মধ্যে cross-cultural training, career guidance, mid-term follow-up session এবং company-based practical internship থাকবে।

আবেদন প্রক্রিয়া:

Selection সাধারণত তিন ধাপে হয়।

প্রথমে document screening হয়। এরপর JIP Office-এর সাথে interview নেওয়া হয়। তারপর host company-র সাথে সরাসরি interview হয়। Candidate এবং company দুই পক্ষ match করলে internship confirm হয়।

আবেদনের শেষ তারিখ: ৩০ জুন ২০২৬

Engineering, IT, Business, Design, Environmental Science বা related field-এ যারা পড়ছো বা পড়েছো, তাদের জন্য এটি হতে পারে।

এই প্রোগ্রামের আরেকটি গুরুত্বপূর্ণ দিক হলো, internship শেষে Japan-related career opportunity বা job connection-এর দিকেও guidance পাওয়া যায়। তাই যারা ভবিষ্যতে Japan-based career, international work experience বা global company exposure নিতে চাও, তাদের জন্য এটি অনেক ভালো একটি সুযোগ।

এই topic নিয়ে খুব শিগগিরই আমার একটি বিস্তারিত ভিডিও আসছে, যেখানে application process, eligibility, benefits এবং কীভাবে strong application তৈরি করা যায় এসব step by step explain করবো।

কারো কোনো প্রশ্ন থাকলে কমেন্টে জানাও। যতটুকু পারি সাহায্য করার চেষ্টা করবো।

🌟 Day 10 of My DSA Journey 🌟

Today, I learned two exciting problems in Data Structures and Algorithms (DSA): Pair Sum and Majority Element. These problems are commonly asked in coding interviews and emphasize the importance of optimizing solutions.
A huge shoutout to Apna College and Shradha Khapra for their incredible teaching style that makes even complex concepts easy to grasp. 🚀

🔹 𝑷𝒂𝒊𝒓 𝑺𝒖𝒎 𝑷𝒓𝒐𝒃𝒍𝒆𝒎
The goal is to find two numbers in a sorted array that add up to a given target. For example, in the array {2, 7, 11, 15} with a target of 9, the pair (2, 7) is a valid solution.

1️⃣ 𝘽𝙧𝙪𝙩𝙚 𝙁𝙤𝙧𝙘𝙚 𝘼𝙥𝙥𝙧𝙤𝙖𝙘𝙝:
Generate all possible pairs using nested loops.
Check if the sum of each pair matches the target.
Time Complexity: 0(n²).

2️⃣ 𝑶𝒑𝒕𝒊𝒎𝒊𝒛𝒆𝒅 𝑨𝒑𝒑𝒓𝒐𝒂𝒄𝒉 (𝑻𝒘𝒐-𝑷𝒐𝒊𝒏𝒕𝒆𝒓 𝑻𝒆𝒄𝒉𝒏𝒊𝒒𝒖𝒆):
Leverage the sorted array and use two pointers:
One pointer starts at the beginning, the other at the end.
Adjust their positions based on whether the current sum is less than or greater than the target.
Time Complexity: 0(n), a more efficient solution!

🔹 𝑴𝒂𝒋𝒐𝒓𝒊𝒕𝒚 𝑬𝒍𝒆𝒎𝒆𝒏𝒕 𝑷𝒓𝒐𝒃𝒍𝒆𝒎
The task is to find the element in an array that appears more than n/2 times, where n is the size of the array.

1️⃣ 𝘽𝙧𝙪𝙩𝙚 𝙁𝙤𝙧𝙘𝙚 𝘼𝙥𝙥𝙧𝙤𝙖𝙘𝙝:
Count the frequency of each element and check if any exceeds n/2.
Time Complexity: 0(n²).

2️⃣ 𝙊𝙥𝙩𝙞𝙢𝙞𝙯𝙚𝙙 𝘼𝙥𝙥𝙧𝙤𝙖𝙘𝙝 (𝙎𝙤𝙧𝙩𝙞𝙣𝙜):
Sort the array, then count frequencies in a single pass.
Time Complexity: O(n log n).

3️⃣ 𝙈𝙤𝙤𝙧𝙚’𝙨 𝙑𝙤𝙩𝙞𝙣𝙜 𝘼𝙡𝙜𝙤𝙧𝙞𝙩𝙝𝙢:
The most efficient solution:
Maintain a candidate and a counter while iterating through the array. Perform a final check to confirm the candidate is indeed the majority element.
Time Complexity: O(n), with O(1) space.

🎉 𝐌𝐢𝐥𝐞𝐬𝐭𝐨𝐧𝐞 𝐀𝐜𝐡𝐢𝐞𝐯𝐞𝐦𝐞𝐧𝐭
Thanks to the guidance from Shradha Khapra Ma'am and the resources provided by Apna College, I successfully implemented these approaches. Solving these problems on LeetCode felt empowering, as I applied theoretical knowledge to practical scenarios.

🏋️ 𝐍𝐞𝐱𝐭 𝐒𝐭𝐞𝐩𝐬
I’ll continue exploring more advanced DSA problems and solidify my understanding of techniques like Two-Pointer and Moore’s Voting Algorithm. Platforms like LeetCode and CodeChef will help me grow further! 💪

🌟 Day 9 of My DSA Journey 🌟

Today, I delved into the fascinating concept of Maximum Subarray Sum and explored the powerful Kadane's Algorithm. This algorithm has revolutionized how we solve problems involving subarrays efficiently. It's a cornerstone of array-related questions in Data Structures and Algorithms (DSA) and a must-know for coding interviews.

🔹 𝗞𝗲𝘆 𝗖𝗵𝗮𝗿𝗮𝗰𝘁𝗲𝗿𝗶𝘀𝘁𝗶𝗰𝘀 𝗼𝗳 𝗦𝘂𝗯𝗮𝗿𝗿𝗮𝘆𝘀
Subarrays are defined as continuous parts of a given array, ranging from single elements to larger contiguous segments. Interestingly, for an array of size n, the total number of possible subarrays is calculated as n * (n + 1) / 2. Generating subarrays requires identifying starting and ending indices, often achieved using nested loops.

🔹 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵𝗲𝘀 𝘁𝗼 𝗦𝗼𝗹𝘃𝗶𝗻𝗴 𝗠𝗮𝘅𝗶𝗺𝘂𝗺 𝗦𝘂𝗯𝗮𝗿𝗿𝗮𝘆 𝗦𝘂𝗺

1️⃣ Brute Force Method:
Iterates through all possible subarrays, calculates their sums, and identifies the maximum.
While simple, this method has a high time complexity of O(n³), making it inefficient for large arrays.

2️⃣ Optimized Brute Force:
Reduces the number of nested loops by maintaining a running sum for the current subarray.
Resets the current sum to zero if it becomes negative, ensuring efficiency.

3️⃣ Kadane's Algorithm:
A game-changer! It scans the array, keeps track of a current sum, and updates the maximum sum encountered.
If the current sum drops below zero, it resets, allowing only positive sums to contribute.
With a linear time complexity of O(n), Kadane's Algorithm is ideal for tackling large datasets efficiently.

🔹 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗜𝗻𝘀𝗶𝗴𝗵𝘁
Kadane's Algorithm is an excellent example of breaking down complex problems into smaller, manageable subproblems—a hallmark of dynamic programming. This foundational knowledge will pave the way for tackling advanced DSA challenges in the future.

🎉 𝗠𝗶𝗹𝗲𝘀𝘁𝗼𝗻𝗲 𝗔𝗰𝗵𝗶𝗲𝘃𝗲𝗺𝗲𝗻𝘁
Today, I solved Problem #53 on LeetCode, which focuses on finding the maximum subarray sum. Implementing Kadane’s Algorithm to tackle this problem felt like a breakthrough moment in my DSA journey. Applying theoretical knowledge to a real problem and seeing it work seamlessly was incredibly rewarding.

🏋️ 𝗡𝗲𝘅𝘁 𝗦𝘁𝗲𝗽𝘀
Moving forward, I’ll strengthen my understanding of dynamic programming by solving more problems that utilize Kadane’s Algorithm. Platforms like LeetCode and CodeChef will be my go-to resources as I build confidence in applying these concepts to real-world scenarios. 🚀

‼️ Urgent Sale‼️

🔧 Configuration Details:
1️⃣ Motherboard: MSI B450M-A
2️⃣ SSD: HP EX900 Plus 250GB
3️⃣ Case: Maxgreen Plastic Case
4️⃣ RAM: Corsair 8GB
5️⃣ Casing: Value Top
6️⃣ Processor: Ryzen 5 5600G
7️⃣ Keyboard: Logitech
8️⃣ Monitor: NPC IPS

🗓️ Purchase Date: 1st December 2023
💡 Condition: Barely used – in excellent working condition.

✨ Why Sell?
Selling for an important purpose. I’ve hardly used the computer, so it’s as good as new.

💼 Warranty:
✅ Warranty valid for ALL components until 30th November 2026!

📍 Location: Chittagong
💵 Price: 38k
📱 Contact: DM or call [01940-472804].
🎉 Message me, if you want to check the invoice.

Don’t miss out, this is a great deal for work or study. Grab it before it’s gone.

Two friends 👫
One ocean 🌊
Endless dreams of success 🌄

🌟 Day 8 of My DSA Journey 🌟

Today, I ventured into the world of Vectors with Apna College and Shradha Khapra a dynamic and flexible data structure that stands out in C++ for its ability to resize during runtime. They are an essential part of the Standard Template Library (STL) and a significant asset during coding interviews for reducing coding time and simplifying complex problems.

🔹 𝗞𝗲𝘆 𝗖𝗵𝗮𝗿𝗮𝗰𝘁𝗲𝗿𝗶𝘀𝘁𝗶𝗰𝘀 𝗼𝗳 𝗩𝗲𝗰𝘁𝗼𝗿𝘀
Vectors are similar to arrays but with added flexibility. They can resize dynamically and allocate memory in a way that allows efficient use of storage. Operations like push_back, pop_back, and accessing front and back elements make vectors extremely versatile for data manipulation.

🔹 𝗜𝗺𝗽𝗹𝗲𝗺𝗲𝗻𝘁𝗮𝘁𝗶𝗼𝗻 𝗜𝗻𝘀𝗶𝗴𝗵𝘁𝘀
Implementing vectors in C++ is straightforward. By including the header file, we can create and initialize vectors with ease. They can be iterated over using loops like for each, which simplifies traversal. Internally, vectors manage memory dynamically, and their resizing involves creating a larger memory block and copying existing elements, which introduces concepts like size and capacity.

🔹 𝗣𝗿𝗼𝗯𝗹𝗲𝗺-𝗦𝗼𝗹𝘃𝗶𝗻𝗴 𝗨𝘀𝗶𝗻𝗴 𝗩𝗲𝗰𝘁𝗼𝗿𝘀
Vectors simplify solving problems like finding unique elements in an array. Today’s session emphasized the importance of starting with basic problems to build confidence before tackling more complex challenges. Practicing these problems helped solidify my understanding of vectors and their operations.

🎉 𝗠𝗶𝗹𝗲𝘀𝘁𝗼𝗻𝗲 𝗔𝗰𝗵𝗶𝗲𝘃𝗲𝗺𝗲𝗻𝘁
Today, I solved my first question on CodeChef, and it was an exhilarating experience! Applying my knowledge to a real problem and seeing it work felt incredibly rewarding and motivating.

🏋️ 𝗡𝗲𝘅𝘁 𝗦𝘁𝗲𝗽𝘀
I plan to write functions for tasks like linear search and reverse operations on vectors. To further sharpen my skills, I’ll practice regularly on platforms like LeetCode, diving deeper into DSA concepts to enhance my problem-solving abilities. 🚀

Recently, I visited a mountain, and it taught me something special. The climb showed me the importance of patience, the view reminded me to see things from a bigger perspective, and the quiet surroundings helped me reflect on life. I realized that life isn’t just about studying or working, it’s also about learning from the world around us by exploring new places. Sometimes, the best lessons come from nature itself.

🌟 Day 7 of My DSA Journey 🌟

Today, I dived into Data Structures (DS) and learned why they are so important for organizing and managing data in computer systems. Here’s a summary of what I learned:

🔹𝐈𝐧𝐭𝐫𝐨𝐝𝐮𝐜𝐭𝐢𝐨𝐧 𝐭𝐨 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞𝐬:
Data structures play a vital role in how data is processed and stored in computer systems. Software companies highly value knowledge of data structures because they reflect a candidate's problem-solving and analytical abilities, which are essential for software development. No matter how technology evolves, the concepts of data structures remain foundational.

🔹 𝐊𝐞𝐲 𝐂𝐨𝐧𝐜𝐞𝐩𝐭𝐬 𝐨𝐟 𝐃𝐚𝐭𝐚:
Data refers to values or sets of values, and it can exist in different forms, such as stored information or facts. Organizing data in the right way is crucial, and the choice of structure depends on how well it represents real-world relationships and facilitates efficient data processing.

🔹 𝐁𝐚𝐬𝐢𝐜 𝐓𝐞𝐫𝐦𝐢𝐧𝐨𝐥𝐨𝐠𝐲 𝐢𝐧 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞𝐬:
Data: The values or collections of values.
Data Items: Single values or groups of items that can be broken down into smaller parts.
Entity: An item with attributes that can be assigned values.

🔹𝐈𝐧𝐭𝐫𝐨𝐝𝐮𝐜𝐭𝐢𝐨𝐧 𝐭𝐨 𝐀𝐫𝐫𝐚𝐲𝐬:
Arrays are collections of similar data types stored in continuous memory locations, allowing quick access through indices. They make it easier to store and manage multiple data items under a single variable. Arrays can be single-dimensional or multi-dimensional, depending on how you need to organize your data.

Why These Concepts Matter:
Understanding data structures is crucial for efficient software development. Whether it’s handling multiple data items, representing real-world relationships, or solving complex problems, knowing how to organize and process data is at the core of good programming. These concepts will form the foundation for more advanced topics in algorithms and software design.

I’m excited to keep building my knowledge and see how these fundamental ideas will help me in real-world coding. Huge thanks to the resources from Apna College and Shradha Khapra for providing great lectures on data structures. 🚀

🌟 Day 6 of My DSA Journey 🌟

Today, I took a deep dive into the Binary Number System with Apna College, exploring how data is stored and manipulated at the most fundamental level in computer science. Here’s a summary of what I learned:

🔹𝗜𝗻𝘁𝗿𝗼𝗱𝘂𝗰𝘁𝗶𝗼𝗻 𝘁𝗼 𝘁𝗵𝗲 𝗕𝗶𝗻𝗮𝗿𝘆 𝗡𝘂𝗺𝗯𝗲𝗿 𝗦𝘆𝘀𝘁𝗲𝗺:
Computers rely on the binary system, representing data through sequences of zeros and ones. This understanding is foundational for working with computer memory and various operations in programming.

🔹 𝗧𝘄𝗼'𝘀 𝗖𝗼𝗺𝗽𝗹𝗲𝗺𝗲𝗻𝘁 𝗥𝗲𝗽𝗿𝗲𝘀𝗲𝗻𝘁𝗮𝘁𝗶𝗼𝗻:
This topic brought back memories from my 12th-grade ICT lessons. In computer science, two's complement is essential for representing negative numbers. This system designates the most significant bit (MSB) as a sign bit, allowing for efficient manipulation of negative values. By using two's complement, binary arithmetic becomes simpler and more intuitive, especially when handling negative integers—a foundational concept that supports both low-level computations and complex algorithms.

🔹 𝗕𝗶𝗻𝗮𝗿𝘆 𝗔𝗿𝗶𝘁𝗵𝗺𝗲𝘁𝗶𝗰 𝗮𝗻𝗱 𝗕𝗶𝘁𝘄𝗶𝘀𝗲 𝗢𝗽𝗲𝗿𝗮𝘁𝗶𝗼𝗻𝘀:
Practiced Binary Addition and worked with Bitwise Operators:

AND (&), OR (|), and XOR (^) operate on individual bits, a fundamental tool for efficient computing.

Left Shift (): I learned how these shift operations can multiply or divide values by powers of two, directly manipulating binary data.

🔹𝗢𝗽𝗲𝗿𝗮𝘁𝗼𝗿 𝗣𝗿𝗲𝗰𝗲𝗱𝗲𝗻𝗰𝗲:
Clarified how different operations are prioritized, with unary operators at the highest level and assignment operators at the lowest. Parentheses can control precedence where needed.

🔹 𝗦𝗰𝗼𝗽𝗲 𝗼𝗳 𝗩𝗮𝗿𝗶𝗮𝗯𝗹𝗲𝘀:
Defined local vs. global scope, showing where variables can be accessed within a program. Local variables remain within their defined function, while global ones can be accessed throughout the code.

𝗪𝗵𝘆 𝗧𝗵𝗲𝘀𝗲 𝗧𝗼𝗽𝗶𝗰𝘀 𝗠𝗮𝘁𝘁𝗲𝗿:
Understanding binary and other number systems provides a solid foundation for efficient data handling and low-level programming. Conversions, two’s complement, and bitwise operations are crucial for optimizing performance in critical tasks while grasping variable scope and operator precedence ensures cleaner and more predictable code. These concepts aren’t just theory—they’re essential tools for real-world coding and problem-solving.

Exciting to see these foundational concepts unfold, especially knowing they'll serve as building blocks for advanced problem-solving. Special Thanks to Shradha Khapra for her amazing structured classes. 🚀

🌟 Day 5 of My DSA Journey 🌟

Today, I delved into Functions in DSA with Apna College, learning how this foundational concept brings organization and efficiency to programming by enabling code reuse. Here’s a breakdown of what I covered:

𝗜𝗻𝘁𝗿𝗼𝗱𝘂𝗰𝘁𝗶𝗼𝗻 𝘁𝗼 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀 𝗶𝗻 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴:
Functions provide structure and reduce redundancy in code, allowing tasks to be encapsulated in reusable blocks rather than repeated.

𝗗𝗲𝗳𝗶𝗻𝗶𝘁𝗶𝗼𝗻 𝗮𝗻𝗱 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲 𝗼𝗳 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀:
I learned how functions are defined with a return type, name, parameters in parentheses, and a code block in curly braces. This structure allows repetitive tasks to be managed from a single place in the code.

𝗖𝗿𝗲𝗮𝘁𝗶𝗻𝗴 𝗮𝗻𝗱 𝗖𝗮𝗹𝗹𝗶𝗻𝗴 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀:
When defining a function, specifying the correct return type is essential. Functions only execute when called, and I practiced creating simple functions that can be reused throughout a program.

𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻 𝗣𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀 𝗮𝗻𝗱 𝗥𝗲𝘁𝘂𝗿𝗻 𝗩𝗮𝗹𝘂𝗲𝘀:
Functions can take parameters for more dynamic operations. For example, I practiced creating a function to sum two numbers using parameters and returning the result, which can be used or displayed as needed.

𝗨𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗠𝗲𝗺𝗼𝗿𝘆 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲 𝗼𝗳 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀:
Functions use stack memory, where each function call generates a stack frame to store its parameters and local variables. Once a function completes, control returns to the previous frame.

𝗣𝗮𝘀𝘀 𝗯𝘆 𝗩𝗮𝗹𝘂𝗲 & 𝗣𝗮𝘀𝘀 𝗯𝘆 𝗥𝗲𝗳𝗲𝗿𝗲𝗻𝗰𝗲:
In "pass by value," the function receives a copy of the argument, so changes within the function don’t affect the original. "Pass by reference," covered in future lessons, allows functions to modify the original argument directly.

𝗣𝗿𝗮𝗰𝘁𝗶𝗰𝗮𝗹 𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻𝘀 𝗼𝗳 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀:
Explored real-world examples like calculating factorial, summing digits, and computing combinations (binomial coefficients), all showcasing how functions encapsulate logic for better organization and clarity.

I’m thrilled to keep enhancing my coding skills with Apna College’s DSA curriculum! 🚀