Certificates
"Just an Lazy engineer ,
Who finds the simpliest way of doing an task."
If interested to find more, please visit my Profile-Card.
Download CV|
Senior Specialist Factset Systems Dec 2025 - Present |
|
|
Support-Engineer Volante Technologies Apr 2024 - Dec 2025 |
|
|
Software Engineer - Trainee Volante Technologies Aug 2023 - Apr 2024 |
|
|
Software Engineer-Trainee (Internship) Volante Technologies Jul 2022 - Jul 2023 |
Possess 2 yrs(Including Internship) experience in Support, excelling in complex issue resolution with ServiceNow & Atlassian. Leverage advanced troubleshooting & root cause analysis to prevent recurring problems. Collaborate effectively with development for incident resolution & product improvements, And also having an atmost Customer satisfaction results with zero compliance & escalations.
Proven ability to troubleshoot and resolve intricate network issues, including latency, connectivity problems, and ensuring optimal network performance. This expertise complements my skills in diagnosing and resolving production bugs, infrastructure concerns, and system errors.
Proven expertise in relational (SQL, Oracle, MySQL) and NoSQL (MongoDB) database management. Leverage strong query optimization skills to extract valuable insights from data. Experienced in database design and optimization for efficient performance.
Adept at Python scripting for automating tasks. Develop and integrate custom Python applications to streamline workflows and enhance operational efficiency. Experience in leveraging Python libraries for robust automation solutions.
Experienced troubleshooter skilled in resolving production bugs, infrastructure challenges, network issues, latency problems, and HTTP request/response errors. Committed to maintaining system stability and ensuring optimal performance.
I am capable to devlop any kind of application in terms of web with efficient metodology using the web - technologies. with Reponsiveness for sizes like mobile , tablets , laptops , wide screens.
An fully Automated Parking System using deep learning model , Which is an combinations of several unit blocks
An project based on the builtin dependencies of android studio called "Web-Viwer", Can try it in Android Studio if want
An web application with the methodologies of Web-Scrapping which can save your time on price comarison of E-commerce websites
In this blog i'll be posting algorithms which are widely used for to solve daily life problems through python.
One of the most common examples of the backtracking is to arrange N queens on an NxN chessboard such that no queen can strike down any other queen. A queen can attack horizontally, vertically, or diagonally , This is one of the simpliest way of solving the problem.
An algorithm used for searching or matching patterns in the text using a hash function. Unlike Naive string matching algorithm, it does not travel through every character in the initial phase rather it filters the characters that do not match and then performs the comparison.
An algorithm for finding the shortest path between all the pairs of vertices in a weighted graph. This algorithm works for both the directed and undirected weighted graphs. But, it does not work for the graphs with negative cycles.
The longest common subsequence (LCS) is defined as the longest subsequence that is common to all the given sequences, provided that the elements of the subsequence are not required to occupy consecutive positions within the original sequences.
Prim's algorithm is a popular algorithm used for finding the minimum spanning tree (MST) of a weighted undirected graph. A minimum spanning tree is a tree that spans all the vertices of the graph while minimizing the total weight of the edges.
The Kruskal's algorithm is a widely used algorithm in graph theory to find the minimum spanning tree (MST) of a connected, weighted graph. The minimum spanning tree is a subgraph that contains all the vertices of the original graph and forms a tree with the minimum possible total edge weight.
An algorithm is used to find the shortest path between two nodes in a weighted graph.It works by iteratively exploring the graph from a starting node to all other nodes, keeping track of the shortest known distances from the starting node to each node. It maintains a priority queue or a min-heap of nodes, where the priority is determined by the current shortest distance.
Feel free to show your creative thoughts & reviews through below form.