Skip to content

Data Structure repo contains important topics for cracking coding interview

Notifications You must be signed in to change notification settings

unnati2000/data-structure

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

data-structure

This is a list and code of all the important topics required for coding interview

Linked List:

  • Basic:
    • Insert
    • Delete
    • Misc
  • Intermediate:
    • detect a loop
    • merge a linked list
    • rotate a linked list
  • Advanced:
    • Intersection Point in linked list
    • Remove a loop
    • Reverse in groups

Arrays:

  • Basic:
    • remove duplicates from an array
    • move all negative elements to one side
    • leaders in an array
    • Kth max and kth min
  • Medium:
    • largest sum subarray
    • majority element

Maths:

  • armstrong number
  • number of digits in a number
  • palindrome
  • reverse a num
  • closest number
  • trailing zeros
  • GCD
  • LCM
  • power
    • recursive
    • iterative
  • If number is prime or not
  • prime factors
    • naive
    • more efficient
    • most efficient
    • divisor of a number

Bits manipulation

  • Check if kth bit is set or not
  • Count set bits in a number
  • Check if number is power of 2 or not
  • Odd occuring number
  • wo odd occuring numbers in array
  • Missing no
  • Power set

Releases

No releases published

Packages

No packages published