Tejal Khade

Deep Learning Intern at Intel👨‍💻 |
Painting🎨 | Music🎙️| Reading 📚|Wanderlust✈️
Grounded by Consistency.

[Tejal Khade @TechCode31]

Hi folks,
✍🏻👨🏻‍💻🌟Do check out my new blog here👇🏻 It's the Google's bold new AI Step.🧠🙌🏻 https://t.co/skP4gTqVD5

#google #nestedlearning #artificial_intelligence #MachineLearning #deeplearning

[Tejal Khade @TechCode31]

Hi folks 👋
✍️Just dropped a new blog on Generative Adversarial Networks (GANs)!
Do read and like if you find it useful and interesting!🙌
https://t.co/deNnRwSTdw
#GenerativeAI #machinelearning #AI

[Tejal Khade @TechCode31]

In the past few months, I have been actively exploring core concepts behind LLMs - from the basics all the way to decoder-only transformers.
🧠Key concepts behind LLMs
🔐Decoder only architectures
👉Read part 1 of blog series here : https://t.co/IFBbK2YeKJ

#LLM #transformers #AI

[Tejal Khade @TechCode31]

@KunikaKishore Interested

[Tejal Khade @TechCode31]

@raviraushan0412 @amazon Let's connect

[Tejal Khade @TechCode31]

🚀Day31/80 of #gfg160 challenge completed.
✅ Kth missing positive number in sorted array
In a sorted array, finding the first index where arr[i] > (k+i) can be optimized. Binary search is preferred to better locate i. Thus kth missing element is k+i.
TC: O(logn), SC O(1) #cpp

[Tejal Khade @TechCode31]

🚀Day30/80 of #gfg160 challenge completed.
✅ Allocate Minimum Pages
Using binary search approach to minimize page limit. In simple terms, assign books to students until the limit is hit then move to the next student.
TC: O(n*log(Sum(arr)- MAX))
SC: O(1)
#cpp #geekstreak2025

[Tejal Khade @TechCode31]

🚀Day29/80 of #gfg160 challenge completed.
✅ Kth element of two Arrays :
Here, I consider two sets for using binary search. We find a point in both arrays so that all elements in first set are smaller than all elements in other. So there is need to check the partitions.
#cpp

[Tejal Khade @TechCode31]

🚀Day28/80 of #gfg160 challenge completed.
✅ Peak Element:
Used a binary search approach with time complexity O(logn) and space complexity O(1).
This is the optimized method to retrieve a peak element.
#geekstreak2025 #CodingChallenge #cpp

[Tejal Khade @TechCode31]

🚀Day27/80 of #gfg160 challenge completed.
✅ Search in rotated sorted Array
Used Binary search approach with O(logn) time and O(1) space complexity.
#cpp #geekstreak2025 #CodingChallenge

[Tejal Khade @TechCode31]

🚀Day26/80 of #gfg160 challenge completed.
✅ Sorted and Rotated minimum:
Attempted to solve this problem in O(logn) time and O(1) space complexity.
#cpp #geekstreak2025 #gfg160

[Tejal Khade @TechCode31]

🚀Day25/80 of #gfg160 challenge completed.
✅ Number of Occurrences:
Approach used : Binary search
TC: O(logn)
SC: O(1)
#geekstreak2025 #gfg160 #CodingChallenge #cpp

[Tejal Khade @TechCode31]

🚀Day24/80 of #gfg160 challenge completed.
✅ Merge Without Extra Space:
Attempted to solve this problem using the Gap sort method.
TC: O(m+n)*O(log(m+n))
SC: O(1)
#geekforgeeks #geekstreak2025 #cpp

[Tejal Khade @TechCode31]

🚀 Day23/80 of #gfg160 challenge completed.
✅ Non-Overlapping Intervals :
Attempted to solve this problem using a greedy approach.
TC: O(nlogn)
SC: O(1)
#geekstreak2025 #codingchallenge #cpp

[Tejal Khade @TechCode31]

🚀Day 22/80 of #gfg160 challenge completed.
✅ Insert Interval: Sorting and Interval merging approach is used here. Time complexity is O(nlogn) and space complexity is O(n). Where n is the number of intervals.
#geekstreak2025 #codingchallenge #cpp

[Tejal Khade @TechCode31]

🚀 Day21/80 of #gfg160 challenge completed.
✅ Overlapping Intervals:
Solved the problem in O(nlogn) time and O(n) space complexity.
#geekstreak2025 #gfg160 #cpp
#codingchallenge

[Tejal Khade @TechCode31]

🚀 Day20/80 of #gfg160 challenge completed.
✅ Count Inversions: I used Merge sort step to count the Inversions in this problem giving O(nlogn) time and O(n) space complexity.
#cpp #CodingChallenge #geekstreak2025

[Tejal Khade @TechCode31]

🚀 Day19/20 of #gfg160 challenge completed.
✅ Sort 0's, 1's and 2's :
Attempted to solve this problem using O(n) time and O(1) space complexity.
#CodingChallenge #geekforgeeks #cpp

[Tejal Khade @TechCode31]

@gyptazy @BoxyBSD Ko

[Tejal Khade @TechCode31]

🚀Day18/80 of #gfg160 challenge completed.
✅ Min Chars to Add for Palindrome:
Attempted the problem using the KMP algorithm in O(n) time and O(n) space complexity. The min no. of chars to make the string palindrome is the length of the input string minus last entry of lps array.