Coder Social home page Coder Social logo

Anmol Panchal's Projects

-sql-interview-mastery-50-leetcode-questions-for-top-tech-companies icon -sql-interview-mastery-50-leetcode-questions-for-top-tech-companies

Welcome to the ultimate SQL interview preparation repository for top tech companies like Google, Salesforce, Walmart, Metaverse, and Microsoft. This comprehensive study plan focuses on solving 50 essential SQL questions on LeetCode, providing you with the knowledge and practice needed to confidently tackle your SQL interview within just one month.

airfare_scraping icon airfare_scraping

using selenium to scrape expedia and pandas to analyze data for lowest cost airfare and identifying price trends

biopython icon biopython

Sequence Alignment and DNA Sequence random shuffling

codinginterviews icon codinginterviews

This repository contains coding interviews that I have encountered in company interviews

interview icon interview

Everything you need to prepare for your technical interview

iot_app_environmental_monitoring icon iot_app_environmental_monitoring

IoT_App to monitor Environmental factors like Temperature, Humidity using dht11 sensor, GPS using ublox neo 6m gps sensor and pollutant measure using pmsa sensor.

json icon json

Create, Send, Transform JSON Data

locality-sensitive-hashing-using-jaccard-similarity icon locality-sensitive-hashing-using-jaccard-similarity

Java implementation for Minimum Hashing and LSH for finding near duplicates and false positives from documents as measured by Jaccard similarity. Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same “buckets” with high probability (the number of buckets being much smaller than the universe of possible input items). LSH differs from conventional and cryptographic hash functions because it aims to maximize the probability of a “collision” for similar items. Locality-sensitive hashing has much in common with data clustering and nearest neighbor search. Hashing-based approximate nearest neighbor search algorithms generally use one of two main categories of hashing methods: either data-independent methods, such as locality-sensitive hashing (LSH); or data-dependent methods, such as Locality-preserving hashing.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.