Joined January 2023
- Tweets 72
- Following 155
- Followers 89
- Likes 81
56 Photos and videos
29 Nov 2025
Hi folks,
✍🏻👨🏻💻🌟Do check out my new blog here👇🏻 It's the Google's bold new AI Step.🧠🙌🏻 tejalrk2000.medium.com/why-g…
#google #nestedlearning #artificial_intelligence #MachineLearning #deeplearning
1
27
30 Jul 2025
Hi folks 👋
✍️Just dropped a new blog on Generative Adversarial Networks (GANs)!
Do read and like if you find it useful and interesting!🙌
tejalrk2000.medium.com/from-…
#GenerativeAI #machinelearning #AI
2
56
22 May 2025
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 : tejalrk2000.medium.com/promp…
#LLM #transformers #AI
3
72
25 Jan 2025
🚀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
1
15
227
23 Jan 2025
🚀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
14
136
21 Jan 2025
🚀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
24
288
20 Jan 2025
🚀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
1
19
208
19 Jan 2025
🚀Day25/80 of #gfg160 challenge completed.
✅ Number of Occurrences:
Approach used : Binary search
TC: O(logn)
SC: O(1)
#geekstreak2025 #gfg160 #CodingChallenge #cpp
26
245
18 Jan 2025
🚀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
12
102
17 Jan 2025
🚀 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
11
90
16 Jan 2025
🚀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
11
100
15 Jan 2025
🚀 Day21/80 of #gfg160 challenge completed.
✅ Overlapping Intervals:
Solved the problem in O(nlogn) time and O(n) space complexity.
#geekstreak2025 #gfg160 #cpp
#codingchallenge
2
27
260
14 Jan 2025
🚀 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
2
22
241
13 Jan 2025
🚀 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
1
11
110
12 Jan 2025
🚀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.
1
21
395
9 Jan 2025
🚀 Day15/80 of #gfg160 challenge completed.
✅ Add Binary Strings:
We first trim leading zeros and then start from the last character of the strings and compute digit sum. If sum>1 then store carry for next digits. For extra carry prepend 1 of the result.
TC:O(n m) SC: O(1)
4
47