CodingPal

CodingPal is an Online coding platform that teaches coding with visualisation.

[CodingPal @RealCodingPal]

And it’s Done.

You now can enroll to our interview prep platform.

Choose a plan that suites you and get started with your interview prep
https://t.co/OKSvy75KI5

[CodingPal @RealCodingPal]

Just got activated razorpay. Tonight will be Payment gateway integration.

[CodingPal @RealCodingPal]

Just got activated razorpay. Tonight will be Payment gateway integration.

[CodingPal @RealCodingPal]

✅ Binary Search Approach
⚬ Create a function that takes a sorted array & target, and returns [first_index, last_index].
⚬ Init result: [-1, -1]. Left=0, Right=len(arr)-1.
⚬ Find First Occurrence:
While left <= right:
mid = (left + right) // 2
If arr[mid] == target: result[0] = mid; right = mid - 1 (search left).
Elif arr[mid] < target: left = mid + 1.
Else: right = mid - 1.
⚬ Find Last Occurrence: Reset left=0, right=len(arr)-1.
While left <= right:
mid = (left + right) // 2
If arr[mid] == target: result[1] = mid; left = mid + 1 (search right).
Elif arr[mid] < target: left = mid + 1.
Else: right = mid - 1.
⚬ Return result.
⏳Time Complexity: O(log n) – Halves the search space each step.
💾 Space Complexity: O(1) – Constant extra space.

[CodingPal @RealCodingPal]

✅ Iterative Approach

⚬ Create a function that takes the array & target, and returns [first_index, last_index].
⚬ Init result array: [-1, -1].
⚬ Loop through the array (i from 0 to n-1)
⚬ If arr[i] == target & result[0] == -1: Set result[0] = i (first occurrence).
⚬ If arr[i] == target & result[0] != -1: Set result[1] = i (update last occurrence).

⚬ Return the result by the loop's end.

⏳Time Complexity: O(n) – Loops over all n elements.
💾 Space Complexity: O(1) – Just a fixed 2-element array

[CodingPal @RealCodingPal]

Want to learn in your programming language of choice? Check out the link below.

https://t.co/Ronvf3xnCQ

[CodingPal @RealCodingPal]

Binary search for peak:

1⃣Calculate the middle.
2⃣If value at the middle is bigger than middle+1 index value, the peak will be anywhere to the left, continue in that range.
3⃣else peak value will be somewhere on right.
4⃣Narrow range till found.
Time: O(log n), Space: O(1).

[CodingPal @RealCodingPal]

1⃣ The iterative approach to finding a peak element in an array involves scanning through each element one by one.
2⃣If you find a larger element, you update the index. By the end, you have the index of a peak element.

👉Time complexity is O(n), and space complexity is O(1).

[CodingPal @RealCodingPal]

Onwards and upwards from here.

Stay tuned for August 8.

Subscribe now: https://t.co/pvH3kyTi4a

[CodingPal @RealCodingPal]

@DabbaiOkati Nuv https://t.co/yhABZzb1Cg gurinchi tweet chesina first person besides me ✌️

[CodingPal @RealCodingPal]

👇✌️

[CodingPal @RealCodingPal]

Late post.

[CodingPal @RealCodingPal]

Thank u pals.

[CodingPal @RealCodingPal]

Officially live from 10th September 2021 at https://t.co/jfpd2wD3Ut

[CodingPal @RealCodingPal]

Built a POC to prove the concept.
Here is why I built a POC.https://t.co/NMl4z3PLiA via @YouTube

[CodingPal @RealCodingPal]

Hello Tweety birds. Welcome to the https://t.co/jfpd2wD3Ut twitter handle.