Jaskamal Kainth
Software Engineer, Samsung
Mathematics and Computer Science, BITS Pilani
about
Professional Profile
AI Search Engineer with 7+ years of experience in building large-scale, intelligent search systems. Specialized in Data Structures & Algorithms, AWS OpenSearch/Elasticsearch, AI/ML (NLP), Generative AI, Spring, RESTful Web Services, and cloud-native architectures.
Currently leading a Core Search team, driving backend microservices with Search & Logging APIs, query preprocessing, retrieval, ranking, reranking, and integration of NLP, AI/ML, and Generative AI models. Successfully scaled search platform globally across multiple sites with different languages, ensuring high availability, scalability, and advanced search relevance.
With a dual degree in Mathematics and Computer Science from BITS Pilani, I bring a strong academic foundation to practical engineering challenges.
Beyond engineering delivery, I'm passionate about mentorship and knowledge sharing having conducted 300+ hours of DSA training and live problem-solving sessions to strengthen engineering competencies. My early foundation comes from competitive programming, including participation in ACM-ICPC and multiple algorithmic platforms.
I remain committed to continuous learning, advancing AI-powered search, and driving innovation at scale.
During college, I used to actively participate in algorithmic problem-solving on various competitive programming platforms, including ACM-ICPC.
My ACM International Collegiate Programming Contest profile:
Blog
Academic Work
Energy-Efficient Scheduling Algorithms
Benchmarking scheduling algorithms like HEFT, Deadline slack, NDES, GDES using C++ to conclude the best algorithm for which the energy consumption is minimum for a real-time parallel application on a heterogeneous distributed embedded system.
View ThesisNumerical solutions for PDEs in Option pricing
Applying the B-Spline collocation method and Radial basis function method to solve the Black Scholes equation used in Option pricing.
View ThesisTechnical Deep Dives
Bloom Filters
Understanding Bloom Filters: a space-efficient probabilistic data structure with implementation and mathematical analysis of false positive rates.
Fast Fourier Transformation
How to multiply two polynomials in O(nlogn) time using FFT and its applications for large number multiplication.
7 Solutions to 1 Problem
Multiple approaches to solve: Find the number of triplets which satisfies the property A[i] < B[j] < C[k].
C++ Notes
Comprehensive notes on C++ programming language concepts and techniques.
ReadSegment Tree Problems
A curated list of 20 Segment tree problems with difficulty ranging from Easy to Hard.
ReadString Algorithm Problems
A collection of String related problems involving various Algorithms like Z-Algorithm, Trie, Suffix Array, Aho-corasick, and Hashing.
ReadDisjoint Set Union Problems
A comprehensive list of problems using Disjoint Set Union data structure.
ReadGraph Theory Notes
Detailed notes on the Graph Theory concepts and related problem-solving techniques.
ReadElasticsearch Notes
Comprehensive notes on Elasticsearch concepts and best practices.
ReadExperiments & Interactive Demos
Pixelate Your Image
Upload any image and transform it into pixel art with random character overlays.
DemoANN HNSW Simulation
Visualization of Hierarchical Navigable Small World algorithm for approximate nearest neighbor search.
DemoRandom Bounce Pattern with Dots
An interactive visualization demonstrating particle simulation with bouncing dots.
DemoBeyond Code
Philosophy Notes: Great Thinkers of the Last Century
I'm fascinated by philosophy, psychology, and the study of human mind - what we do, why we do it. Here are my notes on influential thinkers who explored these fundamental questions.
Read Notes한국어 학습 여정 (My Korean Learning Journey)
From 한글 (Hangul) basics to complex grammar structures - documenting my adventure in mastering Korean.
View JourneyMusic is my only drug
Music is my oxygen, my escape, my everything. Dive into the sonic landscapes that shape my world and discover what makes my heart beat.
Read