DCDibyashree Chakravartyingateandroidandexploration.hashnode.dev·Apr 19 · 7 min readLanguages: Kotlin, Java , C+++(JNI)Important Links : Android NDK official docs : → Covers JNI basics, C++ integration, performance tips JNI Guide : → Core theory of how Java ↔ C++ interaction works Android Studio Native C++ Setup : → S00
DCDibyashree Chakravartyingateandroidandexploration.hashnode.dev·Jul 9, 2025 · 1 min read5. Longest Palindromic SubstringProblem statement: Given a string s, return the longest palindromic substring in s. Logic: my code: class Solution { public String longestPalindrome(String s) { int i=1; int length=1; for(int i=1 , i++, i< s.length -2){ ...10
DCDibyashree Chakravartyingateandroidandexploration.hashnode.dev·Jun 10, 2025 · 2 min read88. Merge Sorted ArrayLeetCode Link Problem statement: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single arra...10
DCDibyashree Chakravartyingateandroidandexploration.hashnode.dev·Jun 7, 2025 · 1 min readAndroid Development 06: Card : jetpack ComposeFilled: Elevated Outlined @Composable fun FilledCardExample() { Card( colors = CardDefaults.cardColors( containerColor = MaterialTheme.colorScheme.surfaceVariant, ), modifier = Modifier ...10
DCDibyashree Chakravartyingateandroidandexploration.hashnode.dev·Jun 7, 2025 · 2 min read4. Median of 2 shorted ArrayLeetCode link Problem statement: Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: Input: nums1 = [1,3], nums2 = [2] Ou...10
